Name
Abstract | ||
|---|---|---|
The k-searcher is a mobile guard whose visibility is limited to k rays emanating from her position, where the direction of each ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P, is it possible for the k-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P? We present O(n2)-time algorithms for constructing a search schedule of the 1-searcher and the 2-searcher, respectively. Our framework for the 1-searcher can be viewed as a modification of that of LaValle et al. [Proc. 16th ACM Symp. on Computational Geometry, 2000, pp. 260–269] and is naturally extended for the 2-searcher. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0020-0190(01)00235-6 | Inf. Process. Lett. |
Keywords | Field | DocType |
simple algorithm,path planning,visibility,computational geometry | Motion planning,Discrete mathematics,Graph,Combinatorics,Visibility,Polygon,Computational geometry,Guard (information security),SIMPLE algorithm,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
81 | 5 | 0020-0190 |
Citations | PageRank | References |
13 | 1.18 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jae-Ha Lee | 1 | 144 | 14.19 |
| Sang-Min Park | 2 | 223 | 21.45 |
| Kyung-Yong Chwa | 3 | 919 | 97.10 |