A unified and efficient solution to the room search problem

DOI10.1016/J.COMGEO.2007.04.001MaRDI QIDQ2479474zbMATH OpenOpenAlexFDO

Authors Xuehou Tan

Publication date 26 March 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.04.001

zbMATH Keywords

algorithmscomputational geometryvisibilityroboticstwo-guard problemroom search problemsearch schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 1786527
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Publication:4504035
• A graph search algorithm for indoor pursuit/evasion
• A unifying approach to heuristic search
• A near-tight approximation algorithm for the robot localization problem
• A unified approach to approximate proximity searching
• An efficient algorithm for the “stable roommates” problem
• Generalized floorplans from assigned room adjacencies

Cites work

• scientific article; zbMATH DE number 2080272 (Why is no real title available?)
• scientific article; zbMATH DE number 2080273 (Why is no real title available?)
• scientific article; zbMATH DE number 1754612 (Why is no real title available?)
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Algorithms and Computation
• Characterizing LR-visibility polygons and related problems
• Combinatorial Geometry and Graph Theory
• LR-visibility in polygons
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Searching for a Mobile Intruder in a Polygonal Region
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• Sweeping simple polygons with the minimum number of chain guards
• THE TWO GUARDS PROBLEM
• Visibility and intersection problems in plane geometry

Cited in

(10)

• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Finding all door locations that make a room searchable
• An efficient algorithm for the three-guard problem
• Characterizing and recognizing LR-visibility polygons
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• scientific article; zbMATH DE number 1507309 (Why is no real title available?)
• Searching for mobile intruders in circular corridors by two 1-searchers
• scientific article; zbMATH DE number 2080273 (Why is no real title available?)
• scientific article; zbMATH DE number 1786527 (Why is no real title available?)

This page was built for publication: A unified and efficient solution to the room search problem

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