3D Spatial Path Planning Based on Improved Particle Swarm Optimization

Three-dimensional path planning is critical for the successful operation of unmanned aerial vehicles (UAVs), automated guided vehicles (AGVs), and robots in industrial Internet of Things (IIoT) applications. In 3D path planning, the standard Particle Swarm Optimization (PSO) algorithm suffers from premature convergence and a tendency to fall into local optima, leading to significant deviations from the optimal path. This paper proposes an improved PSO (IPSO) algorithm that enhances particle diversity and randomness through the introduction of logistic chaotic mapping, while employing dynamic learning factors and nonlinear inertia weights to improve global search capability. Experimental results demonstrate that IPSO outperforms traditional methods in terms of path length and computational efficiency, showing potential for real-time path planning in complex environments.

Authors

Institutions

Publication Details

Journal
Future Internet
Published
2025-09-05
DOI
https://doi.org/10.3390/fi17090406
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.55

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

3D Spatial Path Planning Based on Improved Particle Swarm Optimization

Zi-Xu Yang, Ming Chen, Junxia Ma
2 citations
Future Internet
Robotic Path Planning Algorithms
2.55
article

3D Spatial Path Planning Based on Improved Particle Swarm Optimization

Zi-Xu Yang, Ming Chen, Junxia Ma
article en
2 citations

Abstract

Three-dimensional path planning is critical for the successful operation of unmanned aerial vehicles (UAVs), automated guided vehicles (AGVs), and robots in industrial Internet of Things (IIoT) applications. In 3D path planning, the standard Particle Swarm Optimization (PSO) algorithm suffers from premature convergence and a tendency to fall into local optima, leading to significant deviations from the optimal path. This paper proposes an improved PSO (IPSO) algorithm that enhances particle diversity and randomness through the introduction of logistic chaotic mapping, while employing dynamic learning factors and nonlinear inertia weights to improve global search capability. Experimental results demonstrate that IPSO outperforms traditional methods in terms of path length and computational efficiency, showing potential for real-time path planning in complex environments.

Future InternetVol. 17(9)
Hefei University of Technology (CN), Zhengzhou University of Light Industry (CN), Tongling University (CN)
Tongling University
Openalex Percentile: Top 9%
Robotic Path Planning Algorithms
2.55
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.