Sampling Extremal Trajectories for Planar Rigid Bodies

This paper presents an approach to finding the time-optimal trajectories for a simple rigid-body model of a mobile robot in an obstacle-free plane. Previous work has used Pontryagin’s Principle to find strong necessary conditions on time-optimal trajectories of the rigid body; trajectories satisfying these conditions are called extremal trajectories. The main contribution of this paper is a method for sampling the extremal trajectories sufficiently densely to guarantee that for any pair of start and goal configurations, a trajectory can be found that (provably) approximately reaches the goal, approximately optimally; the quality of the approximation is only limited by the availability of computational resources.

[1]  Gregory S. Chirikjian,et al.  Algorithmic Foundation of Robotics VIII, Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, WAFR 2008, Guanajuato, Mexico, December 7-9, 2008 , 2009, WAFR.

[2]  Andrei Furtuna Minimum time kinematic trajectories for self-propelled rigid bodies in the unobstructed plane , 2011 .

[3]  Siddhartha S. Srinivasa,et al.  CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.

[4]  Devin J. Balkcom,et al.  Time-optimal Trajectories for an Omni-directional Vehicle , 2006, Int. J. Robotics Res..

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

[6]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[7]  Devin J. Balkcom,et al.  Analytical time-optimal trajectories for an omni-directional vehicle , 2012, 2012 IEEE International Conference on Robotics and Automation.

[8]  Kevin M. Lynch,et al.  The mechanics of fine manipulation by pushing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[9]  Philippe Souères,et al.  Optimal trajectories for nonholonomic mobile robots , 1998 .

[10]  Jean-Paul Laumond,et al.  Robot Motion Planning and Control , 1998 .

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

[12]  Devin J. Balkcom,et al.  Minimum-time trajectories for kinematic mobile robots and other planar rigid bodies with finite control sets , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Devin J. Balkcom,et al.  Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles , 2002, Int. J. Robotics Res..

[14]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

[15]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

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

[17]  Zexiang Li,et al.  A variational approach to optimal nonholonomic motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[18]  Rafael Murrieta-Cid,et al.  A Motion Planner for Maintaining Landmark Visibility with a Differential Drive Robot , 2008, WAFR.

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

[20]  Marilena Vendittelli,et al.  Obstacle distance for car-like robots , 1999, IEEE Trans. Robotics Autom..

[21]  Steven M. LaValle,et al.  Planning algorithms , 2006 .