Skip to main content

Alternative Theorem for Differential Games with Strongly Convex Admissible Control Sets

  • Conference paper
  • First Online:
Optimization and Applications (OPTIMA 2018)

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.

Supported by the Russian Foundation for Basic Research, grant 18-01-00209.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Isaacs, R.: Differential Games. Wiley, New York (1965)

    MATH  Google Scholar 

  2. Krasovskii, N.N.: Control of a Dynamic System. Nauka, Moscow (1985)

    Google Scholar 

  3. Pontryagin, L.S.: Linear differential pursuit games. Mat. Sb. 112(3), 307–330 (1980)

    MathSciNet  MATH  Google Scholar 

  4. Ivanov, G.E.: Weakly convex sets and their properties. Math. Notes 79(1), 55–78 (2006)

    Article  MathSciNet  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  7. Ivanov, G.E.: Weak convexity of sets and functions in a banach space. J. Convex Anal. 22(2), 365–398 (2015)

    MathSciNet  MATH  Google Scholar 

  8. Balashov, M.V., Ivanov, G.E.: Weakly convex and proximally smooth sets in Banach spaces. Izv. Math. 73(3), 455–499 (2009)

    Article  MathSciNet  Google Scholar 

  9. Balashov, M.V., Polovinkin, E.S.: M-strongly convex subsets and their generating sets. Sbornik: Math. 191(1), 25–60 (2000)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  12. Ivanov, G.E.: Weak convexity in the senses of Vial and Efimov-Stechkin. Izv. Math. 69(6), 1113–1135 (2005)

    Article  MathSciNet  Google Scholar 

  13. Balashov, M.V., Repovš, D.: Uniform convexity and the splitting problem for selections. J. Math. Anal. Appl. 360(1), 307–316 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maxim O. Golubev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ivanov, G.E., Golubev, M.O. (2019). Alternative Theorem for Differential Games with Strongly Convex Admissible Control Sets. In: Evtushenko, Y., Jaćimović, M., Khachay, M., Kochetov, Y., Malkova, V., Posypkin, M. (eds) Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science, vol 974. Springer, Cham. https://doi.org/10.1007/978-3-030-10934-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-10934-9_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-10933-2

  • Online ISBN: 978-3-030-10934-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics