Minimum k-Connectivity Maintenance for Robust Multi-Robot Systems

November 2019

Minimum k-Connectivity Maintenance for Robust Multi-Robot Systems

Authors:

Wenhao Luo and Katia Sycara
Conference Paper
Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems

Abstract:

In many multi-robot applications, it is critical to maintain connectivity within the robotic team to allow for information exchange and coordination. While most of the existing works focus on connectivity control that ensures robotic team remain connected as one component without faults, we consider the problem of robust connectivity maintenance that seeks to maintain emph{$k-$connectivity}, such that the multi-robot network could stay connected with the removal of fewer than $k$ robots. In this paper, we propose provably minimum $k-$connectivity maintenance algorithms for multi-robot systems. This ensures the robustness of the multi-robot network connectivity at all time and also in a flexible and optimal way to provide the highest freedom for robots task-related controllers. Particularly, we propose a $k-$Connected Minimum Constraints Subgraph ($k$-CMCS) algorithm that activates the minimum $k-$connectivity constraints to the original controllers, and then revise the original controllers in a textit{minimally invasive fashion}. We demonstrate the effectiveness of our approach via simulations of up to 40 robots in the presence of multiple behaviors.
@conference{Luo-2019-118886,
author = {Wenhao Luo And Katia Sycara},
title = {Minimum k-Connectivity Maintenance for Robust Multi-Robot Systems},
booktitle = {Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2019},
month = {November},
pages = {7370 - 7377},
keywords = {Multi-Robot Systems, Connectivity Maintenance, Robustness},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.