Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher

We consider the most basic visibility-based pursuit-evasion problem defined as follows: Given a polygonal region, a searcher with 360° vision, and an unpredictable intruder that is arbitrarily faster than the searcher, plan the motion of the searcher so as to see the intruder. In this paper, we present simple necessary and sufficient conditions for a polygon to be searchable, which settles a decade-old open problem raised in [13]. We also show that every searchable polygon is also searchable by a searcher with two flashlights (that is, two ray visions). This implies, combined with the previous work [7], that there is an O(n2)-time algorithm for constructing a search path for an n-sided polygon.

[1]  Giora Slutzki,et al.  An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[2]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[4]  Sang-Min Park,et al.  A Characterization of the Class of Polygons Searchable by a 1-Searcher , 2000 .

[5]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[6]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.

[7]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[8]  Brian Yamauchi,et al.  Frontier-based exploration using multiple robots , 1998, AGENTS '98.

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

[10]  Gaurav S. Sukhatme,et al.  Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion , 2002, Auton. Robots.

[11]  T. Shermer.  Recent Results in Art Galleries , 1992 .

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

[13]  Kyung-Yong Chwa,et al.  Simple algorithms for searching a polygon with flashlights , 2002, Inf. Process. Lett..

[14]  Camillo J. Taylor,et al.  Dynamic Sensor Planning and Control for Optimally Tracking Targets , 2003, Int. J. Robotics Res..

[15]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[16]  J. Davenport.  A "Piano Movers" Problem. , 1986 .

[17]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[18]  Masafumi Yamashita,et al.  Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

[19]  Masafumi Yamashita,et al.  Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon , 1998, Inf. Process. Lett..

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

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

[22]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.

[23]  Sung Yong Shin,et al.  Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.

[24]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[25]  Tucker Balch,et al.  Collaborative execution of exploration and tracking using move value estimation for robot teams (mvert) , 2003 .

[26]  Lynne E. Parker,et al.  Cooperative Robotics for Multi-Target Observation , 1999, Intell. Autom. Soft Comput..

[27]  Nicholas Roy,et al.  Exponential Family PCA for Belief Compression in POMDPs , 2002, NIPS.

[28]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract) , 1997, Symposium on Computational Geometry.

[29]  Kurt Mehlhorn,et al.  Efficient exact geometric computation made easy , 1999, SCG '99.

[30]  Kyung-Yong Chwa,et al.  On the Polygon-Search Conjecture , 2000 .

[31]  Xuehou Tan.  Searching a Simple Polygon by a k-Searcher , 2000, ISAAC.

[32]  R. Simmons,et al.  Exploration with and without a Map , 1993 .

[33]  Maja J. Mataric,et al.  Broadcast of Local Elibility for Multi-Target Observation , 2000, DARS.

[34]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

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

[36]  Wolfram Burgard,et al.  Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).