A complete pursuit-evasion algorithm for two pursuers using beam detection

We present an algorithm for a pair of pursuers, each with one rotating beam (flashlight, laser or a camera), searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges, the algorithm decides in time O(n/sup 4/) whether it can be cleared by the pursuers, and if so, constructs a search schedule. The pursuers are allowed to move on. the boundary and in the interior of the polygon. They are not required to maintain mutual visibility throughout the pursuit.

[1]  Rolf Klein,et al.  The Two Guards Problem , 1992, Int. J. Comput. Geom. Appl..

[2]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[3]  D. T. Lee,et al.  Two-Guard Walkability of Simple Polygons , 1998, Int. J. Comput. Geom. Appl..

[4]  Kyung-Yong Chwa,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.

[5]  Masafumi Yamashita,et al.  Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..

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

[7]  Giora Slutzki,et al.  Pursuit-evasion using beam detection , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[8]  Rolf Klein,et al.  The two guards problem , 1991, SCG '91.

[9]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[10]  Kyung-Yong Chwa,et al.  Searching a Polygonal Room with One Door by a 1-Searcher , 2000, Int. J. Comput. Geom. Appl..

[11]  Steven M. LaValle,et al.  A pursuit-evasion BUG algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).