Decentralized connectivity maintenance for cooperative control of mobile robotic systems
- 18 September 2013
- journal article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 32 (12), 1411-1423
- https://doi.org/10.1177/0278364913499085
Abstract
To accomplish cooperative tasks, robotic systems are often required to communicate with each other. Thus, maintaining connectivity of the communication graph is a fundamental issue in the field of multi-robot systems. In this paper we present a completely decentralized control strategy for global connectivity maintenance of the communication graph. Considering the disk communication model, we describe a gradient-based control strategy that exploits decentralized estimation of the algebraic connectivity. Unlike previous approaches available in the literature, the proposed control algorithm solves the global connectivity problem in a decentralized manner providing theoretical guarantees, without requiring maintenance of the local connectivity between robotic systems. Moreover, results obtained with simulations and experiments on real robots are described for demonstrating the efficacy of the proposed algorithm.Keywords
This publication has 38 references indexed in Scilit:
- Distributed control of mobility & routing in networks of robotsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Bounded control of network connectivity in multi-agent systemsIET Control Theory & Applications, 2010
- Decentralized estimation and control of graph connectivity for mobile sensor networksAutomatica, 2010
- Distributed Motion Constraints for Algebraic Connectivity of Robotic NetworksJournal of Intelligent & Robotic Systems, 2009
- Distributed Tree Rearrangements for Reachability and Robust ConnectivityPublished by Springer Science and Business Media LLC ,2009
- Maintaining network connectivity and performance in robot teamsJournal of Field Robotics, 2007
- On exploiting asymmetric wireless links via one-way estimationPublished by Association for Computing Machinery (ACM) ,2007
- On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Controlling Connectivity of Dynamic GraphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Extremizing algebraic connectivity subject to graph theoretic constraintsThe Electronic Journal of Linear Algebra, 1998