A new trajectory-planning beetle swarm optimization algorithm for trajectory planning of robot manipulators

40Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Based on a heuristic optimization algorithm, this paper proposes a new algorithm named trajectory-planning beetle swarm optimization (TPBSO) algorithm for solving trajectory planning of robots, especially robot manipulators. Firstly, two specific manipulator trajectory planning problems are presented as the practical application of the algorithm, which are point-to-point planning and fixed-geometric-path planning. Then, in order to verify the effectiveness of the algorithm, this paper develops a control model and conducts numerical experiments on two planning tasks. Moreover, it compares with existing algorithms to show the superiority of our proposed algorithm. Finally, the results of numerical comparisons show that algorithm has a relatively faster computational speed and better control performance without increasing computational complexity.

Cite

CITATION STYLE

APA

Wang, L., Wu, Q., Lin, F., Li, S., & Chen, D. (2019). A new trajectory-planning beetle swarm optimization algorithm for trajectory planning of robot manipulators. IEEE Access, 7, 154331–154345. https://doi.org/10.1109/ACCESS.2019.2949271

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