Advertisement

Computation of Solvability Set for Differential Games in the Plane with Simple Motion and Non-convex Terminal Set

  • Liudmila KamnevaEmail author
Article
  • 6 Downloads

Abstract

The paper suggests an algorithm for an exact construction of solvability set in a differential game with simple motion in the plane, with a fixed terminal time and a polygonal (in the general case, non-convex) terminal set. Some examples of solvability sets are computed.

Keywords

Differential games with simple motion in the plane Solvability set Backward reachable set Backward procedure 

Notes

Acknowledgements

This work was supported by the Russian Foundation for Basic Research under Project No. 18-01-00410.

References

  1. 1.
    Aubin JP (1991) Viability theory. Birkhäuser, BostonzbMATHGoogle Scholar
  2. 2.
    Bardi M, Capuzzo-Dolcetta I (1997) Optimal control and viscosity solutions of Hamilton–Jacobi–Bellman equations. Birkhäuser, BostonCrossRefzbMATHGoogle Scholar
  3. 3.
    Bardi M, Evans LC (1984) On Hopf’s formulas for solutions of HJ equations. Nonlinear Anal 8:1373–1381MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Botkin ND, Ryazantseva EA (1992) An algorithm of constructing the solvability set for linear differential games of high dimension. Trudy Inst Mat i Mekh UrO RAN 2:128–134 (in Russian) zbMATHGoogle Scholar
  5. 5.
    Bryson A, Ho YC (1969) Applied optimal control: optimization, estimation, and control. Blaisdell Publishing Company, WalthamGoogle Scholar
  6. 6.
    Cardaliaguet P, Quincampoix M, Saint-Pierre P (1999) Set-valued numerical analysis for optimal control and differential games. In: Bardi M, Raghavan TES, Parthasarathy T (eds) Stochastic and differential games: theory and numerical methods, Annals of the International Society of Dynamic Games, vol 4. Birkhäuser, Boston, pp 177–247CrossRefGoogle Scholar
  7. 7.
    Chen M, Tomlin CJ (2018) Hamilton–Jacobi reachability: some recent theoretical advances and applications in unmanned airspace management. Annu Rev Control Robot Auton Syst 1:333–358CrossRefGoogle Scholar
  8. 8.
    Ganebny SA, Kumkov SS, Le Menec S, Patsko VS (2012) Study of linear game with two pursuers and one evader: different strength of pursuers. In: Cardaliaguet P, Cressman R (eds) Advances in dynamic games. Annals of the International Society of Dynamic Games, vol 12. Birkhäuser, Boston, pp 269–292Google Scholar
  9. 9.
    Hadwiger H (1957) Vorlesungen uber Inhalt, Oberflache und Isoperimetrie. Springer, BerlinCrossRefzbMATHGoogle Scholar
  10. 10.
    Hopf E (1965) Generalized solutions of nonlinear equations of first order. J Math Mech 14(6):951–973MathSciNetzbMATHGoogle Scholar
  11. 11.
    Isaacs R (1965) Differential games. Wiley, New YorkzbMATHGoogle Scholar
  12. 12.
    Isakova E, Logunova G, Patsko V (1984) Construction of stable bridges in a linear differential game with fixed terminal time. In: Subbotin AI, Patsko VS (eds) Algorithms and programs of solution of linear differential games: collection of scientific works. Inst. Mat. Mekh, Sverdlovsk, pp 127–158 (in Russian) Google Scholar
  13. 13.
    Kamneva LV, Patsko VS (2016) Maximal stable bridge in game with simple motions in the plane. In: Thuijsman F, Wagener F (eds) Advances in dynamic and evolutionary games: theory, applications, and numerical methods, Annals of the International Society of Dynamic Games, vol 14. Birkhäuser, Basel, pp 139–163CrossRefGoogle Scholar
  14. 14.
    Krasovskii NN (1970) Game problems on the encounter of motions. Nauka, Moscow (in Russian) zbMATHGoogle Scholar
  15. 15.
    Krasovskii NN, Subbotin AI (1974) Positional differential games. Nauka, Moscow (in Russian) zbMATHGoogle Scholar
  16. 16.
    Krasovskii NN, Subbotin AI (1988) Game-theoretical control problems. Springer, New YorkCrossRefGoogle Scholar
  17. 17.
    Kumkov SS, Le Menec S, Patsko VS (2017) Zero-sum pursuit-evasion differential games with many objects: survey of publications. Dyn Games Appl 7(4):609–633MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Margellos K, Lygeros J (2011) Hamilton–Jacobi formulation for reach-avoid differential games. IEEE Trans Autom Control 56(8):1849–1861MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Patsko VS (1996) Special aspects of convex hull constructing in linear differential games of small dimension. IFAC Proc Vol 29(8):19–24CrossRefGoogle Scholar
  20. 20.
    Pontryagin LS (1967) Linear differential games, II. Soviet Math Dokl 8:910–912zbMATHGoogle Scholar
  21. 21.
    Pshenichnyy BN, Sagaydak MI (1971) Differential games with fixed time. J Cybern 1(1):117–135MathSciNetCrossRefGoogle Scholar
  22. 22.
    Subbotin AI (1988) A piecewise-linear cost function for a differential game with simple moves. Optimal control and differential games, Trudy Mat. Inst. Steklov., vol 185. Nauka, Moscow, pp 242–251 (Russian); Proceedings of the Steklov Inst Math 185(2): 269–278 (1990)Google Scholar
  23. 23.
    Subbotin AI (1995) Generalized solutions of first-order PDEs: the dynamical optimization perspective. Birkhäuser, BostonCrossRefGoogle Scholar
  24. 24.
    Zarkh MA, Patsko VS (1987) Numerical solution of a third-order directed game. Izv Akad Nauk SSSR Tekhn Kibernet 6: 162–169 (Russian); Soviet J Comput Syst Sci 26(4): 92–99 (1988)Google Scholar
  25. 25.
    Zarkh MA, Ivanov AG (1992) Construction of the value function in the linear differential game with the fixed terminal time. Trudy Inst Mat i Mekh UrO RAN 2:140–155 (in Russian) zbMATHGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Krasovskii Institute of Mathematics and MechanicsYekaterinburgRussia

Personalised recommendations