An experimental evaluation of collision detection packages for robot motion planning

Randomized motion planners are greatly affected by the efficiency and robustness of algorithms for collision checking of robot configurations. A number of powerful collision detection algorithms are currently available to the research community although their relative capabilities and performance cannot be easily compared due to the many factors involved. We have experimentally evaluated collision detection packages within the context of motion planning for rigid and articulated robots in 3D workspaces. Artificial and realistic problems have been chosen as benchmarks to assess package behavior with different object models. Reported experimental results should help the user in choosing the appropriate collision detection package. In this paper we also present the framework we exploited in our planner to allow pluggable distance computation functions and keep the code simple and easy to maintain.

[1]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[2]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[3]  M. Levas.  OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[4]  Stefano Caselli,et al.  Parallel path planning with multiple evasion strategies , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[5]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[7]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

[8]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[9]  Stefano Caselli,et al.  Heuristic methods for randomized path planning in potential fields , 2001, Proceedings 2001 IEEE International Symposium on Computational Intelligence in Robotics and Automation (Cat. No.01EX515).

[10]  Stefano Caselli,et al.  ERPP: An experience-based randomized path planner , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[11]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[12]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Carme Torras,et al.  Collision detection algorithms for motion planning , 1998 .

[14]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[15]  Ralph Johnson,et al.  Design patterns: elements of reuseable object-oriented software , 1994 .

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

[17]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[18]  Ming C. Lin,et al.  Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[19]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[20]  Gino van den Bergen.  A Fast and Robust GJK Implementation for Collision Detection of Convex Objects , 1999, J. Graphics, GPU, & Game Tools.

[21]  Dinesh Manocha,et al.  V-COLLIDE: accelerated collision detection for VRML , 1997, VRML '97.

[22]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[23]  Walter Meyer,et al.  Distances between boxes: Applications to collision detection and clipping , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.