Parallel-populations genetic algorithm for the optimization of cubic polynomial joint trajectories for industrial robots

Fares J. Abu-Dakka, Iyad F. Assad, Francisco Valero, Vicente Mata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper a parallel-populations genetic algorithm procedure is presented for the obtainment of minimum-time trajectories for industrial robots. This algorithm is fed in first place by a sequence of configurations then cubic spline functions are used for the construction of joint trajectories for industrial robots. The algorithm is subjected to two types of constraints: (1) Physical constraints on joint velocities, accelerations, and jerk. (2) Dynamic constraints on torque, power, and energy. Comparison examples are used to evaluate the method with different combinations of crossover and mutation.

Original languageEnglish (US)
Title of host publicationIntelligent Robotics and Applications - 4th International Conference, ICIRA 2011, Proceedings
Pages83-92
Number of pages10
EditionPART 1
DOIs
StatePublished - 2011
Event4th International Conference on Intelligent Robotics and Applications, ICIRA 2011 - Aachen, Germany
Duration: Dec 6 2011Dec 8 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7101 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Intelligent Robotics and Applications, ICIRA 2011
Country/TerritoryGermany
CityAachen
Period12/6/1112/8/11

Keywords

  • Genetic algorithm
  • Industrial robots
  • Obstacle avoidance
  • Trajectory planning

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Parallel-populations genetic algorithm for the optimization of cubic polynomial joint trajectories for industrial robots'. Together they form a unique fingerprint.

Cite this