On the Quantification of Penetration between General Objects

In this article, we study the characterization, properties, and limitations of a variety of measures of penetration between two general object models. Measures of penetration between convex objects have appeared in the literature. We introduce new measures of penetration for general objects, which are generalizations of those for convex objects. We illustrate by example that these new measures are more accurate estimates of penetration in the case of nonconvex objects. Several proper ties of the new measures are derived. These include continuity of the measures with respect to rotational and translational parameters of the two objects, and invariance with respect to the choice of coordinate system. Since these measures are generalizations of the measures of penetration between convex objects, properties of the new measures are also properties of the traditional measures. An important property of these new penetration measures is established: the new penetration mea sures and the traditional penetration measures are the same in the case of convex objects.

[1]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[2]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

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

[4]  K Sridharan,et al.  Measures of intensity of collision between convex objects and their efficient computation , 1991 .

[5]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[6]  P. Hughes.  Spacecraft Attitude Dynamics , 1986 .

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

[8]  Joel W. Burdick,et al.  Mobility of Bodies in Contact{ii: How Forces Are Generated by Curvature Eeects? , 1994 .

[9]  Chong Jin Ong,et al.  Penetration distances and their applications to path planning. , 1993 .

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

[11]  J. Michael McCarthy,et al.  Introduction to theoretical kinematics , 1990 .

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

[13]  Elmer G. Gilbert,et al.  New distances for the separation and penetration of objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[14]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[15]  Elmer G. Gilbert,et al.  Robot path planning with penetration growth distance , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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

[17]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[18]  Joel W. Burdick,et al.  Mobility of bodies in contact. I. A 2nd-order mobility index for multiple-finger grasps , 1994, IEEE Trans. Robotics Autom..