Advertisement

On a Solution of a Guarantee Optimization Problem Under the Functional Constraints on the Disturbance

  • Mikhail Gomoyunov
  • Dmitriy Serkov
Article
  • 13 Downloads

Abstract

The paper deals with a control problem for a dynamical system under disturbances. A motion of the system is considered on a finite interval of time and described by a nonlinear ordinary differential equation. The control is aimed at minimization of a given quality index. In addition to geometric constraints on the control and disturbance, it is supposed that the disturbance satisfies a compact functional constraint. Namely, all disturbance realizations that can happen in the system belong to some unknown set that is compact in the space \(L_1\). Within the game-theoretical approach, the problem of optimizing the guaranteed result of the control is studied. For solving this problem, we propose a new construction of the optimal control strategy. In the linear-convex case, this strategy can be numerically realized on the basis of the upper convex hulls method. Examples are considered. Results of numerical simulations are given.

Keywords

Control problem Disturbances Functional constraint Optimal guaranteed result Optimal strategy Reconstruction Numerical method 

Notes

Acknowledgements

We thank the referees for their careful reading and their remarks that allowed us to improve the paper.

References

  1. 1.
    Gomoyunov MI, Kornev DV (2016) On calculating the value of a differential game in the class of counter strategies. Ural Math J 2(1):38–47CrossRefGoogle Scholar
  2. 2.
    Gomoyunov MI, Serkov DA (2017) Control with a guide in the guarantee optimization problem under functional constraints on the disturbance. Proc Steklov Inst Math 299(Suppl 1):49–60MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Isaacs R (1965) Differential games. Wiley, New YorkzbMATHGoogle Scholar
  4. 4.
    Kornev DV (2012) On numerical solution of positional differential games with nonterminal payoff. Autom Rem Control 73(11):1808–1821MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Krasovskii AN, Krasovskii NN (1995) Control under lack of information. Birkhäuser, BostonCrossRefzbMATHGoogle Scholar
  6. 6.
    Krasovskii NN (1985) Control of a dynamical system. Nauka, Moscow (in Russian)Google Scholar
  7. 7.
    Krasovskii NN, Subbotin AI (1988) Game-theoretical control problems. Springer, New YorkCrossRefGoogle Scholar
  8. 8.
    Kryazhimskii AV (1991) The problem of optimization of the ensured result: unimprovability of full-memory strategies. In: Kryazhimskii AV (ed) Constantin caratheodory: an international tribute, vol 1. World Scientific, Teaneck, pp 636–675CrossRefGoogle Scholar
  9. 9.
    Lukoyanov NYu, Gomoyunov MI (2019) Differential games on minmax of the positional quality index (submitted to Dyn Games Appl)Google Scholar
  10. 10.
    Osipov YuS, Kryazhimskii AV (1995) Inverse problems for ordinary differential equations: dynamical solutions. Gordon and Breach Science Publishers, LondonzbMATHGoogle Scholar
  11. 11.
    Roxin E (1969) Axiomatic approach in differential games. J Optim Theory Appl 3(3):153–163MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Ryll-Nardzewski C (1964) A theory of pursuit and evasion. In: Dresher M, Shapley LS, Tucker AW (eds) Advances in game theory. Princeton University Press, Princeton, pp 113–126Google Scholar
  13. 13.
    Serkov DA (2012) Guaranteed control under functionally restricted disturbances. Mat Teor Igr Prilozh 4(2):71–95 (in Russian)zbMATHGoogle Scholar
  14. 14.
    Serkov DA (2012) Optimal guarantee under the disturbances of Caratheodory type. Vestn Udmurtsk Univ Mat Mekh Komp Nauki 2:74–83 (in Russian)CrossRefzbMATHGoogle Scholar
  15. 15.
    Serkov DA (2013) Optimal risk control under functionally restricted disturbances. Mat Teor Igr Prilozh 5(1):74–103 (in Russian)zbMATHGoogle Scholar
  16. 16.
    Serkov DA (2014) On the unimprovability of full-memory strategies in the risk minimization problem. Proc Steklov Inst Math 287(Suppl 1):175–184MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Serkov DA (2015) On the unimprovability of full-memory strategies in problems of guaranteed result optimization. Proc Steklov Inst Math 291(Suppl 1):157–172MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Subbotin AI, Chentsov AG (1981) Guarantee optimization in control problems. Nauka, Moscow (in Russian)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of SciencesUral Branch of Russian Academy of SciencesEkaterinburgRussia
  2. 2.Ural Federal UniversityEkaterinburgRussia

Personalised recommendations