Anytime solution optimization for sampling-based motion planning

Recent work in sampling-based motion planning has yielded several different approaches for computing good quality paths in high degree of freedom systems: path shortcutting methods that attempt to shorten a single solution path by connecting non-consecutive configurations, a path hybridization technique that combines portions of two or more solutions to form a shorter path, and asymptotically optimal algorithms that converge to the shortest path over time. This paper presents an extensible meta-algorithm that incorporates a traditional sampling-based planning algorithm with offline path shortening techniques to form an anytime algorithm which exhibits competitive solution lengths to the best known methods and optimizers. A series of experiments involving rigid motion and complex manipulation are performed as well as a comparison with asymptotically optimal methods which show the efficacy of the proposed scheme, particularly in high-dimensional spaces.

[1]  Mark H. Overmars,et al.  Creating High-quality Paths for Motion Planning , 2007, Int. J. Robotics Res..

[2]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[3]  Matthew R. Walter,et al.  Reachability-guided sampling for planning under differential constraints , 2009, 2009 IEEE International Conference on Robotics and Automation.

[4]  Thierry Siméon,et al.  Path Deformation Roadmaps , 2006, WAFR.

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

[6]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[7]  Mark H. Overmars,et al.  Useful cycles in probabilistic roadmap graphs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[8]  Dan Halperin,et al.  A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm , 2011, IEEE Transactions on Robotics.

[9]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

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

[11]  Jean-Claude Latombe,et al.  A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.

[12]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[13]  Thierry Siméon,et al.  Mobility analysis for feasibility studies in CAD models of industrial environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  Sachin Chitta,et al.  MoveIt! [ROS Topics] , 2012, IEEE Robotics Autom. Mag..

[15]  Mark H. Overmars,et al.  Creating High-quality Roadmaps for Motion Planning in Virtual Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Stefan Berchtold,et al.  A scalable optimizer for automatically generated manipulator motions , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

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

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

[19]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[20]  Kostas E. Bekris,et al.  Sparse Roadmap Spanners , 2012, WAFR.

[21]  Lydia E. Kavraki,et al.  A Sampling-Based Tree Planner for Systems With Complex Dynamics , 2012, IEEE Transactions on Robotics.

[22]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

[23]  Anthony Stentz,et al.  Anytime RRTs , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  David Hsu,et al.  Placing a robot manipulator amid obstacles for optimized execution , 1999, Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470).

[25]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[26]  M. Branicky,et al.  On Heavy-tailed Runtimes and Restarts in Rapidly-exploring Random Trees , 2008 .

[27]  Didier Wolf,et al.  Capture of homotopy classes with probabilistic road map , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[28]  Pekka Isto,et al.  Constructing probabilistic roadmaps with powerful local planning and path optimization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[29]  Reid G. Simmons,et al.  Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[30]  Steven M. LaValle,et al.  Reducing metric sensitivity in randomized trajectory design , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[31]  Kostas E. Bekris,et al.  Towards small asymptotically near-optimal roadmaps , 2012, 2012 IEEE International Conference on Robotics and Automation.

[32]  Wolfram Burgard,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[33]  Nancy M. Amato,et al.  Extracting optimal paths from roadmaps for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[34]  Kostas E. Bekris,et al.  Learning approximate cost-to-go metrics to improve sampling-based motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.