Parallel algorithm for calculating the invariant sets of high-dimensional linear systems under uncertainty
- 1 January 2013
- journal article
- research article
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 53 (1), 34-43
- https://doi.org/10.1134/s096554251301003x
Abstract
The development of efficient computational methods for synthesizing controls of high-dimensional linear systems is an important problem in theoretical mathematics and its applications. This is especially true for systems with geometrical constraints imposed on the controls and uncertain disturbances. It is well known that the synthesis of target controls under the indicated conditions is based on the construction of weakly invariant sets (reverse reachable sets) generated by the solving equations of the process under study. Methods for constructing such equations and corresponding invariant sets are described, and the computational features for high-dimensional systems are discussed. The approaches proposed are based on the previously developed theory and methods of ellipsoidal approximations of multivalued functions.Keywords
This publication has 5 references indexed in Scilit:
- On the damping of a ladder-type vibration system subjected to uncertain perturbationsDifferential Equations, 2006
- On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued ConstraintsOptimization Methods and Software, 2002
- Ellipsoidal Calculus for Estimation and ControlPublished by Springer Science and Business Media LLC ,1997
- Game-Theoretical Control ProblemsSpringer Series in Soviet Mathematics, 1988
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970