Fast versions of the Gilbert-Johnson-Keerthi distance algorithm: additional results and comparisons

Considers fast algorithms for computing the Euclidean distance between objects that are modeled by convex polytopes in three-dimensional space. The algorithms, designated by RGJK, are modifications of the Gilbert-Johnson-Keerthi algorithm that follow the scheme originated by Cameron (1997). Each polytope is represented by its vertices and a list of adjacent vertices for each vertex. When the algorithms are appropriately applied to a pair of objects that have small incremental motions, they share the advantage of the closest-feature algorithm introduced by Lin and Canny (1991): computational time is very small and does not depend significantly on the total number of object vertices. However, when the objects contain complex vertices or faces, the time can increase drastically. Reasons for this problem are analyzed and algorithmic fixes for them are given. Other contributions to algorithmic performance include a procedure for reducing computational time in the presence of collisions. Comprehensive numerical experiments illuminate the dependence of computational time on algorithmic details, object complexity, and the size of incremental motions. The experiments include direct comparisons of RGJK with the closest-feature algorithms of Lin and Canny and of Mirtich (1998).

[1]  Masaki Togai,et al.  An application of the singular value decomposition to manipulability and sensitivity of industrial robots , 1986 .

[2]  Elmer G. Gilbert,et al.  The Gilbert-Johnson-Keerthi distance algorithm: a fast version for incremental motions , 1997, Proceedings of International Conference on Robotics and Automation.

[3]  鍾達良,et al.  An efficient collision detection algorithm for polytopes in virtual environments , 1996 .

[4]  Tsuneo Yoshikawa,et al.  Manipulability of Robotic Mechanisms , 1985 .

[5]  Jean-Pierre Merlet,et al.  Efficient estimation of the extremal articular forces of a parallel manipulator in a translation workspace , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[6]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..

[7]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[8]  Kazuhiro Kosuge,et al.  Input/output force analysis of parallel link manipulators , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

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

[10]  Jaehoon Lee,et al.  A Practical Quality Index Based on the Octahedral Manipulator , 1998, Int. J. Robotics Res..

[11]  C. Melchiorri,et al.  Robot manipulability , 1995, IEEE Trans. Robotics Autom..

[12]  Angelika Bunse-Gerstner,et al.  An algorithm for the symmetric generalized eigenvalue problem , 1984 .

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

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

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

[16]  P. McMullen.  Convex Sets and Their Applications , 1982 .

[17]  Stephen Cameron,et al.  A comparison of two fast algorithms for computing the distance between convex polyhedra , 1997, IEEE Trans. Robotics Autom..

[18]  Dinesh Manocha,et al.  Incremental Algorithms for Collision Detection Between Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

[19]  John J. Craig,et al.  Articulated hands: Force control and kinematic issues , 1981 .

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

[21]  Han S. Kim,et al.  The kinetostatic capability analysis of robotic manipulators , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[22]  Yuichi Sato,et al.  Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[23]  Joseph Duffy,et al.  The fallacy of modern hybrid control theory that is based on "orthogonal complements" of twist and wrench spaces , 1990, J. Field Robotics.

[24]  M. J. D. Powell,et al.  Variable Metric Methods for Constrained Optimization , 1982, ISMP.