Guaranteed strategies to search for mobile evaders in the plane

This paper studies several problems of search in the two-dimensional plane for mobile intruders or evaders. In each case, both the searcher and evaders are assumed to have bounded velocities, with the velocity of the searcher greater than that of the evaders. The searcher has a sensor with a circular footprint which allows it to detect any evaders within the sensor radius. Unlike much of the past work done in search theory, the proposed strategies make no assumptions about the motion of the evaders, and are guaranteed to succeed for any trajectory of the evaders. The three problem formulations studied include the search for mobile targets through a linear corridor, the search for or bounding of mobile targets which start inside of a circular region, and the prevention of mobile targets from entering a circular region. The extension of the proposed strategies for multiple searchers is also discussed

[1]  Rufus Isaacs,et al.  Differential Games , 1965 .

[2]  S. Shankar Sastry,et al.  Pursuit-evasion strategies for teams of multiple agents with incomplete information , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[3]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[4]  Cambridge Ma,et al.  OPTIMAL SEARCH FOR A MOVING TARGET: A GEOMETRIC APPROACH , 2000 .

[5]  Wesley H. Huang.  Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  J. Saia,et al.  Ice rinks and cruise missiles: sweeping a simple polygon , 1997 .

[7]  I. Shevchenko.  Successive Pursuit with a Bounded Detection Domain , 1997 .

[8]  Lyn C. Thomas,et al.  Dynamic Search Games , 1991, Oper. Res..

[9]  Alan R. Washburn.  Search-Evasion Game in a Fixed Region , 1980, Oper. Res..

[10]  John M. Danskin,et al.  A Helicopter Versus Submarine Search Game , 1968, Oper. Res..

[11]  Marios M. Polycarpou,et al.  A cooperative search framework for distributed agents , 2001, Proceeding of the 2001 IEEE International Symposium on Intelligent Control (ISIC '01) (Cat. No.01CH37206).

[12]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[13]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

[14]  Alan R. Washburn,et al.  The Diesel Submarine Flaming Datum Problem , 2001 .

[15]  Sándor P. Fekete,et al.  Two Dimensional Rendezvous Search , 2001, Oper. Res..

[16]  L. Stone.  Search and Screening: General Principles with Historical Applications (B. O. Koopman) , 1981 .

[17]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[18]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .