View in EDS

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

Saved in:
Bibliographic Details
Title: Multi-objective unmanned vehicle path planning based on whale optimization algorithm.
Authors: Zong, Xinlu, Xia, Xue, Chen, Zexi
Source: International Journal of Modern Physics C: Computational Physics & Physical Computation; Sep2025, Vol. 36 Issue 9, p1-24, 24p
Subject Terms: METAHEURISTIC algorithms, MULTI-objective optimization, AUTONOMOUS vehicles, ALGORITHMS, CURVATURE, POTENTIAL field method (Robotics), MOBILE robots
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. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Modern Physics C: Computational Physics & Physical Computation is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
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. [ABSTRACT FROM AUTHOR]
ISSN:01291831
DOI:10.1142/S0129183125500056