Multi-strategy ensemble wind driven optimization algorithm for robot path planning

In this study, a multi-strategy ensemble wind driven optimization (MEWDO) algorithm is proposed and combined with cubic spline interpolation to solve path planning challenges for single and multiple robots. The proposed MEWDO uses a Chebyshev map to initialize air particle populations and increase p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematics and computers in simulation Ročník 231; s. 144 - 159
Hlavní autori: Zhang, Chao, Yang, Yi, Chen, Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.05.2025
Predmet:
Chebyshev map
Cubic spline interpolation
F-distribution
Robot path planning
Segmented learning
Wind driven optimization
Robot path planning
Segmented learning
Chebyshev map
Wind driven optimization
Cubic spline interpolation
F-distribution
ISSN:0378-4754
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this study, a multi-strategy ensemble wind driven optimization (MEWDO) algorithm is proposed and combined with cubic spline interpolation to solve path planning challenges for single and multiple robots. The proposed MEWDO uses a Chebyshev map to initialize air particle populations and increase population diversity. A segmented learning local exploitation strategy is proposed to upgrade the exploitation ability of the algorithm. To enhance the exploration ability of the algorithm, a mutation strategy is introduced that disturbs dimensions one by one, based on the F-distribution with asymmetric characteristics. First, performance comparison experiments were conducted between MEWDO and seven other intelligent algorithms on 16 benchmark test functions. The results showed that MEWDO performed the best. Second, path planning simulation experiments were conducted in three static environments to compare MEWDO with three intelligent algorithms and the artificial potential field method, and MEWDO outperformed the comparison algorithms in terms of the planned shortest path and algorithm stability. In some complex rescue environments, multiple robots are frequently sent to perform tasks from different routes to improve the rescue success rate. For this purpose, MEWDO was used to plan task paths for five robots to test its performance in multi-robot path planning. The results showed that MEWDO finds the best route for all five robots to perform the task in a complex environment. •A MEWDO algorithm that utilizes Chebyshev map, segmented learning, and F-distribution is being proposed to enhance multi-local extremum solving.•The problem of robot path planning can be solved using MEWDO and cubic spline interpolation.•MEWDO is able to effectively plan reasonable rescue routes for multi-robot co-execution of rescue tasks in complex environments, as evidenced by experiments.
ISSN:0378-4754
DOI:10.1016/j.matcom.2024.11.023