Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-25T17:28:37.498Z Has data issue: false hasContentIssue false
  • English
  • Français

Generation of adjacent configurations for a collision-free path planning of manipulators

Published online by Cambridge University Press:  09 March 2009

Marco Ceccarelli ,
Francisco Valero ,
Vicente Mata  and
Ignacio Cuadrado†
Marco Ceccarelli
Affiliation:
Dept. of Industrial Engineering. University of Cassino. Via Zamosch 43–03043CASSINO (FR) (Italy).
Francisco Valero
Affiliation:
Dept. of Mechanical Engineering. Technical University of Valencia. Camino de Vera s/n-46022 VALENCIA (Spain).
Vicente Mata
Affiliation:
Dept. of Mechanical Engineering. Technical University of Valencia. Camino de Vera s/n-46022 VALENCIA (Spain).
Ignacio Cuadrado†
Affiliation:
Dept. of Mechanical Engineering. Technical University of Valencia. Camino de Vera s/n-46022 VALENCIA (Spain).
Get access Rights & Permissions [Opens in a new window]

Summary

In this paper an algorithm is proposed for the problem of path planning of redundant manipulators among obstacles by using a suitable formulation for robot configurations and path strategy. In particular robotic manipulators have been modelled by using reference points on the kinematic chain and their Cartesian coordinates description. The path planning has been formulated as an optimization problem for the determination of adjacent configurations and the path among obstacles with minimum manipulator displacement. The fully Cartesian coordinates description has been useful for the economy of the numerical procedure and for the constraints formulation of link interference and obstacles avoidance constraints. Some examples are reported which prove the practical feasibility of the path planning procedure, and the numerical results have been tested as applicable to industrial robots through easy programming because of the concept of adjacent configurations.

Keywords

Robot kinematicsRedundant manipulatorsObstacle avoidancePath planning
Type
Article
Information
Robotica , Volume 14 , Issue 4 , July 1996 , pp. 391 - 396
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Tournassoud, P.. Geometrie et Intelligence Artificielle pour les Robots (Hermes. Paris. 1988).Google Scholar
2.Valero, F.. “Plantificacion de Trayectorias Libres de Obstaculos para un Manipulador Piano”Ph.D. Dissertation (Technical University of Valencia. 1990).Google Scholar
3.Mata, V. & Valero, F.. “Algorithms for Robot Path Planning Among Obstacles”Proc. of 23rd Int. Symposium on Industrial Robots.Barcelona (1992) pp. 743–747.Google Scholar
4.Valero, F.. Cuadrado, J.I.. Mata, V. & Ceccarelli, M.. “Collision-Avoidance Robot Path Planning Using Fully Cartesian Coordinates” Advances in Robot Kinematics and Computational Geometry (Lenarcic, J. and Ravani, B. Editors) (Kluwer. Dordrecht. 1994) pp. 485–494.Google Scholar
5.Garcia de Jalòn, J. & Bayo, E.. Kinematic and Dynamic Simulation of Multibody: The Real Time Challenge (Springer Verlag. Berlin. 1994).Google Scholar
6.Gould, R.. Graph Theory (Benjamin Cumminas. Menlo Park. 1988) pp. 37–40.Google Scholar
7.Schittkowski, K.. “NLPQL: A FORTRAN Subroutine Solving Constrained Nonlinear Programming Problems” Annals of Operations Research, 485–500 (1986).CrossRefGoogle Scholar
8.ISML. Math Library: User's Manual vers.1.1 (ISML. Houston. 1989).Google Scholar
9. Unimate. Industrial Robot Programming Manual User's Guide to VAL-II Vers.2.0 (1986).Google Scholar