An algorithm for searching a polygonal region with a flashlight

International Journal of Computational Geometry and Applications

Volumn 12, Issue 1-2, 2002, Pages 87-113

  Lavalle, Steven M ^a   Simov, Borislav H ^b   Slutzki, Giora ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

^c Iowa State University   (United States)

Author keywords

Motion planning; Pursuit evasion; Robotics; Sensing; Visibility

Indexed keywords

EID: 0036002804     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s021819590200075x     Document Type: Conference Paper

References (14)

1. Ray shooting in polygons using geodesic triangulations
2. Searching for a mobile intruder in a corridor - The open edge variant of the polygon search problem
3. Sweeping simple polygons with a chain of guards
4. Visibility-based pursuit-evasion in a polygonal environment
5. An optimal algorithm for the two-guard problem
6. A pedestrian approach to ray shooting: Shoot a ray, take a walk
7. The two guards problem
8. Visibility-based pursuit-evasion: The case of curved environments
9. An algorithm for searching a polygonal region with a flashlight
10. Searching a polygonal room with a door by a 1-searcher
11. Visibility-based pursuit-evasion in a polygonal room with a door
12. Searching for a mobile intruder in a polygonal region
13. Two-guard walkability of simple polygons
14. Searching for mobile intruders in a polygonal region by a group of mobile searchers