Decentralized Autonomous Navigation of Large-Scale Robotic Swarms with Control Barrier Functions

This paper addresses the shape formation problem for large-scale robotic swarms by proposing an optimization-based cooperative navigation method. First, the physical space is partitioned into multiple disjoint bins, and the stochastic evolution of robots is modelled using a Markov matrix. An optimal control problem is formulated to derive the optimal Markov sequence, navigating the swarm to converge toward the desired density distribution. In contrast to most existing shape formation methods for large-scale robotic swarms that lack explicit trajectory planning algorithms, we utilize inverse sampling techniques to determine the desired target points. By designing reasonable control Lyapunov functions and control barrier functions to construct a quadratic programming problem, robots are able to asymptotically converge to their targets while avoiding collisions. However, as the number of robots increases, control barrier function as a hard constraint may lead to deadlock. Therefore, we then propose a task-swapping mechanism to resolve this issue. Finally, simulation experiments demonstrate the stability and effectiveness of our approach.

Publication Details

Published
2025-03-17
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized Autonomous Navigation of Large-Scale Robotic Swarms with Control Barrier Functions

Distributed Control Multi-Agent Systems
article

Decentralized Autonomous Navigation of Large-Scale Robotic Swarms with Control Barrier Functions

article en

Abstract

This paper addresses the shape formation problem for large-scale robotic swarms by proposing an optimization-based cooperative navigation method. First, the physical space is partitioned into multiple disjoint bins, and the stochastic evolution of robots is modelled using a Markov matrix. An optimal control problem is formulated to derive the optimal Markov sequence, navigating the swarm to converge toward the desired density distribution. In contrast to most existing shape formation methods for large-scale robotic swarms that lack explicit trajectory planning algorithms, we utilize inverse sampling techniques to determine the desired target points. By designing reasonable control Lyapunov functions and control barrier functions to construct a quadratic programming problem, robots are able to asymptotically converge to their targets while avoiding collisions. However, as the number of robots increases, control barrier function as a hard constraint may lead to deadlock. Therefore, we then propose a task-swapping mechanism to resolve this issue. Finally, simulation experiments demonstrate the stability and effectiveness of our approach.

Openalex Percentile: Top 45%
Distributed Control Multi-Agent Systems
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.