Path Planning for Manipulator Based on Optimized Particle Swarm Algorithm
To solve the problems of premature convergence and easy to fall into local optimality search of traditional particle swarm algorithm (PSO) in robotic arm path planning. In this paper, Gaussian perturbation and natural selection strategy are introduced, and an adaptive inertia weight is constructed to improve the convergence speed and global search ability of the particle swarm algorithm as well as the ability to jump out of the local optimum, and also to make it more adaptable to the complex working environment. The effectiveness of the algorithm is verified by using MATLAB to establish a simulation model of the robotic arm. Under the same experimental conditions, compared with the traditional particle swarm algorithm, the optimized algorithm achieves significant improvement in convergence speed, convergence accuracy and global search ability, which provides strong support for the research and practical application in the field of robotic arm path planning.
Authors
- Shanshan Xu
- Petar B. Petrović (ORCID: https://orcid.org/0000-0002-5375-600X)
- Huanhuan Cui (ORCID: https://orcid.org/0000-0003-4616-0563)
- Aleksandar Rodić (ORCID: https://orcid.org/0000-0002-5595-9724)
- Weijing Wang
- Haiyan Wang (ORCID: https://orcid.org/0000-0002-4906-8845)
- Xiangrong Xu (ORCID: https://orcid.org/0000-0001-6055-6797)
- Haining Miao
Institutions
- University of Belgrade (RS)
- Anhui University of Technology (CN)
Publication Details
- Published
- 2024-12-10
- DOI
- https://doi.org/10.1109/robio64047.2024.10907351
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00