Searching a Circular Corridor with Two Flashlights
We consider the problem of searching for a mobile intruder in a circular corridor (a polygon with one polygonal hole) by two searchers, who hold a flashlight. Both searchers move on the outer boundary, directing their flashlights at the inner boundary. The objective is to decide whether there exists a search schedule for the searchers to detect the intruder, no matter how fast he moves. We give a characterization of the class of circular corridors, which are searchable with two flashlights. Based on our characterization, an O(n logn) time algorithm is then presented to determine the searchability of a circular corridor with two flashlights, where n denotes the total number of vertices of the outer and inner boundaries. Moreover, a search schedule can be output in time linear in its size, if it exists. Our result gives the first efficient solution to the polygon search problem for two searchers.
Unable to display preview. Download preview PDF.
- 5.Kameda, T., Zhang, J.Z., Yamashita, M.: Searching a circular corridor by two boundary 1-searchers. In: Proc. KyotoCGGT 2007 (2007)Google Scholar
- 8.Simov, B.H., LaVallel, S.M., Slutzki, G.: A complete pursuit-evasion algorithm for two pursuers using beam dectection. In: Proc. IEEE Int’l. Conf. Robotics Automation, pp. 618–623 (2002)Google Scholar
- 11.Tan, X.: Searching a polygonal region by a boundary searcher. J. Comput. Sci. Tech. (to appear)Google Scholar