Collision detection algorithms for motion planning

Collision detection is a basic tool whose performance is of capital importancein order to achieve eciency in many robotics and computer graphics applica-tions, such as motion planning, obstacle avoidance, virtual prototyping, com-puter animation, physical-based modeling, dynamic simulation, and, in general,all those tasks involving the simulated motion of solids which cannot penetrateone another. In these applications, collision detection appears as a module orprocedure which exchanges information with other parts of the system concern-ing motion, kinematic and dynamic behaviour, etc. It is a widespread opinionto consider collision detection as the main bottleneck in these kinds of appli-cations.In fact, static interference detection, collision detection and the generationof con guration-space obstacles can be viewed as instances of the same prob-lem, where objects are tested for interference at a particular position, along atrajectory and throughout the whole workspace, respectively. The structure ofthis chapter reects this fact.Thus, the main guidelines in static interference detection are presented inSection 2. It is shown how hierarchical representations allow to focus on relevantregions where interference is most likely to occur, speeding up the whole inter-ference test procedure. Some interference tests reduce to detecting intersectionsbetween simple enclosing shapes, such as spheres or boxes aligned with the co-ordinate axes. However, in some situations, this approximate approach does notsuce, and exact basic interference tests (for polyhedral environments) are re-quired. The most widely used such test is that involving a segment (standing foran edge) and a polygon in 3D space (standing for a face of a polyhedron). In thiscontext, it has recently been proved that interference detection between non-convex polyhedra can be reduced, like many other problems in ComputationalGeometry, to checking some signs of vertex determinants, without computingnew geometric entities.Interference tests lie at the base of most collision detection algorithms,which are the subject of Section 3. These algorithms can be grouped into fourapproaches: multiple interference detection, swept volume interference, space-

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

[2]  Federico Thomas,et al.  An approach to the movers' problem that combines oriented matroid theory and algebraic geometry , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

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

[4]  Yunhui Liu,et al.  A new solid model HSM and its application to interference detection between moving objects , 1991, J. Field Robotics.

[5]  R. Kelley,et al.  A representation scheme for rapid 3D collision detection , 1988, Proceedings IEEE International Symposium on Intelligent Control 1988.

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

[7]  Mark H. Overmars,et al.  Point Location in Fat Subdivisions , 1992, Inf. Process. Lett..

[8]  Narendra Ahuja,et al.  Interference Detection and Collision Avoidance Among Three Dimensional Objects , 1980, AAAI.

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

[10]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[11]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[12]  Li-Chen Fu,et al.  An efficient algorithm for finding a collision-free path among polyhedral obstacles , 1990, J. Field Robotics.

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

[14]  Josep Tornero,et al.  Efficient distance calculation using the spherically-extended polytope (S-tope) model , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[15]  Takeo Kanade,et al.  Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, October 24-28, 1994] , 1995, Modelling and Planning for Sensor Based Intelligent Robot Systems.

[16]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

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

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

[19]  Kurt Mehlhorn,et al.  Intersecting two polyhedra one of which is convex , 1985, FCT.

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

[21]  S. Sathiya Keerthi,et al.  Computation of certain measures of proximity between convex polytopes: a complexity viewpoint , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[22]  Greg Turk,et al.  Interactive Collision Detection for Molecular Graphics , 1990 .

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

[24]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[25]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[26]  T. Siméon,et al.  Motion Planning , 2019, Aerial Robotic Manipulation.

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

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

[29]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[30]  J. Schwartz,et al.  Efficient Detection of Intersections among Spheres , 1983 .

[31]  Carme Torras,et al.  Interference detection between non-convex polyhedra revisited with a practical aim , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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

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

[34]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersections , 1982, ICALP.

[35]  Marco Pellegrini,et al.  Stabbing and ray shooting in 3 dimensional space , 1990, SCG '90.

[36]  Elmar Schömer,et al.  Efficient collision detection for moving polyhedra , 1995, SCG '95.

[37]  Nimrod Megiddo,et al.  Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..

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

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

[40]  Vladimir J. Lumelsky,et al.  Path planning among unknown obstacles: the case of a three-dimensional Cartesian arm , 1992, IEEE Trans. Robotics Autom..

[41]  Carme Torras,et al.  Collision Detection : A Geometric Approach , 1994, Modelling and Planning for Sensor Based Intelligent Robot Systems.

[42]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..

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

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

[45]  Chandrajit L. Bajaj,et al.  Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..

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

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

[48]  Vincent Hayward,et al.  The use of awareness in collision prediction , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[49]  Carme Torras,et al.  Speeding up interference detection between polyhedra , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

[51]  Walter Meyer,et al.  Distances between boxes: Applications to collision detection and clipping , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[53]  George Vanĕček Back-Face Culling Applied to Collision Detection of Polyhedra , 1993 .

[54]  Vladimir J. Lumelsky Effect of kinematics on motion planning for planar robot arms moving amidst unknown obstacles , 1987, IEEE J. Robotics Autom..

[55]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

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

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

[58]  S. Zeghloul,et al.  A fast distance calculation between convex objects by optimization approach , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

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