Watchman routes under limited visibility

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.

[1]  P. Svestka,et al.  A probabilistic approach to motion planning for car-like robots , 1993 .

[2]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[3]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[4]  Gordon Wilfong.  Motion Planning for an Autonomous Vehicle , 1990, Autonomous Robot Vehicles.

[5]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[6]  Simeon C. Ntafos,et al.  Optimum Watchman Routes , 1988, Inf. Process. Lett..

[7]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[8]  Mark H. Overmars,et al.  A random approach to motion planning , 1992 .

[9]  Robert E. Barnhill,et al.  Geometry Processing for Design and Manufacturing , 1992 .

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

[11]  Simeon C. Ntafos.  The Robber Route Problem , 1990, Inf. Process. Lett..

[12]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[13]  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.

[14]  Bruce Randall Donald,et al.  Kinodynamic motion planning , 1993, JACM.

[15]  Ernest L. Hall,et al.  Region filling operations for mobile robot using computer graphics , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[17]  Franco P. Preparata,et al.  The Medial Axis of a Simple Polygon , 1977, MFCS.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[20]  Micha Sharir,et al.  Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[22]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[23]  Earl William Swokowski,et al.  Calculus with analytic geometry , 1975 .

[24]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[25]  C. A. Rogers,et al.  Packing and Covering , 1964 .

[26]  Bruce Randall Donald,et al.  On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.