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 . 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 , that there is an O(n2)-time algorithm for constructing a search path for an n-sided polygon.
Unable to display preview. Download preview PDF.
- 3.C. Icking and R. Klein. The two guards problem. In Proc. 7th Annu. ACM Sympos. Comp. Geom., pages 166–175, 1991.Google Scholar
- 4.S. M. LaValle, B. H. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proc. of 16th ACM Symp. on Comp. Geom., pages 260–269, 2000.Google Scholar
- 5.J.-H. Lee, S.-M. Park, and K.-Y. Chwa. On the Polygon-Search Conjecture. Technical Report TR-2000-157, CS department, KAIST, 2000.Google Scholar
- 7.J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Simple algorithms for searching a polygon with flashlights. Submitted, 2000.Google Scholar
- 8.J.-H. Lee, S.Y. Shin, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal room with a door. In Proc. 15th ACM Sympos. on Comp. Geom., pages 281–290, 1999.Google Scholar
- 9.N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. Journal of the ACM, pages 18–44, 1988.Google Scholar
- 10.S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report TR-2001-161, CS department, KAIST, 2001.Google Scholar
- 11.T.D. Parsons. Pursuit-evasion in a graph. In Theorey and Applications of Graphs Y. Alavi and D.R. Lick eds. Lecture Notes in Mathematics, Springer-Verlag., pages 426–441, 1976.Google Scholar
- 12.I. Suzuki, Y. Tazoe, M. Yamashita, and T. Kameda. Searching a polygonal region from the boundary. TR-20000925, EECS Department, Univ. of Wisconsin-Milwaukee, 2000.Google Scholar
- 14.X. Tan. Searching a simple polygon by a k-searcher. In Proc. of 11th ISAAC, pages 503–514, 2000.Google Scholar
- 15.M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda. Searching for mobile intruders in a polygonal region by a group of mobile searchers. In Proc. 13th Annu. ACM Sympos. Comp. Geom., pages 448–450, 1997.Google Scholar