Evolutionary indirect approach to solving trajectory planning problem for industrial robots operating in workspaces with obstacles

Fares J. Abu-Dakka; Francisco Rubio; Francisco Valero; Vicente Mata

doi:10.1016/j.euromechsol.2013.05.007

Evolutionary indirect approach to solving trajectory planning problem for industrial robots operating in workspaces with obstacles

Fares J. Abu-Dakka, Francisco Rubio, Francisco Valero, Vicente Mata

Mechanical Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, an indirect method for trajectory planning for industrial robots has been addressed using an evolutionary algorithm. The algorithm is divided into three stages: (1) The acquisition of Adjacent Configurations (AC) for Path Planning subjected to kinematics, geometric and obstacle avoidance constraints. (2) The acquisition of a collision-free path between initial and goal robot configurations. This path consists of a set of ACs, and (3) The acquisition of a temporal history of the evolution for the robot joint coordinates, by minimizing the required time subjected to actuator limits. This algorithm has been evaluated by comparing the results with the direct procedures proposed by Rubio articles in 2009 and 2010.

Original language	English (US)
Pages (from-to)	210-218
Number of pages	9
Journal	European Journal of Mechanics, A/Solids
Volume	42
DOIs	https://doi.org/10.1016/j.euromechsol.2013.05.007
State	Published - 2013

Keywords

Genetic algorithms
Obstacle avoidance
Trajectory planning

ASJC Scopus subject areas

General Materials Science
Mechanics of Materials
Mechanical Engineering
General Physics and Astronomy

Access to Document

10.1016/j.euromechsol.2013.05.007

Cite this

@article{4045d5f0e8c244569089205164781dff,

title = "Evolutionary indirect approach to solving trajectory planning problem for industrial robots operating in workspaces with obstacles",

abstract = "In this paper, an indirect method for trajectory planning for industrial robots has been addressed using an evolutionary algorithm. The algorithm is divided into three stages: (1) The acquisition of Adjacent Configurations (AC) for Path Planning subjected to kinematics, geometric and obstacle avoidance constraints. (2) The acquisition of a collision-free path between initial and goal robot configurations. This path consists of a set of ACs, and (3) The acquisition of a temporal history of the evolution for the robot joint coordinates, by minimizing the required time subjected to actuator limits. This algorithm has been evaluated by comparing the results with the direct procedures proposed by Rubio articles in 2009 and 2010.",

keywords = "Genetic algorithms, Obstacle avoidance, Trajectory planning",

author = "Abu-Dakka, {Fares J.} and Francisco Rubio and Francisco Valero and Vicente Mata",

year = "2013",

doi = "10.1016/j.euromechsol.2013.05.007",

language = "English (US)",

volume = "42",

pages = "210--218",

journal = "European Journal of Mechanics, A/Solids",

issn = "0997-7538",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Evolutionary indirect approach to solving trajectory planning problem for industrial robots operating in workspaces with obstacles

AU - Abu-Dakka, Fares J.

AU - Rubio, Francisco

AU - Valero, Francisco

AU - Mata, Vicente

PY - 2013

Y1 - 2013

N2 - In this paper, an indirect method for trajectory planning for industrial robots has been addressed using an evolutionary algorithm. The algorithm is divided into three stages: (1) The acquisition of Adjacent Configurations (AC) for Path Planning subjected to kinematics, geometric and obstacle avoidance constraints. (2) The acquisition of a collision-free path between initial and goal robot configurations. This path consists of a set of ACs, and (3) The acquisition of a temporal history of the evolution for the robot joint coordinates, by minimizing the required time subjected to actuator limits. This algorithm has been evaluated by comparing the results with the direct procedures proposed by Rubio articles in 2009 and 2010.

AB - In this paper, an indirect method for trajectory planning for industrial robots has been addressed using an evolutionary algorithm. The algorithm is divided into three stages: (1) The acquisition of Adjacent Configurations (AC) for Path Planning subjected to kinematics, geometric and obstacle avoidance constraints. (2) The acquisition of a collision-free path between initial and goal robot configurations. This path consists of a set of ACs, and (3) The acquisition of a temporal history of the evolution for the robot joint coordinates, by minimizing the required time subjected to actuator limits. This algorithm has been evaluated by comparing the results with the direct procedures proposed by Rubio articles in 2009 and 2010.

KW - Genetic algorithms

KW - Obstacle avoidance

KW - Trajectory planning

UR - http://www.scopus.com/inward/record.url?scp=84880336750&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880336750&partnerID=8YFLogxK

U2 - 10.1016/j.euromechsol.2013.05.007

DO - 10.1016/j.euromechsol.2013.05.007

M3 - Article

AN - SCOPUS:84880336750

SN - 0997-7538

VL - 42

SP - 210

EP - 218

JO - European Journal of Mechanics, A/Solids

JF - European Journal of Mechanics, A/Solids

ER -

Evolutionary indirect approach to solving trajectory planning problem for industrial robots operating in workspaces with obstacles

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this