Collision detection by four-dimensional intersection testing

The collision-detection problem is to decide, given two objects and desired motions, whether the objects will come into collision over a given time span. The solution of this problem is useful, both in robotics and in other problem domains. A method is described for solving collision detection that involves transforming the problem into an intersection-detection problem over space time. The theoretical basis for the solution is given and an efficient implementation described based on describing the objects and motions constructively. The related problems of describing the collision region and detecting collisions when there are more than two moving objects are also described. >

[1]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[2]  Aristides A. G. Requicha,et al.  Closure of Boolean operations on geometric entities , 1980 .

[3]  Jeanine Meyer,et al.  An emulation system for programmable sensory robots , 1981 .

[4]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

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

[6]  J. Vanrosendale,et al.  An intersection algorithm for moving parts , 1984 .

[7]  Stephen Alan Cameron,et al.  Modelling solids in motion , 1984 .

[8]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[9]  Stephen Cameron,et al.  A study of the clash detection problem in robotics , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[10]  Hanan Samet,et al.  Bintrees, CSG trees, and time , 1985, SIGGRAPH.

[11]  Karl G. Kempf,et al.  A collision detection algorithm based on velocity and distance bounds , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[12]  Tomas Lozano-Perez.  A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[13]  B. Faverjon,et al.  A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[14]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

[15]  Andrew S. Glassner,et al.  Spacetime ray tracing for animation , 1988, IEEE Computer Graphics and Applications.

[16]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[17]  Jarek Rossignac,et al.  Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms , 1988, TOGS.

[18]  Stephen Cameron,et al.  ROBMOD: a geometry engine for robotics , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[19]  Stephen Cameron,et al.  Efficient Intersection Tests for Objects Defined Constructively , 1989, Int. J. Robotics Res..

[20]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[21]  S. Cameron.  Eecient Intersection Tests for Objects Deened Constructively 1 Intersection Detection Problems , 1990 .

[22]  Stephen Cameron,et al.  Refinement methods for geometric bounds in constructive solid geometry , 1992, TOGS.