Ntafos, S., Watchman routes under limited visibility, Computational Geometry: Theory and Applications 1 (1992) 149-170. In this paper we consider the watchman route problem in simple polygons when there is a distance linr;! (range) d to the visibility of the watchman. We have then two versions of the watchman route problem. We want to find a shortest route such that either (a) each point in the boundary of the polygon (d-watchman problem) or (b) each point in the polygon (d-sweeper problem) is d-visible (i.e., visible and at most d away) from some point along the route. We first present an O(mn*) algorithm for the safari route problem which is to find a shortest route that visits a set of m convex polygons that lie in the interior and are attached to the boundary of an enclosing polygon (n is the total number of vertices). We use this result to obtain a polynomial approximation scheme for the d-watchman problem. The d-sweeper problem is closely related to the traveling salesman problem on simple grids whose complexity is open (it is NP-hard for general grids [S]). We present an approximation algorithm for the TSP in simple grids that obtains solutions within 33% of the optimum. This also provides approximate solutions for the d-sweeper problem.
[1]
David S. Johnson,et al.
The NP-Completeness Column: An Ongoing Guide
,
1982,
J. Algorithms.
[2]
Amir Pirzadeh,et al.
A unified solution to coverage and search in explored and unexplored terrains using indirect control
,
1990,
Proceedings., IEEE International Conference on Robotics and Automation.
[3]
Jayme Luiz Szwarcfiter,et al.
Hamilton Paths in Grid Graphs
,
1982,
SIAM J. Comput..
[4]
Christos H. Papadimitriou,et al.
The Euclidean Traveling Salesman Problem is NP-Complete
,
1977,
Theor. Comput. Sci..
[5]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[6]
Wei-Pand Chin,et al.
Shortest watchman routes in simple polygons
,
1990,
Discret. Comput. Geom..
[7]
Simeon C. Ntafos.
The Robber Route Problem
,
1990,
Inf. Process. Lett..
[8]
C. A. Rogers,et al.
Packing and Covering
,
1964
.
[9]
Ernest L. Hall,et al.
Region filling operations for mobile robot using computer graphics
,
1986,
Proceedings. 1986 IEEE International Conference on Robotics and Automation.