Abstract
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(n 2)-time algorithm for constructing a search path for an n-sided polygon.
This work was supported by KOSEF(Korea Science and Engineering Foundation) under grant 98-0102-0701-3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a Corridor-the open edge variant of the polygon search problem. Int. J. of Comp. Geom. and Appl., 5(4):397–412, 1995.
L.J. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani. A visibility based pursuit-evasion problem. Int. J. of Comp. Geom. and Appl., 9(4):471–493, 1999.
C. Icking and R. Klein. The two guards problem. In Proc. 7th Annu. ACM Sympos. Comp. Geom., pages 166–175, 1991.
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.
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. On the Polygon-Search Conjecture. Technical Report TR-2000-157, CS department, KAIST, 2000.
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. Int. J. of Comp. Geom. and Appl., 10(2):201–220, 2000.
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Simple algorithms for searching a polygon with flashlights. Submitted, 2000.
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.
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.
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.
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.
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.
I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comp., 21(5):863–888, 1992.
X. Tan. Searching a simple polygon by a k-searcher. In Proc. of 11th ISAAC, pages 503–514, 2000.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SM., Lee, JH., Chwa, KY. (2001). Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_38
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive