Advertisement

Alternative Theorem for Differential Games with Strongly Convex Admissible Control Sets

  • Grigorii E. Ivanov
  • Maxim O. GolubevEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 974)

Abstract

A linear differential game with strongly convex admissible control sets and a smooth target set is considered. For such a differential game we obtain the alternative theorem. This theorem states that for any initial position either there is a program strategy of pursuer that guarantees the capture or there is a program strategy of evader that guarantees the evasion. This result is based on the commutativity of the Minkowski sum and difference for sets with special properties of strong and weak convexity in a Banach space.

Keywords

Differential game Strongly convex set The Minkowski sum and difference 

References

  1. 1.
    Isaacs, R.: Differential Games. Wiley, New York (1965)zbMATHGoogle Scholar
  2. 2.
    Krasovskii, N.N.: Control of a Dynamic System. Nauka, Moscow (1985)Google Scholar
  3. 3.
    Pontryagin, L.S.: Linear differential pursuit games. Mat. Sb. 112(3), 307–330 (1980)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Ivanov, G.E.: Weakly convex sets and their properties. Math. Notes 79(1), 55–78 (2006)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bernard, F., Thibault, L., Zlateva, N.: Characterization of proximal regular sets in super reflexive Banach spaces. J. Convex Anal. 13(3–4), 525–559 (2006)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Bernard, F., Thibault, L., Zlateva, N.: Prox-regular sets and epigraphs in uniformly convex Banach spaces: various regularities and other properties. Trans. Amer. Math. Soc. 363, 2211–2247 (2011)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Ivanov, G.E.: Weak convexity of sets and functions in a banach space. J. Convex Anal. 22(2), 365–398 (2015)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Balashov, M.V., Ivanov, G.E.: Weakly convex and proximally smooth sets in Banach spaces. Izv. Math. 73(3), 455–499 (2009)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Balashov, M.V., Polovinkin, E.S.: M-strongly convex subsets and their generating sets. Sbornik: Math. 191(1), 25–60 (2000)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Ivanov, G.E., Lopushanski, M.S.: Well-posedness of approximation and optimization problems for weakly convex sets and functions. J. Math. Sci. 209(61), 66–87 (2015)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Efimov, N.V., Stechkin, S.B.: Support properties of sets in Banach spaces. Dokl. Akad. Nauk SSSR 127(2), 254–257 (1959). (in Russian)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Ivanov, G.E.: Weak convexity in the senses of Vial and Efimov-Stechkin. Izv. Math. 69(6), 1113–1135 (2005)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Balashov, M.V., Repovš, D.: Uniform convexity and the splitting problem for selections. J. Math. Anal. Appl. 360(1), 307–316 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Moscow Institute of Physics and Technology (State University)Dolgoprudny, Moscow RegionRussian Federation

Personalised recommendations