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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Path Planning for Manipulator Based on Optimized Particle Swarm Algorithm

Shanshan Xu, Petar B. Petrović, Huanhuan Cui, Aleksandar Rodić et al.
Robotic Path Planning Algorithms
article

Path Planning for Manipulator Based on Optimized Particle Swarm Algorithm

Shanshan Xu, Petar B. Petrović, Huanhuan Cui, Aleksandar Rodić, Weijing Wang, Haiyan Wang, Xiangrong Xu, Haining Miao
article en

Abstract

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.

University of Belgrade (RS), Anhui University of Technology (CN)
Openalex Percentile: Top 72%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.