An algorithm for searching a polygonal region with a flashlight (2000) [14 citations — 2 self]
Download:
|
|
by Steven M. Lavalle, Borislav Simov, Giora Slutzki
International Journal of Computational Geometry and Applications
http://janowiec.cs.iastate.edu/~lavalle/papers/ijcga00.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Lavalle00analgorithm,author = {Steven M. Lavalle and Borislav Simov and Giora Slutzki},
title = {An algorithm for searching a polygonal region with a flashlight},
booktitle = {International Journal of Computational Geometry and Applications},
year = {2000},
pages = {260--269}
}
Years of Citing Articles
Abstract:
We present an algorithm for a single pursuer with one ashlight that searches for an unpredictable, moving target with unbounded speed in a polygonal environment. The algorithm decides whether a simple polygon with n edges and m concave regions (m is typically much less than n, and always bounded by n) can be cleared by the pursuer, and if so, constructs a search schedule in time O(m 2 + m log n + n). The key ideas in this algorithm include a representation called the \visibility obstruction diagram " and its \skeleton, " which is a combinatorial decomposition based on a number of critical visibility events. An implementation is presented along with a computed example. 1
