AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT

DOI10.1142/S021819590200075XzbMath1117.68527MaRDI QIDQ4818547

Giora Slutzki, S. M. LaValle, Borislav H. Simov

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

motion planningroboticsvisibilitypursuit-evasionsensing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Positional games (pursuit and evasion, etc.) (91A24) Artificial intelligence for robotics (68T40)

Related Items (11)

An alternative proof for the equivalence of searcher and 2-searcher ⋮ Sweeping simple polygons with the minimum number of chain guards ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Searching for mobile intruders in circular corridors by two 1-searchers ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ An annotated bibliography on guaranteed graph searching ⋮ Hide-and-Seek: Algorithms for Polygon Walk Problems ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ Visibility-Based Pursuit-Evasion with Bounded Speed ⋮ A unified and efficient solution to the room search problem ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS

Cites Work

• Ray shooting in polygons using geodesic triangulations
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM

This page was built for publication: AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT