Optimal Schedules for 2-guard Room Search

We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the guards must move along the boundary of the room and eventually meet again. We give an O(n3 ) algorithm for finding a search schedule that minimizes the total distance travelled by the guards and an O(n6 ) algorithm that minimizes the time required for the search by solving L1 shortest path problems among curved obstacles in a polygon.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Stephen Bahun, Anna Lubiw
• Keywords: CCCG 2007, Computational Geometry, Mutual Visibility, Polygonal Room, Specified Door Point