A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles

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]  J. Sussmann,et al.  SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .

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

[3]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 2005, Algorithmica.

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

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

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

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

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

[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]  Pankaj K. Agarwal,et al.  Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.

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

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

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

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

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

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

[17]  David P. Dobkin,et al.  Computational geometry in a curved world , 1990, Algorithmica.

[18]  Jean-Daniel Boissonnat,et al.  Convex Hulls of Bounded Curvature , 1996, CCCG.

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

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

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

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

[23]  Jean-Daniel Boissonnat,et al.  Shortest paths of Bounded Curvature in the Plane , 1991, Geometric Reasoning for Perception and Action.