Work

Algorithms for Optimizing Search Schedules in a Polygon

Year: 2008
Type: dissertation
Abstract: In the area of motion planning, considerable work has been done on guarding \nproblems, where "guards", modelled as points, must guard a polygonal \nspace from "intruders". Different variants \nof this problem involve varying a number of factors. The guards performing \nthe search may vary in terms of their number, their mobility, and their \nrange of vision. The model of intruders may or may not allow them to \nmove. The polygon being searched may have a specified starting point, \na specified ending point, or neither of these. The typical question asked \nabout one of these problems is whether or not certain polygons can be \nsearched under a particular guarding paradigm defined by the types \nof guards and intruders. \n \nIn this thesis, we focus on two cases of a chain of guards searching \na room (polygon with a specific starting point) for mobile intruders. \nThe intruders must never be allowed to escape through the door undetected. \nIn the case of the two guard problem, the guards must start at the door \npoint and move in opposite directions along the boundary of the \npolygon, never crossing the door point. At all times, the \nguards must be able to see each other. The search is complete once both \nguards occupy the same spot elsewhere on the polygon. In the case of \na chain of three guards, consecutive guards in the chain must always \nbe visible. Again, the search starts at the door point, and the outer \nguards of the chain must move from the door in opposite directions. \nThese outer guards must always remain on the boundary of the polygon. \nThe search is complete once the chain lies entirely on a portion of \nthe polygon boundary not containing the door point. \n \nDetermining whether a polygon can be searched is a problem in the area \nof visibility in polygons; further to that, our work is related \nto the area of planning algorithms. We look for ways to find optimal schedules that minimize \nthe distance or time required to complete the search. This is done \nby finding shortest paths in visibility diagrams that indicate valid \npositions for the guards. In the case of \nthe two-guard room search, we are able to find the shortest distance \nschedule and the quickest schedule. The shortest distance schedule \nis found in O(n^2) time by solving an L_1 shortest path problem \namong curved obstacles in two dimensions. The quickest search schedule is \nfound in O(n^4) time by solving an L_infinity shortest path \nproblem among curved obstacles in two dimensions. \nFor the chain of three guards, a search schedule minimizing the total \ndistance travelled by the outer guards is found in O(n^6) time by \nsolving an L_1 shortest path problem among curved obstacles in two dimensions.
Language: English
Open Access status: green
OpenAlex ID: W1916964102
Cites: 44
Cited by:
Related to: 10