Fast and accurate collision detection based on enclosed ellipsoid

A fast and accurate method for detecting the collisions of convex polyhedra in a graphical simulation environment based on a newly developed method of distance estimate is presented. By the simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipsoid is introduced. Graphical simulations of two case studies (moving polyhedral objects in three-dimensional space and multiple robot arms undergoing straight line motions) are conducted to demonstrate the accuracy of the proposed algorithm for collision detection.

[1]  Chia-Ju Wu.  On the representation and collision detection of robots , 1996, J. Intell. Robotic Syst..

[2]  Bum Hee Lee,et al.  Collision-Free Motion Planning of Two Robots , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

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

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

[7]  R. B. Kelley,et al.  Spherical-object representation and fast distance computation for robotic applications , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[8]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[9]  Jing-Sin Liu,et al.  Estimate of minimum distance between convex polyhedra based on enclosed ellipsoids , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[10]  S. Bonner,et al.  A novel representation for planning 3-D collision-free paths , 1990, IEEE Trans. Syst. Man Cybern..

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

[12]  George W. Irwin,et al.  An approach to time-optimal, smooth and collision-free path planning in a two robot arm environment , 1996, Robotica.

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

[14]  D. Jung,et al.  Octree-based hierarchical distance maps for collision detection , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[15]  Myung Jin Chung,et al.  Collision-free motion planning for two articulated robot arms using minimum distance functions , 1990, Robotica.

[16]  G. Garcia,et al.  A New Collision Detection Algorithm Using Octree Models , 1989, Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications.

[17]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[18]  Rajiv Mehrotra,et al.  Collision detection for planning collision-free motion of two robot arms , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[19]  Neil F. Stewart,et al.  Distance calculation for imminent collision indication in a robot System simulation , 1988, Robotica.

[20]  Stephen P. Boyd,et al.  Obstacle Collision Detection Using Best Ellipsoid Fit , 1997, J. Intell. Robotic Syst..