In this paper, a differential game of kind of several pursuers and one evader is studied. All the players move only along the edges of a simplex of dimension $d$ $d$ . The maximal speed of each pursuer is less than that of the evader. If the state of a pursuer coincides with the state of the evader, then pursuit is completed. An exact mathematical formulation of the problem is given by introducing special classes of strategies adapted for games on graphs. Sufficient conditions for completion of pursuit and possibility of evasion are obtained. In the case where the simplex is regular we obtained a condition. If this condition is satisfied, then pursuit can be completed, else evasion is possible.

Keywords:

AMSC: Primary: 91A23, Secondary: 91A43

References

Andreae, T. [1984] Note on a pursuit game played on graphs, Discrete Appl. Math. 9(2), 111–115. Crossref, Web of Science, Google Scholar
Andreae, T. [1991] A search problem on graphs which generalizes some group testing problems with two defectives. Combinatorics of ordered sets (Oberwolfach, 1988), Discrete Math. 88(2–3), 121–127. Crossref, Web of Science, Google Scholar
Andreae, T., Hartenstein, F. and Wolter, A. [1999] A two-person game on graphs where each player tries to encircle his opponent’s men, Theoret. Comput. Sci. (Math. Games) 215, 305–323. Crossref, Web of Science, Google Scholar
Azamov, A. A., Kuchkarov, A. Sh. and Holboyev, A. G. [2015] The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. I, Math. Teor. Igr Pril. 7(3), 3–15. Google Scholar
Azamov, A. A., Kuchkarov, A. Sh. and Holboyev, A. G. [2016] The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. II, Math. Teor. Igr Pril. 8(4), 3–13. Google Scholar
Azamov, A. A., Kuchkarov, A. Sh. and Holboyev, A. G. [2019] The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. III, Math. Teor. Igr Pril. 11(4), 5–23. Google Scholar
Azamov, A. and Ibaydullaev, T. [2020] A pursuit-evasion differential game with slow pursuers on the edge graph of simplexes I, Math. Game Theory Appl. 12(4), 7–23. https://doi.org/10.17076/mgta˙2020˙4˙23 Crossref, Google Scholar
Azamov, A. A. and Iskanadjiev, I. M. [2012] Pontryagin’s alternating integral for differential inclusions with counteraction, Contrib. Game Theory Manage. V, 33–44. Google Scholar
Azamov, A. A. and Samatov, B. T. [2011] The $Π$ $Π$ -strategy: Analogies and applications, Contrib. Game Theory Manage. IV, 33–46. Google Scholar
Azamov, A. A. [1986] On an alternative for pursuit-evasion games in an infinite time interval, J. Appl. Math. Mech. 50(4), 428–432 [1986] Prikl. Matem. Mechan. 26(4), 561–566. Google Scholar
Azamov, A. A. [2008] Lower bound for the advantage coefficient in the graph search problem, Differ. Equ. 44(12), 1764–1767. Crossref, Web of Science, Google Scholar
Azamov, A. A. [2011] Foundations of the Theory of Discrete Games (Niso Poligraf, Tashkent). Google Scholar
Bakolas, E. and Tsiotras, P. [2012] Relay pursuit of a maneuvering target using dynamic voronoi diagrams, Automatica 48, 2213–2220. Crossref, Web of Science, Google Scholar
Berge, C. [1976] Colloque sur la Théorie des Jeux, Tenu á Bruxellesle 29 etle 30 mai 1975, Cahiers Centre ÉtudesRechercheOpér, Vol. 18 (1–2), 1–253. (Institut de Statistique, Université Libre de Bruxelles, Brussels), pp. 1–267 (French). Google Scholar
Bonato, A., Golovach, P., Hahn, G. and Kratochvíl, J. [2009] The capture time of a graph, Discrete Math. 309(18), 5588–5595. Crossref, Web of Science, Google Scholar
Bonato, A. and Nowakowski, R. J. [2011] The Game of Cops and Robbers on Graphs, Student Mathematical Library, Vol. 61 (American Mathematical Society, Providence, RI, 2011), xx+276 pp. Crossref, Google Scholar
Bulgakova, M. A. and Petrosyan, L. A. [2019] Multistage games with pairwise interactions on full graph, Math. Teor. Igr Pril. 11(1), 3–20. Google Scholar
Fomin, F. V. and Thilikos, D. M. [2008] An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci. 399, 236–245. Crossref, Web of Science, Google Scholar
Friedman, A. [1971] Differential Games (Wiley, New York), 350 p. Google Scholar
Gavenčiak, T. [2010] Cop-win graphs with maximum capture-time, Discrete Math. 310(10–11), 1557–1563. Crossref, Web of Science, Google Scholar
Golovach, P. A., Petrov, N. N. and Fomin, F. V. [2000] Search in graphs, Proc. Steklov Inst. Math. Control Dyn. Syst. Suppl. 1, 90–103. Google Scholar
Grigorenko, N. L. [1990] Mathematical Methods of Control of Several Dynamic Processes (MSU Press, Moscow) (in Russian). Google Scholar
Ibragimov, G., Ferrara, M., Kuchkarov, A. and Pansera, B. A. [2018] Simple motion evasion differential game of many pursuers and evaders with integral constraints, Dyn. Games Appl. 8, 352–378. https://doi.org/10.1007/s13235-017-0226-6 Crossref, Web of Science, Google Scholar
Ibragimov, G. and Luckraz, S. [2017] On a characterization of evasion strategies for pursuit-evasion games on graphs, J. Optim. Theory Appl. 175, 590–596. https://doi.org/10.1007/s10957-017-1155-7 Crossref, Web of Science, Google Scholar
Ibragimov, G. and Salleh, Y. [2012] Simple motion evasion differential game of many pursuers and one evader with integral constraints on control functions of players, J. Appl. Math. 2012, 748096. https://doi.org/10.1155/2012/748096 Crossref, Web of Science, Google Scholar
Ibragimov, G. I. and Satimov, N. Yu. [2012] A multi player pursuit differential game on closed convex set with integral constraints, Abs. Appl. Anal. 2012, 460171. https://doi.org/10.1155/2012/460171 Google Scholar
Isaacs, R. [1965] Differential Games (John Wiley & Sons, New York, NY). Google Scholar
Krasovskii, N. N. and Subbotin, A. I. [1988] Game-Theoretical Control Problems (Springer, New York). Crossref, Google Scholar
Krasovskii, N. N. [1968] Theory of Control of Motion : Linear Systems (Nauka, Moscow). Google Scholar
Kummer, B. Spiele auf Graphen, International Series of Numerical Mathematics, Vol. 44 (Birkhäuser Verlag, Boston, MA, 1980), 94 p. (German). Crossref, Google Scholar
Littlewood, J. E. [1986] in Littlewood’s Miscellany, ed. Béla, B. (Cambridge University Press, Cambridge). Google Scholar
Nowakowski, R. J. [2019] Unsolved Problems in Combinatorial Games, Games of no Chance, Vol. 5, Mathematical Sciences Research Institute Publications 70 (Cambridge University Press, Cambridge), pp. 125–168. Google Scholar
Petrosyan, L. A. and Sedak, A. A. [2009] Multi-step network game with full information, Math. Theory Games Appl. 1(2), 66–81. Google Scholar
Petrosyan, L. A. [1993] Differential Games of Pursuit (World Scientific, Singapore, London). Link, Google Scholar
Pontryagin, L. S. [1988] Selected Works (Nauka, Moscow). Google Scholar
Pshenichny, B. N. and Ostapenko, V. V. [1992] Differential Games (Naukova Dumka), 262 pp. Google Scholar
Ramana, M. V. and Kothari, M. [2017] Pursuit strategy to capture high-speed evaders using multiple pursuers, J. Guid. Control Dyn. 40(1), 139–149. https://doi.org/10.2514/1.G000584 Crossref, Web of Science, Google Scholar
Sierpinski, W. [1965] Cardinal and Ordinal Numbers (Warsaw Polish Scientific Publishers), 491 pp. Google Scholar