Numerical construction of the information set and sufficient conditions for $k$-detection in the simple search game on the plane
The antagonistic diﬀerential 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.
This work is licensed under a Creative Commons Attribution 4.0 International License.