Online Time-Optimal Trajectory Planning for Robotic Manipulators Using Adaptive Elite Genetic Algorithm with Singularity Avoidance

42Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a new method of online planning high smooth and time-optimal trajectory for robotic manipulators that applies an adaptive elite genetic algorithm with singularity avoidance (AEGA-SA) is presented. The strategy is designed as a combination of the time-optimal trajectory planning with quintic polynomial in Cartesian space. For improving optimization performance, elitist group and adaptive adjustment mechanisms are used based on genetic algorithm (GA) framework. In the meantime, GA is combined with singularity avoidance mechanism to avoid the singularities appearing in the trajectory, improves the recognition capability of optimum solution. Experimental results show that, the proposed approach is more effective and better performance than the original GA and its variants, with ensuring a both smooth and efficiency performance for the robotic manipulators.

Cite

CITATION STYLE

APA

Liu, Y., Guo, C., & Weng, Y. (2019). Online Time-Optimal Trajectory Planning for Robotic Manipulators Using Adaptive Elite Genetic Algorithm with Singularity Avoidance. IEEE Access, 7, 146301–146308. https://doi.org/10.1109/ACCESS.2019.2945824

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free