Name
Title | ||
|---|---|---|
Estimation of reachability sets for large-scale uncertain systems: From theory to computation |
Abstract | ||
|---|---|---|
The estimation of reachability sets for systems of high dimensions is a challenging issue due to its high computational complexity. For linear systems, an efficient way of calculating such estimates is to find their set-valued approximations provided by ellipsoidal calculus. The present paper deals with various aspects of such approach as applied to systems of high dimensions with unknown but bounded input disturbances. We present an innovative technique based on parallel computation that involves on-line mixing of ellipsoidal tubes found in parallel. This improves robustness of the ellipsoidal estimates. Finally discussed is an implementation of the algorithm intended for supercomputer clusters. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CDC.2012.6426597 | Decision and Control |
Keywords | Field | DocType |
approximation theory,computational complexity,estimation theory,large-scale systems,linear systems,mainframes,parallel processing,reachability analysis,uncertain systems,workstation clusters,bounded input disturbances,computation theory,computational complexity,ellipsoidal calculus,ellipsoidal estimation robustness,large-scale uncertain systems,on-line mixing,parallel computation-based innovative technique,parallel ellipsoidal tubes,reachability set estimation,set-valued approximations,supercomputer clusters | Mathematical optimization,Linear system,Supercomputer,Computer science,Robustness (computer science),Reachability,Estimation theory,Bounded function,Computation,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
0743-1546 E-ISBN : 978-1-4673-2064-1 | 978-1-4673-2064-1 | 3 |
PageRank | References | Authors |
0.42 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander N. Daryin | 1 | 6 | 1.48 |
| Alexander B. Kurzhanski | 2 | 204 | 25.02 |