Online polygon search by a seven-state boundary 1-searcher

Polygon search is the problem of finding mobile intruders who move unpredictably in a polygonal region. In this paper, we consider a special case of this problem, called boundary search, where the searcher is allowed to move only along the boundary of the polygon. We concentrate on a single searcher with one flashlight (called a 1-searcher), but it is known that a single boundary 1-searcher has the same searching power as a single boundary searcher with 360/spl deg/ vision. Our main result is that the movement of the searcher can be controlled by a finite-state machine having only seven states. This automaton has no built-in information about the input polygon and, for any given polygon P, if P can be searched by a boundary searcher at all, then this automaton will successfully search P, no matter where on the boundary of P it is initially placed. All information about P is acquired by the automaton online, as it searches P. We also show that if P can be searched by a boundary searcher, then our automaton searches it by circling its boundary less than three times.

[1]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

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

[3]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[4]  Masafumi Yamashita,et al.  The Searchlight Scheduling Problem , 1990, SIAM J. Comput..

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

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

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

[8]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

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

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

[11]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..

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

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

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

[15]  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..

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

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

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

[19]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .