An efficient algorithm for the generalized distance measure

This paper presents an efficient algorithm for computing a distance measure between two compact convex sets Q and A, defined as the minimum scale factor such that the scaled Q is not disjoint from A. An important application of this algorithm in robotics is the computation of the minimum distance between two objects, which can be performed by taking A as the Minkowski difference of the objects and Q as a set containing the origin in its interior. In this generalized definition, the traditional Euclidean distance is a special case where Q is the unit ball. While this distance measure was proposed almost a decade ago, there has been no efficient algorithm to compute it in general cases. Our algorithm fills this void and we demonstrate its superior efficiency compared to approaches based on general-purpose optimization.

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

[2]  Elmer G. Gilbert,et al.  Fast versions of the Gilbert-Johnson-Keerthi distance algorithm: additional results and comparisons , 2001, IEEE Trans. Robotics Autom..

[3]  Yu Zheng,et al.  A numerical solution to the ray-shooting problem and its applications in robotic grasping , 2009, 2009 IEEE International Conference on Robotics and Automation.

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

[5]  Dinesh Manocha,et al.  A fast n-dimensional ray-shooting algorithm for grasping force optimization , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[7]  R. Kannan,et al.  Convex Sets and their Applications , 2006 .

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

[9]  S. Sathiya Keerthi,et al.  Improvements to Platt's SMO Algorithm for SVM Classifier Design , 2001, Neural Computation.

[10]  Yu Zheng,et al.  Ray-Shooting Algorithms for Robotics , 2013, IEEE Transactions on Automation Science and Engineering.

[11]  Xiangyang Zhu,et al.  A pseudodistance function and its applications , 2004, IEEE Transactions on Robotics and Automation.

[12]  Jun Wang,et al.  Synthesis of force-closure grasps on 3-D objects based on the Q distance , 2003, IEEE Trans. Robotics Autom..

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

[14]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[15]  W. Rudin.  Principles of mathematical analysis , 1964 .