Capture of Given Number of Evaders in Pontryagin’s Nonstationary Example

  • Nikolai N. Petrov
  • Nadezhda A. Solov’evaEmail author


The article deals with Pontryagin’s generalized nonstationary example with n pursuers and m evaders with the same dynamic and inertial capabilities of players. The set of values of admissible controls V is a strictly convex compact set with a smooth boundary. The pursuers use quasi-strategies. Sufficient conditions for the pursuers’ group to capture one evader and the given number of evaders are presented in the terms of the initial position and the parameters of the game. In the problem of catching a given number of evaders, it is assumed that at first all evaders choose their open-loop controls and then the pursuers determine their motions on the basis of the information about the choice of the evaders and, moreover, each pursuer catches no more than one evader.


Differential game Group pursuit The objective of capturing Pontryagin’s example Recurrent function 



This work was supported by Grant 1.5211.2017/8.9 by the Ministry of Education and Science of the Russian Federation within the framework of the basic part of the state project in the field of science and Grant 16-01-00346 from Russian Foundation for Basic Research. We sincerely appreciate the efforts of the reviewers of this article. Indeed, their valuable observations, comments and suggestions improve the quality of the work.


  1. 1.
    Alexander S, Bishop R, Christ R (2009) Capture pursuit games on unbounded domain. L’Enseignement Mathematique 55(1/2):103–125MathSciNetzbMATHGoogle Scholar
  2. 2.
    Alias IA, Ibragimov GI, Rakmanov A (2016) Evasion differential games of infinitely many evaders from infinitely many pursuers in Hilbert space. Dyn Games Appl 6(2):1–13MathSciNetGoogle Scholar
  3. 3.
    Bannikov AS, Petrov NN (2010) On a nonstationary problem of group pursuits. Proc Steklov Inst Math 271(1):41–52MathSciNetzbMATHGoogle Scholar
  4. 4.
    Bannikov AS (2011) About a problem of positional capture of one evader by group puruers. Vesntik Udmurtskogo Universiteta. Mathematika, Mekhanika, Komp’yuternye Nauki 2:1–7 (in Russian)Google Scholar
  5. 5.
    Blagodatskikh AI (2007) About a problem of group pursuit in non-stationary Pontriagin’s problem. Vestnik Udmurtskogo Universiteta. Matematika 1:17–24 (in Russian)Google Scholar
  6. 6.
    Blagodatskikh AI (2008) Group pursuit in non-stationary Pontryagin’s problem. Differ Equ 44(1):40–46MathSciNetzbMATHGoogle Scholar
  7. 7.
    Blagodatskikh AI, Petrov NN (2009) Conflict interaction of groups of controlled objects. Udmurt State University, Izhevsk (in Russian)Google Scholar
  8. 8.
    Blagodatskikh AI, Petrov NN (2015) Group pursuit with state constraints in Pontryagin’s almost periodic example. Differ Equ 51(3):391–398MathSciNetzbMATHGoogle Scholar
  9. 9.
    Blaquiere A, Gerard F, Leitmann G (1969) Quantitative and qualitative differential games. Academic Press, New YorkzbMATHGoogle Scholar
  10. 10.
    Bopardikar SD, Suri S (2014) \(k\)-Capture in multiagent pursuit evasion, or the lion and hyenas. Theor Comput Sci 522:13–23MathSciNetzbMATHGoogle Scholar
  11. 11.
    Chikrii AA (1992) Conflict controlled prosesses. Naukova Dumka, Kiev (in Russian)Google Scholar
  12. 12.
    Chikrii AA, Prokopovich PV (1992) Simple pursuit of one evader by a group. Cybern Syst Anal 28(3):438–444MathSciNetzbMATHGoogle Scholar
  13. 13.
    Friedman A (1971) Differential games. Wiley, New YorkzbMATHGoogle Scholar
  14. 14.
    Ganebny SA, Kumkov SS, Le Menec S, Patsko VS (2012) Model problem in a line with two pursuers and one evader. Dyn Games Appl 2:228–257MathSciNetzbMATHGoogle Scholar
  15. 15.
    Grigorenko NL (1983) A simple pursuit–evasion game with a group of pursuers and one evader. Vestn. Mosk. Gos. Univ Ser Vychisl Mat Kibern 1:41–47 (in Russian)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Grigorenko NL (1990) Mathematical methods of control over multiple dynamic processes. Moscow State University, Moscow (in Russian)Google Scholar
  17. 17.
    Hagedorn P, Breakwell JV (1976) A differential game with two pursuers and one evader. J Optim Theory Appl 18(2):15–29MathSciNetzbMATHGoogle Scholar
  18. 18.
    Hajek O (1975) Pursuit games. Academic Press, New YorkzbMATHGoogle Scholar
  19. 19.
    Hall M (1986) Combinatorial theory. Wiley, New YorkzbMATHGoogle Scholar
  20. 20.
    Huang H, Zhang W, Ding J, Stipanovic DM, Tomlin CJ (2011) Guaranteed decentralized pursuit–evasion in the plane with multiple pursuers. In: Proceedings of IEEE conference decision and control, pp 4835–4840Google Scholar
  21. 21.
    Isaacs R (1965) Differential games. Wiley, New YorkzbMATHGoogle Scholar
  22. 22.
    Krasovskii NN (1970) Game problems of contact of motions. Nauka, Moscow (in Russian)zbMATHGoogle Scholar
  23. 23.
    Krasovskii NN, Subbotin AI (1974) Positional differential games. Nauka, Moscow (in Russian)zbMATHGoogle Scholar
  24. 24.
    Kuchkarov AS, Ibragimov GI, Khakestari M (2013) On a linear differential game of optimal approach of many pursuers with one evader. J Dyn Control Syst 19(1):1–15MathSciNetzbMATHGoogle Scholar
  25. 25.
    Leitmann G (1974) Cooperative and noncooperative many-player differential games. Springer, ViennaGoogle Scholar
  26. 26.
    Petrosyan LA (1993) Differential games of pursuit. World Scientific, New YorkzbMATHGoogle Scholar
  27. 27.
    Petrov NN (1997) Multiple capture in Pontryagin’s example with phase constraints. J Appl Math Mech 61(5):725–732MathSciNetGoogle Scholar
  28. 28.
    Petrov NN (1996) On a certain problem of puruit of a group of evaders. Autom Remote Control 57(6):808–813zbMATHGoogle Scholar
  29. 29.
    Petrov NN (2000) Non-stationary Pontryagin example with phase restrictions. J Autom Inf Sci 32(10):11–17Google Scholar
  30. 30.
    Petrov NN, Prokopenko VA (1987) On a problem of pursuit of a group of evaders. Differ Equ 23(4):724–726 (in Russian)MathSciNetzbMATHGoogle Scholar
  31. 31.
    Pontryagin LS (1988) Selected scientific works. Nauka, Moscow (in Russian)zbMATHGoogle Scholar
  32. 32.
    Pschenichinyi BN (1976) Simple pursuit by several objects. Kibernetika 3:145–146 (in Russian)MathSciNetGoogle Scholar
  33. 33.
    Satimov NY, Rikhsiev BB (2000) Methods of solving the problem of avoiding encounter in mathematical control theory. Fan, Tashkent (in Russian)zbMATHGoogle Scholar
  34. 34.
    Stipanovic DM, Melikyan A, Hovakimyan N (2010) Guaranteed strategies for nonlinear multi-player pursuit–evasion games. Int Game Theory Rev 12(1):1–17MathSciNetzbMATHGoogle Scholar
  35. 35.
    Subbotin AI, Chentsov AG (1981) Optimization of a guarantee in problems of control. Nauka, Moscow (in Russian)zbMATHGoogle Scholar
  36. 36.
    Zubov VI (1962) The theory of recurrent functions. Sib Math J 3(4):532–560 (in Russian)MathSciNetGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Udmurt State UniversityIzhevskRussia

Personalised recommendations