Kinetic collision detection: algorithms and experiments

Efficient collision detection is important in many robotic tasks, from high-level motion planning in a static environment to low-level reactive behavior in dynamic situations. Specially challenging are problems in which multiple robots are moving among multiple moving obstacles. In this paper we present a number of collision detection algorithms formulated under the kinetic data structures (KDS) framework, a framework for design and analyzing algorithms for objects in motion. The KDS framework leads to event-based algorithms that sample the state of different parts of the system only as often as necessary for the task at hand. Earlier work has demonstrated the theoretical efficiency of KDS algorithms. In this paper we present new algorithms and demonstrate their practical efficiency as well as by an implementable and direct comparison with classical broad and narrow phase collision detection techniques.

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

[2]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

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

[4]  Leonidas J. Guibas,et al.  Interval methods for kinetic simulations , 1999, SCG '99.

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

[6]  John Canny,et al.  Impulse-Based Dynamic Simulation , 1995 .

[7]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[8]  Leonidas J. Guibas,et al.  Euclidean proximity and power diagrams , 1998, CCCG.

[9]  L. Guibas,et al.  Separation-sensitive kinetic collision detection for convex objects , 1998 .

[10]  D. Baraff.  Dynamic simulation of nonpenetrating rigid bodies , 1992 .

[11]  Leonidas J. Guibas,et al.  Voronoi Diagrams of Moving Points , 1998, Int. J. Comput. Geom. Appl..

[12]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[13]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[14]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[15]  Brian Mirtich,et al.  Impulse-based dynamic simulation of rigid body systems , 1996 .

[16]  David G. Kirkpatrick,et al.  Implicitly Searching Convolutions and Computing Depth of Collision , 1990, SIGAL International Symposium on Algorithms.

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

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

[19]  M HubbardPhilip.  Collision Detection for Interactive Graphics Applications , 1995 .

[20]  Herbert Edelsbrunner,et al.  Smooth Surfaces for Multi-Scale Shape Representation , 1995, FSTTCS.

[21]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three space , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[22]  Sean Quinlan.  Real-time modification of collision-free paths , 1994 .