Advertisement

Romansy 14 pp 231-240 | Cite as

Path Planning Algorithm Among Obstacles by Considering a Manipulability Index

  • Francisco Valero
  • Vicente Mata
  • Francisco Rubio
Part of the International Centre for Mechanical Sciences book series (CISM, volume 438)

Abstract

In this paper a path planning algorithm for robots in industrial applications is presented. The algorithm is based on the authors’ previous works, which have been improved by introducing the Manipulability index to calculate the configurations, and in addition the work environment model has also been upgraded. From two given configurations — the initial and final ones — a configuration space is obtained. The robot configurations are expressed in terms of fully Cartesian co-ordinates and are obtained by solving nonlinear optimisation problems between adjacent configurations. A variety of constraints are considered to take into account different real operation problems. The path is selected from a weighted graph associated to the map of feasible robot configurations. A search algorithm has been used to minimise an objective function in order to obtain a sequence of robot configurations between the initial and final ones.

Keywords

Path Planning Configuration Space Industrial Robot Significant Point Final Configuration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angeles, J. (1997). Fundamentals of Robotic Mechanical Systems. Springer-Verlag.Google Scholar
  2. Barraquand, J., and Latombe, J-C. (1991). Robot Motion Planning: A Distributed Representation Approach. International Journal of Robotics Research 10 (6): 628–649.CrossRefGoogle Scholar
  3. Latombe, J-C. (1999). Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artefacts. International Journal of Robotics Research 18 (11): 1119–1128.CrossRefGoogle Scholar
  4. Li, Z.J., and Trabia, M. B. (1996). Adaptative Path Planning and Obstacle Avoidance for a Robot with a Large Degree of Redundancy. Journal of Robotic Systems 13 (3): 163–176.CrossRefMATHGoogle Scholar
  5. Kavraki, L.E., Svestka, P., Latombe, J-C., and Overmans, M. (1996). Probabilistic Roadmaps for Planning in High-Dimensional Configuration Spaces IEEE Transactions on Robotics and Automation 12 (4): 566–580.CrossRefGoogle Scholar
  6. Valero, F., Mata, V., Cuadrado, J.I., and Ceccarelli, M. (1997). A formulation for path planning of manipulators in complex environments by using adjacent configurations. Advanced Robotics 11 (1): 33–56.CrossRefGoogle Scholar
  7. Valero, F., Mata, V., and Ceccarelli, M. (2000). Path planning in complex environments for industrial robots with additional degrees of freedom. Romany 2000Google Scholar
  8. Yoshikawa, T. (1990). Foundations of Robotics: Analysis and Control. The MIT Press.Google Scholar

Copyright information

© Springer-Verlag Wien 2002

Authors and Affiliations

  • Francisco Valero
    • 1
  • Vicente Mata
    • 1
  • Francisco Rubio
    • 1
  1. 1.Department of Mechanical EngineeringUniversidad Politécnica de ValenciaSpain

Personalised recommendations