Discrete Dubins Paths

A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory techniques [Reeds and Shepp, 1990], [Sussmann and Tang, 1991], [Boissonnat, C\'er\'ezo, and Leblond, 1994]. We introduce and study a discrete analogue of curvature-constrained motion. We show that shortest "bounded-curvature" polygonal paths have the same structure as Dubins paths. The properties of Dubins paths follow from our results as a limiting case---this gives a new, "discrete" proof of Dubins result.

[1]  Devin J. Balkcom,et al.  Minimum Wheel-Rotation Paths for Differential-Drive Mobile Robots , 2009, Int. J. Robotics Res..

[2]  Axel Schur Über die Schwarzsche Extremaleigenschaft des Kreises unter den Kurven konstanter Krümmung , 1921 .

[3]  Stephan Foldes Decomposition of planar motions into reflections and rotations with distance constraints , 2004, CCCG.

[4]  Steven M. LaValle,et al.  Time-optimal paths for a Dubins airplane , 2007, 2007 46th IEEE Conference on Decision and Control.

[5]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesperson Problems: novel approximation algorithms , 2006 .

[6]  Marilena Vendittelli,et al.  The Minimum-Time Crashing Problem for the Dubins' Car , 2006 .

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

[8]  Domenico Prattichizzo,et al.  On visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[10]  H. Sussmann Shortest 3-dimensional paths with a prescribed curvature bound , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[11]  A. Goodman A Partial Differential Equation and Parallel Plane Curves , 1964 .

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

[13]  Ovidiu Daescu,et al.  Visiting a Sequence of Points with a Bevel-Tip Needle , 2010, LATIN.

[14]  J. Hyam Rubinstein,et al.  Curvature-constrained directional-cost paths in the plane , 2012, J. Glob. Optim..

[15]  Joseph S. B. Mitchell,et al.  Turn-Constrained Route Planning for Avoiding Hazardous Weather , 2006 .

[16]  Yacine Chitour,et al.  Dubins' Problem on Surfaces II: Nonpositive Curvature , 2006, SIAM J. Control. Optim..

[17]  Hongyan Wang,et al.  Non-Uniform Discretization Approximations for Kinodynamic Motion Planning and its Applications , 1996 .

[18]  Vladimir J. Lumelsky,et al.  Classification of the Dubins set , 2001, Robotics Auton. Syst..

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

[20]  Robert J. Szczerba,et al.  Robust algorithm for real-time route planning , 2000, IEEE Trans. Aerosp. Electron. Syst..

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

[22]  Hongyan Wang,et al.  Nonuniform Discretization for Kinodynamic Motion Planning and its Applications , 2000, SIAM J. Comput..

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

[24]  S. Shankar Sastry,et al.  Three-dimensional Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics , 2010, Int. J. Robotics Res..

[25]  Gordon T. Wilfong Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[26]  Didier Wolf,et al.  Navigation of a mobile robot by locally optimal trajectories , 1999, Robotica.

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

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

[29]  Marilena Vendittelli,et al.  Shortest Paths to Obstacles for a Polygonal Dubins Car , 2009, IEEE Transactions on Robotics.

[30]  Xiang Ma,et al.  Receding Horizon Planning for Dubins Traveling Salesman Problems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[32]  Günter Rote Computing the Fréchet distance between piecewise smooth curves , 2007, Comput. Geom..

[33]  H. G. Robertson Curvature and Arclength , 1970 .

[34]  S. LaValle,et al.  Geodesic Problems for Mobile Robots , 2008 .

[35]  Otfried Cheong,et al.  The cost of bounded curvature , 2011, Comput. Geom..

[36]  Devin J. Balkcom,et al.  Generalizing Dubins Curves: Minimum-time Sequences of Body-fixed Rotations and Translations in the Plane , 2010, Int. J. Robotics Res..

[37]  Jirí Matousek,et al.  Reachability by Paths of Bounded Curvature in a Convex Polygon , 2012, Comput. Geom..

[38]  Tal Shima,et al.  Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms , 2011, Comput. Oper. Res..

[39]  Z. A. Melzak Plane Motion with Curvature Limitations , 1961 .

[40]  Irina S. Dolinskaya Optimal path finding in direction, location, and time dependent environments , 2012 .