Skip to main content
SpringerLink
Log in

A simple algorithm for intelligent manipulator collision-free motion

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The collision-free planning of motion is a fundamental problem for artificial intelligence applications in robotics. The ability to compute a continuous safe path for a robot in a given environment will make possible the development of task-level robot planning systems so that the implementation details and the particular robot motion sequence will be ignored by the programmer.

A new approach to planning collision-free motions for general real-life six degrees of freedom (d.o.f.) manipulators is presented. It is based on a simple object model previously developed. The complexity of the general collision detection problem is reduced, and realistic collision-free paths are efficiently found onCS planes. A heuristic evaluation function with a real physical sense is introduced, and computational cost is reduced to the strictly necessary by selecting the most adequate level of representation. A general algorithm is defined for 6 d.o.f. robots that yields good results for actual robot models with complex design structures with the aid of various heuristic techniques. The problem of adaptive motion is also considered.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Brady et al. (Eds.),Robotics and Artificial Intelligence Springer-Verlag: Berlin, 1984.

    Google Scholar 

  2. J.E. Hopcroft and D.B. Krafft, “The challenge of robotics for computer science,” inAdvances in Robotics (Vol. I): Algorithmic and Geometric Aspects of Robotics edited by J.T. Schwartz and C.K. Yap, Lawrence Erlbaum: Hillsdale, NJ, pp. 7–42, 1987.

    Google Scholar 

  3. R.A. Brooks, “Planning collision-free motions for pick-and-place operations,”Int. J. Robot. Res. vol. 2, no. 4, pp. 19–44, 1983.

    Google Scholar 

  4. A.P. del Pobil,Robot Motion Planning based on Artificial Intelligence Techniques: a Spherical Model, Ph.D. Thesis, University of Navarra, July 1991.

  5. A.P. del Pobil and M.A. Serna, “A spherical hierarchical representation for robot motion planning,”Proc. ASME Int. Computer Eng. Conf., Santa Clara, CA, August 1991, pp. 441–446.

  6. A.P. del Pobil, and M.A. Serna, “A new object representation for robotics and artificial intelligence applications,”Int. J. Robot. Autom., (in press).

  7. J.W. Boyse, “Interference detection among solids and surfaces,”Comm. ACM vol. 22, no. 1, pp. 3–9, January 1979.

    Google Scholar 

  8. T. Lozano-Pérez, “A simple motion-planning algorithm for general robot manipulators,”IEEE J. Robot. Autom. vol. RA-3, no. 3, pp. 224–238, June 1987.

    Google Scholar 

  9. J. Canny,The Complexity of Robot Motion Planning MIT Press: Cambridge, MA, 1988. Also Ph.D. Thesis, Massachusetts Institute of Technology, 1987.

    Google Scholar 

  10. B.R. Donald, “A search algorithm for motion planning with six degrees of freedom,”Artif. Intell. vol. 31, no. 3, pp. 295–353, March 1987.

    Google Scholar 

  11. J. Canny, “Collision detection for moving polyhedra,”IEEE Trans. Pattern Anal. Mach. Intell. vol. PAMI-8, no. 2, pp. 200–209, March 1986.

    Google Scholar 

  12. T. Horsch and H. Nolzen, “Local motion planning avoiding obstacles with dual quaternions,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, May 1992, pp. 241–245.

  13. S. Cameron, “Efficient intersection tests for objects defined constructively,”Intl. J. Robot. Res. vol. 8, pp. 3–25, February 1989.

    Google Scholar 

  14. S. Cameron, “Collision detection by four-dimensional intersection testing,”IEEE Trans. Robot. Autom. vol. 6, no. 3, pp. 291–302, June 1990.

    Google Scholar 

  15. D. Zhu and J.C. Latombe, “New heuristic algorithms for efficient hierarchical path planning,”IEEE Trans. Robot. Autom. vol. 7, no. 1, pp. 9–20, February 1991.

    Google Scholar 

  16. B. Faverjon and P. Tournassoud, “A practical approach to motion-planning for manipulators with many degrees of freedom,” INRIA, Rapport de Recherche No. 951, December 1988.

  17. P.E. Dupont,Collision-Free Path Planning for Kinematically Redundant Robots, Ph.D. thesis, Mechanical Engineering Department, Rensselaer Polytechnic Institute, 1988.

  18. V. Hayward, “Fast collision detection scheme by recursive decomposition of a manipulator workspace,” inProc. IEEE Int. Conf. Robot. Autom., San Francisco, CA, 1986, pp. 1044–1049.

  19. S. Abramowski, “Collision avoidance for nonrigid objects,” inProc. Int. Workshop Computational Geometry March, 1988. Also inComputational Geometry and its Applications edited by H. Noltemeier, Springer-Verlag: Berlin, pp. 168–179, 1988.

    Google Scholar 

  20. S.K. Singh,Motion Planning with Obstacles and Dynamic Constraints, Ph.D. thesis, Cornell University, January 1988.

  21. B.K. Thakur,Automatic Path-Planning of Industrial Robots, Ph.D. thesis, Rensselaer Polytechnic Institute, August 1986.

  22. C. Bajaj and M.S. Kim, “Generation of configuration space obstacles: The case of a moving sphere,”IEEE J. Robot. Autom. vol. 4, no. 1, pp. 94–99, February 1988.

    Google Scholar 

  23. S. Chen, “A spherical model for navigation and spatial reasoning,” inProc. IEEE Int. Conf. Robot. Autom., Cincinnati, OH, 1990, pp. 776–781.

  24. C. O'Dúnlaing and C.K. Yap, “A “retraction” method for planning the motion of a disc,”J. Algorithms vol. 6, pp. 104–111, 1985.

    Google Scholar 

  25. J. Schwartz and M. Sharir, “On the piano movers' problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers,”Intl. J. Robot. Res. vol. 2, no. 3, p. 46–75, 1983.

    Google Scholar 

  26. P. Spirakis and C. Yap, “Strong NP-hardness of moving many discs,”Inform. Processing Lett. vol. 19, pp. 55–59, 1984.

    Google Scholar 

  27. C.K. Yap, “Coordinating the motion of several discs,” New York University, Courant Institute of Mathematical Sciences, Technical Report No. 105, February 1984.

  28. S. Kambhampati and L.S. Davis, “Multiresolution path planning for mobile robots,”IEEE J. Robot. Autom. vol. RA-2, no. 3, pp. 135–145, September 1986.

    Google Scholar 

  29. H.P. Moravec, “Rover visual obstacle avoidance,” inProc. 7th Int. Joint Conf. Artif. Intell., Vancouver, British Columbia, Canada, 1981, pp. 785–790.

  30. C.E. Thorpe, “Path relaxation: Path planning for a mobile robot,” Carnegie-Mellon University, Robotics Institute, Technical Report CMU-RI-TR-84-5, April 1984.

  31. Y. Ichikawa and N. Ozaki, “autonomous mobile robot,”J. Robot. Syst. vol. 2, no. 1, pp. 135–144, 1985.

    Google Scholar 

  32. G.J. Hamlin, R.B. Kelley, and J. Tornero, “Efficient distance calculation using the spherically-extended polytope (S-tope) model,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, 1992, pp. 2502–2507.

  33. P. Pignon, T. Hasegawa, and J.P. Laumond, “Basic algorithms for space structuring in path planning for mobile robots,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, 1992, pp. 2495–2500.

  34. J.D. Boissonnat, O. Devillers, L. Donati, and F.P. Preparata, “Motion planning for spider robots,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, 1992, pp. 2321–2326.

  35. G. Guo, W.A. Gruver, and K. Jin, “Grasp planning for multifingered robot hands,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, 1992, pp. 2284–2289.

  36. J. O'Rourke and N. Badler, “Decomposition of three-dimensional objects into spheres,”Trans. Pattern Anal. Machine Intel. vol. PAMI-1, no. 3, pp. 295–305, July 1979.

    Google Scholar 

  37. N.I. Badler, J. O'Rourke, and H. Toltzis, “A spherical representation of a human body for visualizing movement,” inProc. IEEE vol. 67, no. 10, pp. 1397–1403, October 1979.

    Google Scholar 

  38. S. Bonner and R.B. Kelley, “A novel representation for planning 3-D collision-free paths,”IEEE Trans. Syst. Man Cybernet. vol. 20, no. 6, pp. 1337–1351, November/December 1990.

    Google Scholar 

  39. A. de Pennington, M.S. Bloor, and M. Balila, “Geometric modelling: A contribution towards intelligent robots,” inProc. 13th Int. Symp. on Ind. Robots, Chicago, April 1983, pp. 7.35–7.54.

  40. D.M. Esterling and J. Van Rosendale, “An intersection algorithm for moving parts,” inProc. NASA Symp. Computer-Aided Geometry Modeling, Hampton, VA, April 1983, pp. 119–123.

  41. A.P. del Pobil and M.A. Serna, “Solving the find-path problem in 3D by a simple object model,” inProc. Euro. Conf. Artif. Intell., Vienna, Austria, August 1992, pp. 656–660.

  42. A.P. del Pobil and M.A. Serna, “3D motion planning based on a spherical hierarchical representation,”Proc. IV Int. Symp. Artif. Intell., Cancún, Mexico, November 1991, pp. 91–97.

  43. A.P. del Pobil, M.A. Serna, and J. Llovet, “A new reprepresentation for collision avoidance and detection,” inProc. IEEE Int. Conf. Robot. Autom., Nice, France, May 1992, pp. 246–251.

  44. J.E. Hopcroft, J.E. Schwartz, and M. Sharir, “Efficient detection of intersections among spheres,”Int. J. Robot. Res. vol. 2, no. 4, pp. 77–80, 1983.

    Google Scholar 

  45. S. Cameron, “A study of the clash detection problem in robotics,” inProc. IEEE Int. Conf. Robot. Autom., St. Louis, MO, 1985, pp. 488–493.

  46. T. Lozano-Pérez, “Spatial planning: A configuration space approach,”IEEE Trans. Computers vol. C-32, no. 2, pp. 108–120, February 1983.

    Google Scholar 

  47. D. Leven and M. Sharir, “Intersection and proximity problems and Voronoi diagrams,” inAdvances in Robotics (Vol. I): Algorithmic and Geometric Aspects of Robotics edited by J.T. Schwartz and C.K. Yap, Lawrence Erlbaum, Hillsdale, NJ, pp. 187–228, 1987.

    Google Scholar 

  48. J.E. Bobrow, “A direct minimization approach for obtaining the distance between convex polyhedra,”Intl. J. Robot. Res. vol. 8, no. 3, pp. 65–76, June 1989.

    Google Scholar 

  49. E.G. Gilbert and C.P. Foo, “Computing the distance between general convex objects in three-dimensional space,”IEEE Trans. Robot. Autom. vol. RA-6, pp. 53–61, February 1990.

    Google Scholar 

  50. V. Milenkovic, and B. Huang, “Kinematics of major robot linkage,” inProc. 13th Int. Symp. Ind. Robots, Chicago, April 1983, pp. 16.31–16.47.

  51. J. Schwartz and M. Sharir, “A survey of motion planning and related geometric algorithms,”Artif. Intell. vol. 37, pp. 157–169, 1988.

    Google Scholar 

  52. C. Widdoes, “A heuristic collision avoider for the Stanford robot arm,” Stanford C.S. Memo 227, June 1974.

  53. R.P. Paul,Robot Manipulators: Mathematics, Programming and Control MIT Press: Cambridge, MA, 1981.

    Google Scholar 

  54. J. García de Jalón, J. Unda, and A. Avello, “Natural coordinates for the computer analysis of three-dimensional multibody systems,”Computer Meth. Appl. Mech. Eng. vol. 56, no. 3, pp. 309–327, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Jaume 1 University, Penyeta Roja Campus, E-12071, Castelló, Spain

    Angel P. Del Pobil

  2. Faculty of Engineering, University of Navarra, Paseo Manuel de Lardizabal, 13, E-20009, San Sebastián, Spain

    Miguel A. Serna

Authors
  1. Angel P. Del Pobil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel A. Serna
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Del Pobil, A.P., Serna, M.A. A simple algorithm for intelligent manipulator collision-free motion. Appl Intell 4, 83–102 (1994). https://doi.org/10.1007/BF00872057

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation