An empirical study of optimal motion planning

This paper presents a systematic benchmarking comparison between optimal motion planners. Six planners representing the categories of sampling-based, grid-based, and trajectory optimization methods are compared on synthetic problems of varying dimensionality, number of homotopy classes, and width and length of narrow passages. Performance statistics are gathered on success and convergence rates, and performance variations with respect to geometric characteristics are analyzed. Based on this analysis, we recommend planners that are likely to perform well for certain problem classes, and make recommendations for future planning research.

[1]  Baris Akgün,et al.  Sampling heuristics for optimal motion planning in high dimensions , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Lydia E. Kavraki,et al.  Anytime solution optimization for sampling-based motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[3]  Marin Kobilarov,et al.  Cross-Entropy Randomized Motion Planning , 2011, Robotics: Science and Systems.

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

[5]  Stefan Schaal,et al.  STOMP: Stochastic trajectory optimization for motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[6]  Luis Moreno,et al.  Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[8]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[9]  Leslie Pack Kaelbling,et al.  LQR-RRT*: Optimal sampling-based motion planning with automatically derived extension heuristics , 2012, 2012 IEEE International Conference on Robotics and Automation.

[10]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[11]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[12]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

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

[15]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[16]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[17]  J. Betts.  Survey of Numerical Methods for Trajectory Optimization , 1998 .

[18]  Olivier Lavialle,et al.  Consideration of obstacle danger level in path planning using A* and Fast-Marching optimisation: comparative study , 2003, Signal Process..

[19]  Bruce H. Krogh,et al.  The use of simulated annealing to solve the mobile manipulator path planning problem , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

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

[21]  Anthony Stentz,et al.  Using interpolation to improve path planning: The Field D* algorithm , 2006, J. Field Robotics.