Abstract
Given a polygonal region with n vertices, a group of searchers with vision are trying to find an intruder inside the region. Can the searchers find the intruder or can the intruder evade searchers’ detection for ever? It is likely that the answer depends on the visibility of the searchers, but we present quite a general result against it. We assume that the searchers always form a simple polygonal chain within the polygon such that the first searcher moves along the boundary of the polygon and any two consecutive searchers along the chain are always mutually visible. Two types of visibility of the searchers are considered: on the one extreme every searcher has 360° vision – called an ∞-searcher; on the other extreme every searcher has one-ray vision – called a 1-searcher. We show that if any polygon is searchable by a chain of ∞-searchers it is also searchable by a chain of 1-searchers consisting of the same number of searchers as the ∞-searchers. Our proof uses simple simulation techniques. The proof is also interesting from an algorithmic point of view because it allows an O(n 2)-time algorithm for finding the minimum number of 1-searchers (and thus ∞-searchers) required to search a polygon [9]. No polynomial-time algorithm for a chain of multiple ∞-searchers was known before, even for a chain of two ∞-searchers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, M., Racke, H., Sivadasan, N., Sohler, C., Vocking, B.: Randomized Pursuit-Evasion in Graphs. In: Proc. of the 29th Int. Colloquium on Automata, Languages and Programming, pp. 901–912 (2002)
Crass, D., Suzuki, I., Yamashita, M.: 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)
Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D., Mitchell, J., Murali, T.: Sweeping simple polygons with a chain of guards. In: Proc. of the 16th Symp. on Discrete Algorithm, pp. 927–936 (2000)
Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: A visibilitybased pursuit-evasion problem. Int. J. of Comp. Geom. and Appl. 9(4), 471–493 (1998)
Icking, C., Klein, R.: The two guards problem. Int. J. of Comp. Geom. and Appl. 2(3), 257–285 (1992)
LaValle, S.M., Simov, B.H., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. In: Proc. of the 16th Symp. on Comp. Geom., pp. 260–269 (2000)
Lee, J.-H., Park, S.-M., Chwa, K.-Y.: On the polygon-search conjecture. Technical Report TR-2000-157, CS department, KAIST (2000)
Lee, J.-H., Park, S.-M., Chwa, K.-Y.: Searching a polygonal room with one door by a 1-searcher. Int. J. of Comp. Geom. and Appl. 10(2), 201–220 (2000)
Lee, J.-H., Park, S.-M., Chwa, K.-Y.: Optimization algorithms for sweeping a polygonal region with mobile guards. In: Proc. of the 12th Int. Symp. on Algo. and Computation, pp. 480–492 (2001)
Lee, J.-H., Shin, S.Y., Chwa, K.-Y.: Visibility-based pursuitevasion in a polygonal room with a door. In: Proc. of the 15th ACM Symp. on Comp. Geom., pp. 281–290 (1999)
Park, S.-M., Lee, J.-H., Chwa, K.-Y.: Visibility-based pursuitevasion in a polygonal region by a searcher. In: Proc. of the 28th Int. Colloquium on Automata, Languages and Programming, pp. 456–468 (2001)
Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs, pp. 426–441 (1976)
Rote, G.: Pursuit-evasion with imprecise target location. In: Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 747–753 (2003)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM J. Comp. 21(5), 863–888 (1992)
Yamashita, M., Umemoto, H., Suzuki, I., Kameda, T.: Searching for mobile intruders in a polygonal region by a group of mobile searchers. Algorithmica 31(2), 208–236 (2001)
Yamashita, M., Umemoto, H., Suzuki, I., Kameda, T.: Searching a polygonal region from the boundary. Int. J. of Comp. Geom. and Appl. 11(5), 529–553 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, JH., Park, SM., Chwa, KY. (2004). Equivalence of Search Capability Among Mobile Guards with Various Visibilities. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive