Generalized Watchman Route Problem with Discrete View Cost

In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) and a set of discrete viewpoints on the planned route such that every point on the polygon boundary is visible from at least one viewpoint. Each planned viewpoint has some associated cost. The total cost to minimize is a weighted sum of the view cost, proportional to the number of viewpoints, and the travel cost, the total length of the route. We call this problem the Generalized Watchman Route Problem or the GWRP. We tackle a restricted nontrivial (it remains NP-hard and log-inapproximable) version of GWRP where each polygon edge is entirely visible from at least one planned viewpoint. We call it Whole Edge Covering GWRP. The algorithm we propose first constructs a graph that connects O(n12) number of sample viewpoints in the polygon, where n is the number of polygon vertices; and then solves the corresponding View Planning Problem with Combined View and Traveling Cost, using an LP-relaxation based algorithm we introduced in [27, 29]. We show that our algorithm has an approximation ratio in the order of either the view frequency, defined as the maximum number of sample viewpoints that cover a polygon edge, or a polynomial of log n, whichever is smaller.

[1]  Sariel Har-Peled,et al.  Guarding galleries and terrains , 2002, Inf. Process. Lett..

[2]  Xuehou Tan,et al.  Approximation algorithms for the watchman route and zookeeper's problems , 2001, Discret. Appl. Math..

[3]  Sándor P. Fekete,et al.  Online Searching with an Autonomous Robot , 2004, WAFR.

[4]  Ramesh Krishnamurti,et al.  View Planning Problem with Combined View and Traveling Cost , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[5]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[6]  Joel W. Burdick,et al.  Understanding discrete visibility and related approximation algorithms , 1997, CCCG.

[7]  Mohammad Ghodsi,et al.  Efficient computation of query point visibility in polygons with holes , 2005, SCG.

[8]  Susanne Albers,et al.  Exploring Unknown Environments , 2000, SIAM J. Comput..

[9]  Joel W. Burdick,et al.  An on-line algorithm for exploring an unknown polygonal environment by a point robot , 1997, CCCG.

[10]  Zheng Sun,et al.  On finding approximate optimal paths in weighted regions , 2006, J. Algorithms.

[11]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[12]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[13]  Svante Carlsson,et al.  Computing Vision Points in Polygons , 1999, Algorithmica.

[14]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[15]  Jörg-Rüdiger Sack,et al.  Determining approximate shortest paths on weighted polyhedral surfaces , 2005, JACM.

[16]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[17]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[18]  Joseph S. B. Mitchell,et al.  The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.

[19]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[20]  G. Roth,et al.  View planning for automated three-dimensional object reconstruction and inspection , 2003, CSUR.

[21]  Stephan Eidenbenz,et al.  Approximation algorithms for terrain guarding , 2002, Inf. Process. Lett..

[22]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[23]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[24]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[25]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[26]  Wei-Pand Chin,et al.  Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..

[27]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[28]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[29]  Sampath Kannan,et al.  Local exploration: online algorithms and a probabilistic framework , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[30]  Prosenjit Bose,et al.  Efficient visibility queries in simple polygons , 2002, Comput. Geom..