Numerical construction of the information set and sufficient conditions for $k$-detection in the simple search game on the plane

  • Mestnikov Semen V., mestsv@mail.ru M. K. Ammosov North-Eastern Federal University, Institute of Mathematics and Informatics, 42, Kulakovsky St., Yakutsk 677000, Russia
  • Petrov Nikolay V., stalker_pnv@mail.ru M. K. Ammosov North-Eastern Federal University, Institute of Mathematics and Informatics, 42, Kulakovsky St., Yakutsk 677000, Russia
Keywords: differential search game, information set, mixed strategies

Abstract

The antagonistic differential simple search game on the plane is considered. The searcher is moving along straight lines. Using the auxiliary game with a detail of pursuers the estimates for the detection probability are determined. The information sets are built in the example with two and three pursuers.

References

[1]Petrosyan L. A. and Zenkevich N. A., Optimal Search under Conditions of Conflict. Textbook, Leningr. Univ., Leningrad, 1986  mathscinet
[2]Petrosyan L. A. and Garnaev A. Yu., Search Games. Textbook, Izdat. St. Petersb. Univ., St. Petersburg, 1992  mathscinet
[3]Zenkevich N. A. and Mestnikov S. V., “Dynamic search for a moving object in conditions of a conflict”, Control of dynamical systems, 14 (1991), 68–76
[4]Mestnikov S. V., “Approximation of the domain of uncertainty in differential search games”, Differ. Equations, 28:6 (1992), 967–972  mathnet  mathscinet
[5]Mestnikov S. V., “Estimates for the detection probability and uncertainty domain in a differen tial search game”, Mat. Zamet. YaGU, 1:2 (1994), 99–104
[6]Mestnikov S. V., “Information sets and mixed strategies in a differential search game”, Mat. Zamet. YaGU, 3:1 (1996), 87–94
[7]Mestnikov S. V., “Approximation of The Information Sets in Differential Search game with Detail of Pursuers”, Dynamic Games Appl., Proc. Tenth Intern. Sympos. (St. Petersburg, Russia), 2002, 630–631
[8]Mestnikov S. V., “Approximation of the information set of a differential search game with detail of searchers”, Mat. Zamet. YaGU, 9:1 (2002), 58–71  mathscinet
[9]Mestnikov S. V., Everstova G. V., “Approximation of the information set in a differential search game with a team of evaders”, Contributions to Game Theory and Management, 3 (2010), 280-288  mathscinet
[10]Mestnikov S. V., Petrov N. V., Everstova G. V., “Numerical cobstruction of the information sets in the simple search game with a team of pursuers and estimates for a detection probability”, Collected abstracts of papers presented on the Eighth International Conference Game Theory and Management (GTM2014), Graduate School of Management, SPbU, 2014, 207-208
[11]Hohzaki R., “Search games: Literature and survey”, J. Operat. Res. Soc. Japan, 59:1 (2016), 1–34  crossref  mathscinet  elib  scopus
How to Cite
Mestnikov, S. and Petrov, N. ( ) “Numerical construction of the information set and sufficient conditions for $k$-detection in the simple search game on the plane”, Mathematical notes of NEFU, 24(2), pp. 13-29. doi: https://doi.org/10.25587/SVFU.2017.2.9243.
Section
Mathematics