DMCA
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher (2001)
| Venue: | Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP |
| Citations: | 47 - 1 self |
BibTeX
@INPROCEEDINGS{Park01visibility-basedpursuit-evasion,
author = {Sang-min Park and Jae-ha Lee and Jae-ha Lee and Kyung-yong Chwa and Kyung-yong Chwa},
title = {Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher},
booktitle = {Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP},
year = {2001},
pages = {281--290},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
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 su#cient conditions for a polygon to be searchable, which settles a decade-old open problem raised in [15]. We also show that every searchable polygon is also searchable by a searcher with two flashlights (that is, ray visions). This implies, combined with the previous work, that there is an O(n 2 )-time algorithm for constructing a search path for an n-sided polygon. 1 Introduction The visibility-based pursuit-evasion problem is that of planning the motion of one or more searchers in a polygonal environment to eventually see an intruder that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem can mode...
Keyphrases
polygonal region visibility-based pursuit-evasion searchable polygon polygonal environment search path n-sided polygon ray vision decade-old open problem previous work unknown initial position time algorithm visibility-based pursuit-evasion problem basic visibility-based pursuit-evasion problem su cient condition unpredictable intruder
