Evolutionary optimization of cubic polynomial joint trajectories for industrial robots

Kai Ming Tse*, Chi-Hsu Wang

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations

Abstract

The conventional approach to find the constrained minimum-time path for a robot manipulator employs the trial-and-error procedure, namely the flexible polyhedron search method. In this paper we introduce an alternative approach by applying the genetic search algorithms to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subjected to the physical constraints on joint velocities, accelerations, and jerks. Modified heuristic crossover and a scaled and normed performance measure are applied to the genetic algorithmic searching procedures. Experiments with different combinations of crossover rates and mutation rates are carried out and the corresponding results outweigh the constrained minimum-time obtained from the trial-and-error polyhedron search method.

Original languageEnglish
Pages (from-to)3272-3276
Number of pages5
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume4
DOIs
StatePublished - 1 Dec 1998
EventProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA
Duration: 11 Oct 199814 Oct 1998

Fingerprint Dive into the research topics of 'Evolutionary optimization of cubic polynomial joint trajectories for industrial robots'. Together they form a unique fingerprint.

Cite this