Unmanned Container Truck Path Planning Based on the Fusion of White Shark Optimizer and Genetic Algorithm

This paper proposes an improved White Shark Optimizer (WSO) algorithm to address the issues of insufficient local search accuracy and susceptibility to local optima in the path planning process of unmanned container trucks. The initial feasible path solution, obtained through ant colony routing, is used as the initial shark population. To enhance the convergence speed during the iterative process, crossover and mutation operations from the genetic algorithm are introduced for selection and fusion. A stepwise local search is employed to improve the local search of the optimal solution, and a deletion process is added to reduce path redundancy. Simulation results show that the improved WSO algorithm converges and iterates faster in path planning on the grid map and is less prone to falling into local optima.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1109/eiecs63941.2024.10800524
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

Unmanned Container Truck Path Planning Based on the Fusion of White Shark Optimizer and Genetic Algorithm

Fuchun Sun, Xiaoshuai Wang, Rongbao Gong
Robotic Path Planning Algorithms
article

Unmanned Container Truck Path Planning Based on the Fusion of White Shark Optimizer and Genetic Algorithm

Fuchun Sun, Xiaoshuai Wang, Rongbao Gong
article en

Abstract

This paper proposes an improved White Shark Optimizer (WSO) algorithm to address the issues of insufficient local search accuracy and susceptibility to local optima in the path planning process of unmanned container trucks. The initial feasible path solution, obtained through ant colony routing, is used as the initial shark population. To enhance the convergence speed during the iterative process, crossover and mutation operations from the genetic algorithm are introduced for selection and fusion. A stepwise local search is employed to improve the local search of the optimal solution, and a deletion process is added to reduce path redundancy. Simulation results show that the improved WSO algorithm converges and iterates faster in path planning on the grid map and is less prone to falling into local optima.

Shandong Jiaotong University (CN)
Openalex Percentile: Top 76%
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.