Repositorio de producción científica de la Universidad de Sevilla

An Evolutionary and Local Search Algorithm for Motion Planning of Two Manipulators

 

Advanced Search
 
Opened Access An Evolutionary and Local Search Algorithm for Motion Planning of Two Manipulators
Cites

Show item statistics
Icon
Export to
Author: Ridao Carlini, Miguel Ángel
Camacho, Eduardo F.
Riquelme Santos, José Cristóbal
Toro Bonilla, Miguel
Department: Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos
Universidad de Sevilla. Departamento de Ingeniería de Sistemas y Automática
Date: 2001
Published in: Journal of Robotic Systems, 18 (8), 463-476.
Document type: Article
Abstract: A method for obtaining coordinated motion plans of robot manipulators is presented. A decoupled planning approach has been used; that is, the problem has been decomposed into two subproblems: path planning, where a collision-free path is found for each robot independently only considering fixed obstacles, and trajectory planning, where the paths are timed and synchronized to avoid collisions with other robots. This article focuses on the second problem. The proposed plan can easily be implemented by programs written in most industrial robot programming languages. The generated programs minimize the total motion time of the robots along their paths. The method does not require accurate dynamic models of the robots and uses an evolutionary algorithm followed by a local search which produces near optimal solutions with a relatively small computational cost.
Cite: Ridao Carlini, M.Á., Camacho, E.F., Riquelme Santos, J.C. y Toro Bonilla, M. (2001). An Evolutionary and Local Search Algorithm for Motion Planning of Two Manipulators. Journal of Robotic Systems, 18 (8), 463-476.
Size: 331.1Kb
Format: PDF

URI: http://hdl.handle.net/11441/42767

DOI: http://dx.doi.org/10.1002/rob.1037

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)