Searching for mobile intruders in circular corridors by two 1-searchers

DOI10.1016/j.dam.2010.10.007zbMath1225.68265MaRDI QIDQ643019

Bo Jiang, Xue-Hou Tan

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.007

zbMATH Keywords

visibility; computational geometry; deadlocks; 1-searchers; polygon search problem

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68T40: Artificial intelligence for robotics

Related Items

Characterizing and recognizing LR-visibility polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sweeping simple polygons with the minimum number of chain guards
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A unified and efficient solution to the room search problem
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Characterizing LR-visibility polygons and related problems