Path Planning of Multi-Mobile Robot Based on Multistrategy Fusion Improved Sine-Cosine Algorithm

In this paper, an innovative multi-strategy fusion improved sine-cosine algorithm is proposed for multi-mobile robots moving in indoor environments with multiple obstacles. First, the optimization method of the good point set is introduced to improve the diversity of the initial population distribution. Secondly, the Lévy flight strategy is combined with the original cosine algorithm for updating, and the strategy pool is designed for position update mode. The optimal strategy is achieved through roulette. With the increase of iterations, the probability of strategies that can produce expected results is dynamically adjusted through adaptive learning, which improves the optimization performance and effectiveness of the algorithm. Finally, some experimental results are given to illustrate the feasibility and efficiency of the proposed algorithm.

Authors

Institutions

Publication Details

Published
2025-07-04
DOI
https://doi.org/10.1109/raiic65850.2025.11170217
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

Path Planning of Multi-Mobile Robot Based on Multistrategy Fusion Improved Sine-Cosine Algorithm

Yuying Guo, Kai Wang, L. Z. Liao
Robotic Path Planning Algorithms
article

Path Planning of Multi-Mobile Robot Based on Multistrategy Fusion Improved Sine-Cosine Algorithm

Yuying Guo, Kai Wang, L. Z. Liao
article en

Abstract

In this paper, an innovative multi-strategy fusion improved sine-cosine algorithm is proposed for multi-mobile robots moving in indoor environments with multiple obstacles. First, the optimization method of the good point set is introduced to improve the diversity of the initial population distribution. Secondly, the Lévy flight strategy is combined with the original cosine algorithm for updating, and the strategy pool is designed for position update mode. The optimal strategy is achieved through roulette. With the increase of iterations, the probability of strategies that can produce expected results is dynamically adjusted through adaptive learning, which improves the optimization performance and effectiveness of the algorithm. Finally, some experimental results are given to illustrate the feasibility and efficiency of the proposed algorithm.

Southwest University of Science and Technology (CN)
Openalex Percentile: Top 72%
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.