NUMERICAL CONSTRUCTION OF THE INFORMATION SET AND SUFFICIENT CONDITIONS FOR k–DETECTION IN THE SIMPLE SEARCH GAME ON THE PLANE
https://doi.org/10.25587/SVFU.2017.2.9243
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.
About the Authors
S. V. Mestnikov
M. K. Ammosov North-Eastern Federal University
Russian Federation
Russian Federation
Semen V. Mestnikov
M. K. Ammosov North-Eastern Federal University, Institute of Mathematics and Informatics, 42, Kulakovsky St., Yakutsk 677000, Russia
N. V. Petrov
M. K. Ammosov North-Eastern Federal University
Russian Federation
Russian Federation
Nikolay V. Petrov
M. K. Ammosov North-Eastern Federal University, Institute of Mathematics and Informatics, 42, Kulakovsky St., Yakutsk 677000, Russia
References
1. Петросян Л. А., Зенкевич Н. А. Оптимальный поиск в условиях конфликта. Л.: ЛГУ, 1986.
2. Петросян Л. А., Гарнаев А. Ю. Игры поиска. СПб: СПбГУ, 1992.
3. Зенкевич Н. А., Местников С. В. Динамический поиск подвижного объекта в условиях конфликта // Вопросы механики и процессов управления. 1991. Т. 14. С. 68-76.
4. Местников С. В. Аппроксимация области неопределенности в дифференциальных играх поиска // Дифференц. уравнения. 1992. N 6. T. 28. С. 967-972.
5. Mestnikov S. V. Estimates for the detection probability and uncertainty domain in a differential search game // Мат. заметки ЯГУ. 1994, Т. 1, вып. 2. С. 99–104.
6. Mestnikov S. V. Information sets and mixed strategies in a differential search game // Мат. заметки ЯГУ. 1996. Т. 3, вып. 1. С. 87–94.
7. Mestnikov S. V. Approximation of The Information Sets in Differential Search game with Detail of Pursuers // Proc. Tenth Intern. Sympos. Dynamic Games Appl. St. Petersburg. Russia. 2002. P. 630–631.
8. Местников С.В. Аппроксимация информационного множества дифференциальной игры поиска с нарядом ищущих // Мат. заметки ЯГУ. 2002. Т. 9, вып. 1. С. 58–71.
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. Vol. 3. St.Petersburg. 2010. P.280–288.
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. P.207–208.
11. Hohzaki R. Search games: Literature and survey // J. Operat. Res. Soc. Japan. 2016. V 59, N 1. P. 1–34.
Review
For citations:
Mestnikov S.V., Petrov N.V. NUMERICAL CONSTRUCTION OF THE INFORMATION SET AND SUFFICIENT CONDITIONS FOR k–DETECTION IN THE SIMPLE SEARCH GAME ON THE PLANE. Mathematical notes of NEFU. 2017;24(2):11-27. (In Russ.) https://doi.org/10.25587/SVFU.2017.2.9243
Views:
20
JATS XML
Email this article 