Integrated multi-strategy sand cat swarm optimization for path planning applications

An integrated multi-strategy sand cat swarm optimization algorithm is proposed to address the shortcomings of the sand cat swarm algorithm, such as inefficient solutions, insufficient optimization accuracy, and a tendency to fall into local optimal solutions. The algorithm introduces an improved circle chaotic mapping to balance the population distribution, water wave dynamic convergence factor to maintain population diversity, and a lens opposition-based learning to enhance the global optimization capability. Additionally, the golden sine strategy is incorporated to improve the local search ability. Experiments on 23 test functions demonstrate the new algorithm's optimal average performance on 18 of them. It was further applied to 9 2D path planning instances and 2 3D path planning instances, all of which were able to find the shortest path. The results show that the improved algorithm is less prone to local optimization, exhibits high stability, and can effectively solve path planning problems.

Authors

Publication Details

Journal
Intelligent Systems with Applications
Published
2025-01-27
DOI
https://doi.org/10.1016/j.iswa.2025.200486
Citations
4
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
5.10

Funders

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

Integrated multi-strategy sand cat swarm optimization for path planning applications

Yourui Huang, Hongping Song, Tingting Li, Tao Han et al.
4 citations
Intelligent Systems with Applications
Robotic Path Planning Algorithms
5.10
article

Integrated multi-strategy sand cat swarm optimization for path planning applications

Yourui Huang, Hongping Song, Tingting Li, Tao Han, Quanzeng Liu
article en
4 citations

Abstract

An integrated multi-strategy sand cat swarm optimization algorithm is proposed to address the shortcomings of the sand cat swarm algorithm, such as inefficient solutions, insufficient optimization accuracy, and a tendency to fall into local optimal solutions. The algorithm introduces an improved circle chaotic mapping to balance the population distribution, water wave dynamic convergence factor to maintain population diversity, and a lens opposition-based learning to enhance the global optimization capability. Additionally, the golden sine strategy is incorporated to improve the local search ability. Experiments on 23 test functions demonstrate the new algorithm's optimal average performance on 18 of them. It was further applied to 9 2D path planning instances and 2 3D path planning instances, all of which were able to find the shortest path. The results show that the improved algorithm is less prone to local optimization, exhibits high stability, and can effectively solve path planning problems.

Intelligent Systems with ApplicationsVol. 25
Anhui University of Science and Technology, Collaborative Innovation Project of Colleges and Universities of Anhui Province
Sustainable cities and communities
Openalex Percentile: Top 5%
Robotic Path Planning Algorithms
5.10
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.