Flexible exploitation of space coherence to detect collisions of convex polyhedra

The paper presents a fast algorithm to compute collision translations for pairs of convex polyhedra with some interesting features. From a theoretical viewpoint, besides the novelty of the approach, the polylog asymptotic trend in the average case is as good as that of the best algorithms proposed to solve the similar problems. On the other hand, the measured performances to detect possible collisions from scratch are satisfactory, and this is especially true in cases where the bodies do not collide. However, the most peculiar feature is a simple and flexible mechanism to exploit spatial coherence in a continuous range, which distinguishes this algorithm from all the other proposals we know. Furthermore, the nature of the approach is such that the self-tuning capability is attained at negligible additional costs even for unrelated collision tests. After a brief outline of the main ideas characterizing the approach, a set of numerical results are summarized. The proposed algorithm may be appropriate to plan collision-free paths, both online and off-line, on the basis of fine-grain descriptions of the objects in the workspace.

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

[2]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[3]  Elaine Cohen,et al.  Bound coherence for minimum distance computations , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[5]  Enrico Pagello,et al.  Exact Geometry and Robot Motion Planning: Speculations on a Few Numerical Experiments , 1998, IEA/AIE.

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

[7]  Dinesh Manocha,et al.  Interactive and Exact Collision Detection for Large-Scaled Environments , 1997 .

[8]  Angel P. del Pobil,et al.  Very fast collision detection for practical motion planning. I. The spatial representation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[9]  Abderrahmane Kheddar,et al.  An algebraic solution to the problem of collision detection for rigid polyhedral objects , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[10]  Enrico Pagello,et al.  Fast convex minimization to detect collisions between polyhedra , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[11]  Binhai Zhu,et al.  Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time , 1997, Comput. Geom..

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

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

[14]  Carme Torras,et al.  Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[16]  Carme Torras,et al.  Interference detection between non-convex polyhedra revisited with a practical aim , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[17]  Stephen Cameron,et al.  Computing signed distances between free-form objects , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

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

[20]  Enrico Pagello,et al.  A practical motion planning strategy based on a plane-sweep approach , 1997, Proceedings of International Conference on Robotics and Automation.

[21]  Eugene Wong,et al.  A dual approach to detect polyhedral intersections in arbitrary dimensions , 1991, BIT.

[22]  Claudio Mirolo.  Convex Minimization on a Grid and Applications , 1998, J. Algorithms.

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

[24]  Chong Jin Ong,et al.  An incremental version of growth distance , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

[26]  Patrick G. Xavier,et al.  Fast swept-volume distance for robust collision detection , 1997, Proceedings of International Conference on Robotics and Automation.

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

[28]  Elaine Cohen,et al.  A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[29]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

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

[31]  Angel P. del Pobil,et al.  Practical Motion Planning in Robotics: Current Approaches and Future Directions , 1998 .

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

[33]  K. Sridharan,et al.  Algorithms for rapid computation of some distance functions between objects for path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[34]  Stephen Cameron,et al.  Computing distances between NURBS-defined convex objects , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[35]  Dinesh Manocha,et al.  Fast algorithms for penetration and contact determination between non-convex polyhedral models , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[36]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[37]  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).

[38]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.