Joint MECHATRONICS 2025, ROBOTICS 2025 Paper Abstract

Close

Paper WeCT4.5

Pan, Honghao (Durham University), Wang, Hang (Durham University), Arvin, Farshad (Durham University), Hu, Junyan (Durham University)

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

Scheduled for presentation during the Regular Session "Cooperative Multi-Robot Control" (WeCT4), Wednesday, July 16, 2025, 17:50−18:10, Room 108

Joint 10th IFAC Symposium on Mechatronic Systems and 14th Symposium on Robotics, July 15-18, 2025, Paris, France

This information is tentative and subject to change. Compiled on July 16, 2025

Keywords Multi cooperative robot control, Networked robots, Mobile robots and vehicles

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.

 

Technical Content Copyright © IFAC. All rights reserved.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2025 PaperCept, Inc.
Page generated 2025-07-16  14:40:54 PST   Terms of use