Skip to main content
Log in

Parallel algorithm for calculating the invariant sets of high-dimensional linear systems under uncertainty

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Rockafellar, Convex Analysis (Princeton Univ. Press, Princeton, 1970; Mir, Moscow, 1973).

    MATH  Google Scholar 

  2. E. S. Polovinkin and M. V. Balashov, Elements of Convex and Strongly Convex Analysis (Fizmatlit, Moscow, 2004) [in Russian].

    Google Scholar 

  3. N. N. Krasovski and A. I. Subbotin, Game-Theoretical Control Problems (Springer-Verlag, New York, 1988).

    Book  Google Scholar 

  4. A. B. Kurzhanski and O. I. Nikonov, “Evolution Equations for Tubes of Trajectories of Synthesized Control Systems,” Dokl. Akad. Nauk 333, 578–581 (1993).

    Google Scholar 

  5. A. B. Kurzhanski, “Pontryagin’s Alternated Integral in the Theory of Control Synthesis,” Proc. Steklov Inst. Math., Russ. Acad. Sci., 224, 212–225 (1999).

    Google Scholar 

  6. A. B. Kurzhanski and I. Vályi, Ellipsoidal Calculus for Estimation and Control (Birkhäuser, Boston, 1997).

    Book  MATH  Google Scholar 

  7. A. B. Kurzhanski and P. Varaiya, “Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations: Box-Valued Constraints,” Optim. Methods Software 17, 207–237 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  8. I. V. Vostrikov, A. N. Daryin, and A. B. Kurzhanski, “On the Damping of a Ladder-Type Vibration System Subjected to Uncertain Perturbations,” Differ. Equations 42, 1524–1535 (2006).

    Article  MATH  Google Scholar 

  9. T. Basar and J. Olsder, Dynamic Noncooperative Game Theory (Academic, New York, 1982).

    MATH  Google Scholar 

  10. A. A. Kurzhanskiy and P. Varaiya, http://code.google.com/p/ellipsoids/, 2005.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. N. Daryin.

Additional information

Original Russian Text © A.N. Daryin, A.B. Kurzhanski, 2013, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2013, Vol. 53, No. 1, pp. 47–57.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daryin, A.N., Kurzhanski, A.B. Parallel algorithm for calculating the invariant sets of high-dimensional linear systems under uncertainty. Comput. Math. and Math. Phys. 53, 34–43 (2013). https://doi.org/10.1134/S096554251301003X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S096554251301003X

Keywords

Navigation