Growth distances: new measures for object separation and penetration

Quantitative measures for the separation and penetration of two convex objects are formulated, These measures, called separation and penetration growth distances, are closely related to traditional translational distance measures and share many of their desirable properties. The solution of a single optimization problem yields both the separation and penetration distances. For 3D polytopes the optimization problem is a linear program in four variables whose asymptotic computational time is O(m), where m is the number of linear inequalities required to specify the two polytopes. This equals or far betters the known times required to compute translational distances: O(m) for separation and 0(m/sup 2/ log m) for penetration. When the positioning of the two objects depends on configuration variables, the partial derivatives of the growth distances with respect to the configuration variables exist almost everywhere. Derivatives of the penetration growth distance can be used to construct motions which separate the objects. An application to path finding is described.

[1]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

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

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

[4]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[5]  K. Sridharan,et al.  Distance Measures on Intersecting Objects and Their Applications , 1994, Inf. Process. Lett..

[6]  James E. Bobrow,et al.  A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..

[7]  Dinesh Manocha,et al.  Fast contact determination in dynamic environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[8]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[9]  Charles E. Buckley,et al.  A Foundation for the "Flexible-Trajectory" Approach to Numeric Path Planning , 1987, Int. J. Robotics Res..

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

[11]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

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

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

[14]  S. Zeghloul,et al.  A fast distance calculation between convex objects by optimization approach , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[15]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

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

[17]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[18]  Larry J. Leifer,et al.  A Proximity Metric for Continuum Path Planning , 1985, IJCAI.

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

[20]  S. Sathiya Keerthi,et al.  Computation of certain measures of proximity between convex polytopes: a complexity viewpoint , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

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

[22]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[23]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[24]  C. Ong.  Properties of penetration between general objects , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

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