Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T23:30:02.006Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  09 March 2009

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).

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.

Information

Type
Article
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.)

Article purchase

Temporarily unavailable