Optimal Trajectory Planning for Manipulators with Efficiency and Smoothness Constraint

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Path planning to generate an appropriate time sequence of positions for a complex trajectory is an open challenge in robotics. This paper proposes an optimization method with the integration of an improved ant colony algorithm and a high-order spline interpolation technique. The optimization process can be modelled as the travelling salesman problem. The greatest features of this method include: (1) automatic generation for complex trajectory and a new idea of selecting the nearest start point instead of using the traditional way of human operation; (2) an optimized motion sequence of the manipulator with the shortest length of the free-load path improves efficiency by nearly 65% and (3) trajectories both in Cartesian space and joint space are interpolated with good smoothness to reduce shocks and vibrations. Simulations and experiments are conducted to demonstrate the good properties of this method.

Cite

CITATION STYLE

APA

Xu, Z., Wang, W., Chi, Y., Li, K., & He, L. (2023). Optimal Trajectory Planning for Manipulators with Efficiency and Smoothness Constraint. Electronics (Switzerland), 12(13). https://doi.org/10.3390/electronics12132928

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