Algorithms for Optimizing Search Schedules in a Polygon
In the area of motion planning, considerable work has been done on guarding problems, where "guards", modelled as points, must guard a polygonal space from "intruders". Different variants of this problem involve varying a number of factors. The guards performing the search may v...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3964 |