Skip to main content
SpringerLink
Log in

Collision detection algorithms for motion planning

  • Chapter
  • First Online:
Robot Motion Planning and Control

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 229))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Ahuja, R. T. Chien, R. Yen and N. Bridwell, „Interference detection and collision avoidance among three dimensional objects” in I Annual National Conference on AI (Stanford University) pp. 44–48 (Aug., 1980).

    Google Scholar 

  2. F. Avnaim, „Evaluating signs of determinants using single-precision arithmetic” (Tech. Rep. INRIA 2306) (1994).

    Google Scholar 

  3. C. Bajaj and T. Dey, “Convex decomposition of polyhedra and robustness” in SIAM J. Comput. 21(2) pp. 339–364 (Apr., 1992).

    Google Scholar 

  4. J. L. Bentley and T. A. Ottmann, „Algorithms for reporting and counting geometric intersections” in IEEE Trans. Comput. 28 (9) pp. 643–647 (Sept., 1979).

    Google Scholar 

  5. J. E. Bobrow, „A direct optimization approach for obtaining the distance between convex polyhedra” in Internat. J. Robotics Res. 8 (3) pp. 65–76 (June, 1983).

    Google Scholar 

  6. S. Bonner and R. B. Kelley, „A representation scheme for rapid 3-D collision detection” in Proceedings IEEE International Symposium on Intelligent Control (Arlington (VA)) pp. 320–325 (Aug., 1988).

    Google Scholar 

  7. J. W. Boyse, „Interference detection among solids and surfaces” in Comm. ACM 22 (1) pp. 3–9 (Jan., 1979).

    Google Scholar 

  8. S. A. Cameron, „Efficient intersection tests for objects defined constructively” in Internat. J. Robotics Res. 8 pp. 3–25 (Feb., 1989).

    Google Scholar 

  9. S. A. Cameron, „Collision detection by four-dimensional intersection testing” in IEEE Trans. Robotics Automat. 6 (3) pp. 291–302 (June, 1990).

    Google Scholar 

  10. S. A. Cameron, „A study of the clash detection problem in robotics” in IEEE Proc. Int. Conf. Robotics Automat. 1 (Saint Louis (MO)) pp. 488–493 (Mar., 1985).

    Google Scholar 

  11. J. F. Canny, „The complexity of robot motion planning” (PhD Thesis, The MIT Press, Cambridge (MA)) (1988).

    Google Scholar 

  12. J. F. Canny, „Collision detection for moving polyhedra” in IEEE Trans. Patt. Anal. Mach. Intell. 8 (2) pp. 200–209 (Mar., 1986).

    Google Scholar 

  13. B. Chazelle, „Convex partitions of polyhedra: A lower bound and a worst-case optimal algorithm” in SIAM J. Comput. 13 pp. 488–507 (1984).

    Google Scholar 

  14. J. D. Cohen, M. C. Lin, D. Manocha and M. K. Ponamgi, „I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments” in Proceedings of ACM Int. 3D Graphics Conference 1 pp. 189–196 (1995).

    Google Scholar 

  15. R. K. Culley and K. G. Kempf, „A collision detection algorithm based on velocity and distance bounds” in IEEE Proc. Int. Conf. Robotics Automat. 2 (San Francisco (CA)) pp. 1064–1069 (Apr., 1986).

    Google Scholar 

  16. D. Dobkin and D. Kirkpatrick, „Fast detection of polyhedral intersections” in Lect. Notes in Comp. Sci. (Springer-Verlag, New York-Heidelberg-Berlin) (140) pp. 154–165 (1982).

    Google Scholar 

  17. D. Dobkin and D. Kirkpatrick, „Determining the separation of preprocessed polyhedra-a unified approach” in ICALP-90, Lect. Notes in Comp. Sci. (Springer-Verlag, New York-Heidelberg-Berlin) (443) pp. 400–413 (1990).

    Google Scholar 

  18. B. R. Donald, „Local and global techniques for motion planning” (Masters Thesis, Massachusetts Institute of Technology) (1984).

    Google Scholar 

  19. A. Foisy and V. Hayward, „A safe swept volume method for collision detection” in The Sixth International Symposium of Robotics Research (Pittsburgh (PE)) pp. 61–68 (Oct., 1993).

    Google Scholar 

  20. A. Foisy, V. Hayward and S. Aubry, „The use of awareness in collision prediction” in IEEE Proc. Int. Conf. Robotics Automat. 1 (Cincinnati (OH)) pp. 338–343 (May, 1990).

    Google Scholar 

  21. L-C. Fu and D-Y. Liu, „An efficient algorithm for finding a collision-free path among polyhedral obstacles” in J. Robotic Sys. 7 (1) pp. 129–137 (Feb., 1990).

    Google Scholar 

  22. E. G. Gilbert and C-P. Foo, „Computing the distance between general convex objects in three-dimensional space” in IEEE Trans. Robotics Automat. 6 (1) pp. 53–61 (Feb., 1990).

    Google Scholar 

  23. E. G. Gilbert and S. M. Hong, „A new algorithm for detecting the collision of moving objects” in IEEE Proc. Int. Conf. Robotics Automat. 1 (Scottsdale (AR)) pp. 8–14 (May, 1989).

    Google Scholar 

  24. E. G. Gilbert, D. W. Johnson and S. Keerthi, „A fast procedure for computing the distance between complex objects in three dimensional space” in IEEE J. Robotics Automat. 4 (2) pp. 193–203 (Apr., 1988).

    Google Scholar 

  25. S. Gottschalk, M. C. Lin and D. Manocha, „OBB-Tree: A Hierarchical Structure for Rapid Interference Detection” in Proc. of ACM Siggraph'96 (1996).

    Google Scholar 

  26. G. J. Hamlin, R. B. Kelley and J. Tornero, „Efficient distance calculation using the spherically-extended polytope (S-tope) model” in IEEE Proc. Int. Conf. Robotics Automat. 3 (Nice (France)) pp. 2502–2507 (May, 1992).

    Google Scholar 

  27. V. Hayward, „Fast collision detection scheme by recursive decomposition of a manipulator workspace” in IEEE Proc. Int. Conf. Robotics Automat. 2 (San Francisco (CA)) pp. 1044–1049 (Apr., 1986).

    Google Scholar 

  28. P. Heckbert (ed.), „Graphic Gems IV” (Academic Press, 1994).

    Google Scholar 

  29. M. Herman, „Fast, three-dimensional, collision-free motion planning” in IEEE Proc. Int. Conf. Robotics Automat. 2 pp. 1056–1063 (Apr., 1986).

    Google Scholar 

  30. J. E. Hopcroft, J. T. Schwartz and M. Sharir, „Efficient detection of intersections among spheres” (Tech. Rep. 59, Dept. of Computer Science, Courant Inst. of Math. Sciences., N.Y.University) (Feb., 1983).

    Google Scholar 

  31. P. M. Hubbard, „Interactive collision detection” in Proc. IEEE Symp. on Research Frontiers in Virtual Reality 1 pp. 24–31 (Oct., 1993).

    Google Scholar 

  32. P. Jiménez and C. Torras, „Speeding Up Interference Detection Between Polyhedra” in IEEE Proc. Int. Conf. Robotics Automat. pp. 1485–1492 (Minneapolis (MN) (Apr., 1996).

    Google Scholar 

  33. P. Jiménez and C. Torras, „Collision detection: a geometric approach” in Modelling and Planning for Sensor Based Intelligent Robot Systems (H. Bunke, H. Noltemeier, T. Kanade (eds.)) World Scientific Pub. Co. (Nov., 1995).

    Google Scholar 

  34. J-C. Latombe, „Robot Motion Planning” Kluwer Academic Publishers (SECS 0124, Boston/Dordrecht/London) (1991).

    Google Scholar 

  35. M. C. Lin, „Efficient Collision Detection for Animation and Robotics” (PhD Thesis, University of California, Berkeley) (1993).

    Google Scholar 

  36. M. C. Lin and J. F. Canny, „An efficient algorithm for incremental distance computation” (to appear in IEEE Trans. Robotics Automat.).

    Google Scholar 

  37. M. C. Lin and J. F. Canny, „A fast algorithm for incremental distance calculation” in IEEE Proc. Int. Conf. Robotics Automat. 2 (Sacramento (CA)) pp. 1008–1014 (Apr., 1991).

    Google Scholar 

  38. M. C. Lin, D. Manocha and J. F. Canny, „Fast Contact Determination in Dynamic Environments” in IEEE Proc. Int. Conf. Robotics Automat. 1 (San Diego (CA)) pp. 602–608 (May, 1994).

    Google Scholar 

  39. Y-H. Liu, S. Arimoto and H. Noborio, „A new solid model HSM and its application to interference detection between moving objects” in J. Robotic Sys. 8 (1) pp. 39–54 (1991).

    Google Scholar 

  40. T. Lozano-Pérez, „Spatial planning: a configuration space approach” in IEEE Trans. Comput. 32 (2) pp. 108–120 (Feb., 1983).

    Google Scholar 

  41. T. Lozano-Pérez, „A simple motion-planning algorithm for general robot manipulators” in IEEE J. Robotics Automat. 3 (3) pp. 224–238 (June, 1987).

    Google Scholar 

  42. T. Lozano-Pérez and M. A. Wesley, „An algorithm for planning collision-free paths among polyhedral obstacles” in Comm. ACM 22 (10) pp. 560–570 (Oct., 1979).

    Google Scholar 

  43. V. J. Lumelsky, „Effect of kinematics on motion planning for planar robot arms amidst unknown obstacles” in IEEE J. Robotics Automat. 3 (3) pp. 207–223 (June, 1987).

    Google Scholar 

  44. N. Megiddo and A. Tamir, „Linear time algorithms for some separable quadratic programming problems” in Operations Research Letters 13 (4) pp. 203–211 (1993).

    Google Scholar 

  45. K. Mehlhorn and K. Simon, „Intersecting two polyhedra one of which is convex” in Fundamentals of Computation Theory 85, Lecture Notes in Computer Science 199 pp. 534–542 (1985).

    Google Scholar 

  46. W. Meyer, „Distance between boxes: applications to collision detection and clipping” in IEEE Proc. Int. Conf. Robotics Automat. 1 (San Francisco (CA)) pp. 597–602 (Apr., 1986).

    Google Scholar 

  47. B. Mirtich and J. F. Canny, „Impulse-based dynamic simulation” in Tech. Rep. CSD-94-815 (University of California) (1994).

    Google Scholar 

  48. M. Overmars, „Point location in fat subdivisions” in Information Processing letters 44 pp. 261–265 (1992).

    Google Scholar 

  49. M. Pellegrini, „Stabbing and ray shooting in 3-space” in Proceedings of the 6thACM Symposium on Computational Geometry pp. 177–186 (1990).

    Google Scholar 

  50. A. P. del-Pobil, M. A. Serna and J. Llovet, „A new representation for collision avoidance and detection” in IEEE Proc. Int. Conf. Robotics Automat. 1 (Nice (France)) pp. 246–251 (May, 1992).

    Google Scholar 

  51. M. K. Ponamgi, D. Manocha and M. C. Lin, „Incremental algorithms for collision detection between solid models” in Proceedings of ACM/Siggraph Symposium on Solid Modelling 1 pp. 293–304 (1995).

    Google Scholar 

  52. S. Quinlan, „Efficient Distance Computation between Non-Convex Objects” in IEEE Proc. Int. Conf. Robotics Automat. 4 (San Diego (CA)) pp. 3324–3329 (1994).

    Google Scholar 

  53. N. K. Sancheti and S. S. Keerthi, „Computation of certain measures of proximity between convex polytopes: a complexity viewpoint” in IEEE Proc. Int. Conf. Robotics Automat. 3 (Nice (France)) pp. 2508–2513 (May, 1992).

    Google Scholar 

  54. E. Schömer and C. Thiel, „Efficient collision detection for moving polyhedra” (Tech. Rep. MPI-1-94-147, Max Plank Inst. Informatik Saarbr.) (1995).

    Google Scholar 

  55. K. Sun and V. Lumelsky, „Path planning among unknown obstacles: the case of a three dimensional cartesian arm” in IEEE Trans. Robotics Automat. 8 (6) pp. 776–786 (Dec., 1992).

    Google Scholar 

  56. W. C. Thibault and B. F. Naylor, „Set operations on polyhedra using binary space partitioning trees” in ACM Computer Graphics 21 (4) (July, 1987).

    Google Scholar 

  57. F. Thomas, „An approach to the movers problem that combines oriented matroid theory and algebraic geometry.” in IEEE Proc. Int. Conf. Robotics Automat. 1 (Nagoya (J)) (May, 1995).

    Google Scholar 

  58. F. Thomas and C. Torras, „Interference detection between non-convex polyhedra revisited with a practical aim” in IEEE Proc. Int. Conf. Robotics Automat. 1 (San Diego (CA)) pp. 587–594 (May, 1994).

    Google Scholar 

  59. J. Tornero, J. Hamlin and R. B. Kelley, „Spherical-object representation and fast distance computation for robotic applications” in IEEE Proc. Int. Conf. Robotics Automat. 2 (Sacramento (CA)) pp. 1602–1608 (Apr., 1991).

    Google Scholar 

  60. G. Turk, „Interactive collision detection for molecular graphics” (Master Thesis, University of North Carolina) (1989).

    Google Scholar 

  61. G. Vanecek, „Back-face culling applied to collision detection of polyhedra” (to appear in “Journal of Visualization and Computer Animation”).

    Google Scholar 

  62. S. Zeghloul, P. Rambeaud and J. P. Lallemand, „A fast distance calculation between convex objects by optimization approach” in IEEE Proc. Int. Conf. Robotics Automat. 3 (Nice (France)) pp. 2520–2525 (May, 1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Robòtica i Informàtica Industrial, Barcelona

    P. Jiménez, F. Thomas & C. Torras

Authors
  1. P. Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Torras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. -P. Laumond

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this chapter

Cite this chapter

Jiménez, P., Thomas, F., Torras, C. (1998). Collision detection algorithms for motion planning. In: Laumond, J.P. (eds) Robot Motion Planning and Control. Lecture Notes in Control and Information Sciences, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036075

Download citation

  • DOI: https://doi.org/10.1007/BFb0036075

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76219-5

  • Online ISBN: 978-3-540-40917-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation