|
Mathematics
Numerical construction of the information set and sufficient conditions for k-detection in the simple search game on the plane
S. V. Mestnikov, N. V. Petrov M. K. Ammosov North-Eastern Federal University, Institute of Mathematics and Informatics, 42, Kulakovsky St., Yakutsk 677000, Russia
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.
Keywords:
differential search game, information set, mixed strategies.
Received: 24.01.2017
Citation:
S. V. Mestnikov, N. V. Petrov, “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 (2017), 13–29
Linking options:
https://www.mathnet.ru/eng/svfu178 https://www.mathnet.ru/eng/svfu/v24/i2/p13
|
Statistics & downloads: |
Abstract page: | 138 | Full-text PDF : | 54 | References: | 44 |
|