Optimal trajectory generation in joint space for 6R industrial serial robots using cuckoo search algorithm

In this paper, an optimal trajectory generation approach is proposed based on optimal time, optimal jerk and optimal time-jerk by utilizing the interpolation spline methods. The methods including cubic spline, trigonometric spline and a combination of cubic spline and 7th-order polynomial are used f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Intelligent service robotics 2022-11, Vol.15 (5), p.627-648
Hauptverfasser: Karahan, Oğuzhan, Karci, Hasan, Tangel, Ali
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, an optimal trajectory generation approach is proposed based on optimal time, optimal jerk and optimal time-jerk by utilizing the interpolation spline methods. The methods including cubic spline, trigonometric spline and a combination of cubic spline and 7th-order polynomial are used for generating the trajectory in joint space for robot manipulators. Cuckoo search (CS) optimization algorithm is chosen to optimize the joint trajectories based on three objectives, namely, minimizing total travelling time, minimizing mean jerk and minimizing a weighted sum of the travelling time and the mean jerk along the whole trajectory. The spline methods have been applied on PUMA-robot for optimizing the joint trajectories with the CS algorithm based on each objective. Moreover, results from the proposed algorithm have been compared with that of the algorithms suggested by earlier studies in terms of three objectives. With the trajectory planning methods, the joint velocities, accelerations and jerks along the whole trajectory optimized by CS meet the requirements of the kinematic constraints in case of each objective. Simulation results validated that the used trajectory planning methods based on the proposed algorithm are very effective in comparison with the same methods based on the algorithms proposed by earlier authors.
ISSN:1861-2776
1861-2784
DOI:10.1007/s11370-022-00440-8