Multi-objective unmanned vehicle path planning based on whale optimization algorithm

Path planning is an important part of the research field of mobile robots. How to plan more suitable paths more quickly has become a challenging optimization problem that requires consideration of several constraints and performance metrics. Given the multitude of optimization objectives and the intricate nature of addressing the static path planning problem, it is usually converted into a single-objective optimization problem. However, this approach would lead to the algorithm being unable to thoroughly explore the solution space. To address this problem, a nondominated sorting whale optimization algorithm based on crowding degree and memory (NSWOACDM) is presented and applied to unmanned vehicle path planning in this paper. Both the length and curvature of path are optimized simultaneously. Experimental results on benchmark functions show that the proposed algorithm is more effective compared with other traditional multi-objective algorithms. The effects of different control points on the optimization results are analyzed through path planning experiments. The experimental results demonstrate that the NSWOACDM algorithm exhibits superior performance in comparison to similar algorithms. Furthermore, it is capable of identifying several viable paths within a reduced timeframe in the context of the multi-objective path planning issue.

Authors

Institutions

Publication Details

Journal
International Journal of Modern Physics C
Published
2024-10-25
DOI
https://doi.org/10.1142/s0129183125500056
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-objective unmanned vehicle path planning based on whale optimization algorithm

Xinlu Zong, Zexi Chen, Xue Xia
1 citations
International Journal of Modern Physics C
Robotic Path Planning Algorithms
0.25
article

Multi-objective unmanned vehicle path planning based on whale optimization algorithm

Xinlu Zong, Zexi Chen, Xue Xia
article en
1 citations

Abstract

Path planning is an important part of the research field of mobile robots. How to plan more suitable paths more quickly has become a challenging optimization problem that requires consideration of several constraints and performance metrics. Given the multitude of optimization objectives and the intricate nature of addressing the static path planning problem, it is usually converted into a single-objective optimization problem. However, this approach would lead to the algorithm being unable to thoroughly explore the solution space. To address this problem, a nondominated sorting whale optimization algorithm based on crowding degree and memory (NSWOACDM) is presented and applied to unmanned vehicle path planning in this paper. Both the length and curvature of path are optimized simultaneously. Experimental results on benchmark functions show that the proposed algorithm is more effective compared with other traditional multi-objective algorithms. The effects of different control points on the optimization results are analyzed through path planning experiments. The experimental results demonstrate that the NSWOACDM algorithm exhibits superior performance in comparison to similar algorithms. Furthermore, it is capable of identifying several viable paths within a reduced timeframe in the context of the multi-objective path planning issue.

International Journal of Modern Physics CVol. 36(09)
Wuhan University of Technology (CN), Hubei University of Technology (CN), Hubei University (CN), Wuhan Institute of Technology (CN)
Openalex Percentile: Top 46%
Robotic Path Planning Algorithms
0.25
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.