A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

In this paper, we consider the problem of computing shortest paths of bounded curvature amidst obstacles in the plane. More precisely, given two prescribed initial and final configurations (specifying the location and the direction of travel) and a set of obstacles in the plane, we want to compute a shortest $C^1$ path joining those two configurations, avoiding the obstacles, and with the further constraint that, on each $C^2$ piece, the radius of curvature is at least 1. In this paper, we consider the case of moderate obstacles (as introduced by Agarwal et al.) and present a polynomial-time exact algorithm to solve this problem.

[1]  Pankaj K. Agarwal,et al.  Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.

[2]  Gordon T. Wilfong.  Shortest paths for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[3]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

[4]  Pankaj K. Agarwal,et al.  Approximation algorithms for curvature-constrained shortest paths , 1996, SODA '96.

[5]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[6]  J. Latombe,et al.  On nonholonomic mobile robots and optimal maneuvering , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[7]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[8]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[9]  Jean-Daniel Boissonnat,et al.  Shortest path synthesis for Dubins non-holonomic robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[10]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

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

[12]  J. Canny,et al.  Nonholonomic Motion Planning , 1992 .

[13]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[14]  Jean-Daniel Boissonnat,et al.  Accessibility region for a car that only moves forwards along optimal paths , 1993 .

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

[16]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

[17]  R. Acevedo,et al.  Research report , 1967, Revista odontologica de Puerto Rico.

[18]  Michel Taïx,et al.  Efficient motion planners for nonholonomic mobile robots , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[19]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

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