Performance study of single-query motion planning for grasp execution using various manipulators

This paper identifies high performing motion planners among three manipulators when carrying out grasp executions. Simultaneously, this paper presents useful benchmarking data. Sampling-based motion planners of OMPL available for use in MoveIt! are compared by performing several grasping-related motion planning problems. The performance of the planners is measured by means of solved runs, computing time and path length. Based on the results, recommendations are made for planner choice that shows high performance for the used manipulators.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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