Probabilistic Multi-Robot Collision Avoidance Online Path Planning Method Using an Improved Sine-Cosine Algorithm

This paper proposes an online path planning method for multi-robot collision avoidance that accounts for uncertainties in robot positioning. Firstly, the online path plan-ning problem for multiple robots is transformed into a multi-objective optimization problem by considering some necessary factors that affect task efficiency and safety. Notably, the paper considers the uncertainty in robot positions, in which the position follows a Gaussian distribution. Then, by converting probabilistic collision conditions into deterministic constraints, the fitness function ensuring probabilistic collision avoidance is constructed. Next, an improved sine-cosine algorithm is proposed to solve the ideal position. Finally, simulation experiments demonstrate that the proposed method effectively resolves collision issues under probabilistic uncertainty conditions.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icarcv63323.2024.10821604
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

Probabilistic Multi-Robot Collision Avoidance Online Path Planning Method Using an Improved Sine-Cosine Algorithm

Chang Wang, Jian-Yu Li, Jing Wang, Meng Zhou
Robotic Path Planning Algorithms
article

Probabilistic Multi-Robot Collision Avoidance Online Path Planning Method Using an Improved Sine-Cosine Algorithm

Chang Wang, Jian-Yu Li, Jing Wang, Meng Zhou
article en

Abstract

This paper proposes an online path planning method for multi-robot collision avoidance that accounts for uncertainties in robot positioning. Firstly, the online path plan-ning problem for multiple robots is transformed into a multi-objective optimization problem by considering some necessary factors that affect task efficiency and safety. Notably, the paper considers the uncertainty in robot positions, in which the position follows a Gaussian distribution. Then, by converting probabilistic collision conditions into deterministic constraints, the fitness function ensuring probabilistic collision avoidance is constructed. Next, an improved sine-cosine algorithm is proposed to solve the ideal position. Finally, simulation experiments demonstrate that the proposed method effectively resolves collision issues under probabilistic uncertainty conditions.

North China University of Technology (CN), Beijing Aerospace Flight Control Center (CN)
Openalex Percentile: Top 75%
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.

Probabilistic Multi-Robot Collision Avoidance Online Path Planning Method Using an Improved Sine-Cosine Algorithm — Chang Wang, Jian-Yu Li, et al. · (2024) | TGRS Research Map | TGRS