A practical approach to collision detection between general objects

Since collision detection is becoming a bottleneck for real-world applications involving increasingly complex geometries, more efficient ways of detecting collisions are called for. Hierarchies of detail based on spheres seem a powerful approach to overcome this problem. A representation for non-convex objects with curved surfaces is presented, which is independent of the number of features used for the polyhedral model of the object. A new algorithm for collision detection between many moving objects is described. Experiments with two different robots show the efficiency of the method.

[1]  Angel P. del Pobil,et al.  Spatial Representation and Motion Planning , 1995, Lecture Notes in Computer Science.

[2]  Hsuan Chang.  Motion planning in virtual prototyping: practical considerations , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[3]  Elmer G. Gilbert,et al.  A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

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

[6]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

[7]  Angel P. del Pobil,et al.  A new representation for collision avoidance and detection , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[8]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[9]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

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

[11]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

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

[13]  Vincent Hayward,et al.  Efficient Collision Prediction Among Many Moving Objects , 1995, Int. J. Robotics Res..

[14]  Alejandro M. García-Alonso,et al.  Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

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

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

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

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

[19]  Dinesh Manocha,et al.  Incremental algorithms for collision detection between solid models , 1995, Symposium on Solid Modeling and Applications.

[20]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

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

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

[23]  Vincent Hayward,et al.  Fast collision detection scheme by recursive decomposition of a manipulator workspace , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.