Skip to main content

2016 | OriginalPaper | Buchkapitel

7. Maximal Stable Bridge in Game with Simple Motions in the Plane

verfasst von : Liudmila Kamneva, Valerii Patsko

Erschienen in: Advances in Dynamic and Evolutionary Games

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

It is known that the solvability set (the maximal stable bridge) in a zero-sum differential game with simple motions, fixed terminal time, geometrical constraints for controls of the first and second players, and convex terminal set can be constructed by a program absorption operator. A backward procedure for construction of a t-section of the solvability set does not need any partition of the time segment. In the article, we assert the same property for a game with simple motions, polygonal terminal set (generally non-convex), and polygonal constraints for controls of the players in the plane. In the specific case of a convex terminal set, the operator used in the article coincides with the program absorption operator.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Botkin ND, Hoffman K-H, Turova VL (2011) Stable numerical schemes for solving Hamilton–Jacobi–Bellman–Isaacs equations. SIAM J Sci Comput 33(2):992–1007MathSciNetCrossRefMATH Botkin ND, Hoffman K-H, Turova VL (2011) Stable numerical schemes for solving Hamilton–Jacobi–Bellman–Isaacs equations. SIAM J Sci Comput 33(2):992–1007MathSciNetCrossRefMATH
Zurück zum Zitat Cardaliaguet P, Quincampoix M, Saint-Pierre P (1999) Set-valued numerical analysis for optimal control and differential games. In: Bardi M, Raghavan TE, Parthasarathy T (eds) Annals of the international society of dynamic games, vol 4. Birkhauser, Boston, pp 177–247 Cardaliaguet P, Quincampoix M, Saint-Pierre P (1999) Set-valued numerical analysis for optimal control and differential games. In: Bardi M, Raghavan TE, Parthasarathy T (eds) Annals of the international society of dynamic games, vol 4. Birkhauser, Boston, pp 177–247
Zurück zum Zitat Cristiani E, Falcone M (2006) A fast marching method for pursuit-evasion games. In: Communications to SIMAI Congress, vol 1. doi:10.1685/CSC06059. ISSN 1827-9015 Cristiani E, Falcone M (2006) A fast marching method for pursuit-evasion games. In: Communications to SIMAI Congress, vol 1. doi:10.1685/CSC06059. ISSN 1827-9015
Zurück zum Zitat Dvurechensky PE, Ivanov GE (2014) Algorithms for computing Minkowski operators and their application in differential games. Comput Math Math Phys 54(2):235–264MathSciNetCrossRefMATH Dvurechensky PE, Ivanov GE (2014) Algorithms for computing Minkowski operators and their application in differential games. Comput Math Math Phys 54(2):235–264MathSciNetCrossRefMATH
Zurück zum Zitat Kamneva LV, Patsko VS (2013) Open-loop solvability operator in differential games with simple motions in the plane. In: Krivan V, Zaccour G (eds) Advances in dynamic games: theory, applications, and numerical methods. Annals of the international society of dynamic games, vol 13. Birkhäuser, Basel, pp 239–262CrossRef Kamneva LV, Patsko VS (2013) Open-loop solvability operator in differential games with simple motions in the plane. In: Krivan V, Zaccour G (eds) Advances in dynamic games: theory, applications, and numerical methods. Annals of the international society of dynamic games, vol 13. Birkhäuser, Basel, pp 239–262CrossRef
Zurück zum Zitat Krasovskii NN, Subbotin AI (1974) Positional differential games. Nauka, Moscow (in Russian)MATH Krasovskii NN, Subbotin AI (1974) Positional differential games. Nauka, Moscow (in Russian)MATH
Zurück zum Zitat Krasovskii NN, Subbotin AI (1988) Game-theoretical control problems. Springer, New YorkCrossRef Krasovskii NN, Subbotin AI (1988) Game-theoretical control problems. Springer, New YorkCrossRef
Zurück zum Zitat Kumkov SS, Patsko VS, Shinar J (2005) On level set with “narrow throats” in linear differential games. Int Game Theory Rev 7(3):285–311MathSciNetCrossRefMATH Kumkov SS, Patsko VS, Shinar J (2005) On level set with “narrow throats” in linear differential games. Int Game Theory Rev 7(3):285–311MathSciNetCrossRefMATH
Zurück zum Zitat Sethian JA (1999) Level set methods and fast marching methods. Cambridge University Press, CambridgeMATH Sethian JA (1999) Level set methods and fast marching methods. Cambridge University Press, CambridgeMATH
Zurück zum Zitat Subbotin AI (1995) Generalized solutions of first-order PDEs: the dynamical optimization perspective. Birkhäuser, BostonCrossRefMATH Subbotin AI (1995) Generalized solutions of first-order PDEs: the dynamical optimization perspective. Birkhäuser, BostonCrossRefMATH
Zurück zum Zitat Subbotin AI, Patsko VS (eds) (1984) Algorithms and programs for solving linear differential games. Institute of Mathematics and Mechanics, Sverdlovsk (in Russian) Subbotin AI, Patsko VS (eds) (1984) Algorithms and programs for solving linear differential games. Institute of Mathematics and Mechanics, Sverdlovsk (in Russian)
Zurück zum Zitat Taras’ev AM, Ushakov VN, Khripunov AP (1987) On a computational algorithm for solving game control problem. J Appl Math Mech 51(2):216–222 (in Russian)MathSciNetMATH Taras’ev AM, Ushakov VN, Khripunov AP (1987) On a computational algorithm for solving game control problem. J Appl Math Mech 51(2):216–222 (in Russian)MathSciNetMATH
Metadaten
Titel
Maximal Stable Bridge in Game with Simple Motions in the Plane
verfasst von
Liudmila Kamneva
Valerii Patsko
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-28014-1_7

Premium Partner