AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT

DOI10.1142/S021819590200075XzbMATH Open1117.68527MaRDI QIDQ4818547FDOQ4818547

Authors: Steven M. LaValle, Borislav H. Simov, Giora Slutzki 

Publication date: 29 September 2004

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

Recommendations

• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• Combinatorial Geometry and Graph Theory
• Simple algorithms for searching a polygon with flashlights
• scientific article; zbMATH DE number 1754612
• scientific article; zbMATH DE number 1786527

zbMATH Keywords

motion planningvisibilityroboticssensingpursuit-evasion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• A complete algorithm for searchlight scheduling
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• A unified and efficient solution to the room search problem
• An alternative proof for the equivalence of searcher and 2-searcher
• An annotated bibliography on guaranteed graph searching
• Finding all door locations that make a room searchable
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• Hide-and-seek: algorithms for polygon walk problems
• Finding the minimum-distance schedule for a boundary searcher with a flashlight
• Simple algorithms for searching a polygon with flashlights
• 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
• Sweeping simple polygons with the minimum number of chain guards
• Visibility-based pursuit-evasion with bounded speed

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818547)