Fast swept-volume distance for robust collision detection

The need for collision detection arises in several robotics areas, including motion-planning, online collision avoidance, and simulation. At the heart of most current methods are algorithms for interference detection and/or distance computation. A few recent algorithms and implementations are very fast, but to use them for accurate collision detection, very small step sizes can be necessary, reducing their effective efficiency. We present a fast, implemented technique for doing exact distance computation and interference detection for translationally-swept bodies. For rotationally swept bodies, we adapt this technique to improve accuracy, for any given step size, in distance computation and interference detection. We present preliminary experiments which show that the combination of basic and swept-body calculations holds much promise for faster accurate collision detection.

[1]  John F. Canny,et al.  Impulse-based simulation of rigid bodies , 1995, I3D '95.

[2]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[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]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[5]  Bernard Faverjon,et al.  Hierarchical object models for efficient anti-collision algorithms , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[7]  Hiroshi Noborio,et al.  A feasible approach to automatic planning of collision-free robot motions , 1988 .

[8]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Computer Graphics and Image Processing.

[9]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

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

[11]  Martin Held,et al.  Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs , 1995 .

[12]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[13]  Bruce F. Naylor,et al.  Interactive solid geometry via partitioning trees , 1992 .

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

[15]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[16]  George Vaněček.  BRep-Index: a multidimensional space partitioning tree , 1990 .

[17]  P.G. Xavier.  A generic algorithm for constructing hierarchical representations of geometric objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[18]  David Baraff,et al.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.

[19]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[21]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

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

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