An empirical study of single-query motion planning for grasp execution

This paper identifies high-performing Open Motion Planning Library (OMPL) planners for grasp execution and simultaneously presents useful benchmark data. Four grasp executions were defined using a UR5 manipulator. The performance was measured by means of solved runs, computing time and path length. Based on the results, planners are recommended and the reasons are discussed.

[1]  Marco Pavone,et al.  An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[2]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[3]  Lydia E. Kavraki,et al.  An Extensible Benchmarking Infrastructure for Motion Planning Algorithms , 2014, ArXiv.

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

[5]  Lydia E. Kavraki,et al.  Benchmarking Motion Planning Algorithms: An Extensible Infrastructure for Analysis and Visualization , 2014, IEEE Robotics & Automation Magazine.

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

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

[8]  Lydia E. Kavraki,et al.  Motion Planning in the Presence of Drift, Underactuation and Discrete System Changes , 2005, Robotics: Science and Systems.

[9]  Lydia E. Kavraki,et al.  Kinodynamic Motion Planning by Interior-Exterior Cell Exploration , 2008, WAFR.

[10]  Open Motion Planning Library: A Primer , 2013 .

[11]  Juan Cort.  Sampling-Based Path Planning on Configuration-Space Costmaps , 2010 .

[12]  Lydia E. Kavraki,et al.  Resolution Independent Density Estimation for motion planning in high-dimensional spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[13]  Kostas E. Bekris,et al.  Improving sparse roadmap spanners , 2013, 2013 IEEE International Conference on Robotics and Automation.

[14]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[15]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2014, ICRA.

[16]  Didier Devaurs,et al.  Enhancing the transition-based RRT to deal with complex cost spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

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

[18]  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).

[19]  Lydia E. Kavraki,et al.  Benchmarking Motion Planning Algorithms , 2015 .

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

[21]  Marco Pavone,et al.  Fast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions , 2013, ISRR.