Decentralized estimation of the minimum strongly connected subdigraph for robotic networks with limited field of view

In this work we focus on the topology control problem for robotic networks. In particular, we assume agents to be equipped with limited field of view sensors. As a consequence, directed graphs are required to model the robot-to-robot interaction. This significantly limits the applicability of algorithms developed for undirected graphs. In that view, we propose an auction-based solution for the decentralized estimation of an approximated minimum (in terms of number of links and in terms of a global cost function) strongly connected directed graph. This represents the first step towards the development of a connectivity maintenance framework for directed graphs. A theoretical analysis along with numerical simulations are provided to show the effectiveness of the proposed approach.

[1]  Andrea Gasparri,et al.  Enhanced Connectivity Maintenance for Multi-Robot Systems , 2012, SyRoCo.

[2]  Magnus Egerstedt,et al.  Distributed Coordination Control of Multiagent Systems While Preserving Connectedness , 2007, IEEE Transactions on Robotics.

[3]  Toshihide Ibaraki,et al.  A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem , 2003, Inf. Process. Lett..

[4]  Adrian Vetta,et al.  Approximating the minimum strongly connected subgraph via a matching lower bound , 2001, SODA '01.

[5]  Amir G. Aghdam,et al.  A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems , 2010, IEEE Transactions on Automatic Control.

[6]  Gaurav S. Sukhatme,et al.  A framework for multi-robot node coverage in sensor networks , 2008, Annals of Mathematics and Artificial Intelligence.

[7]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[8]  M. Ani Hsieh,et al.  Maintaining network connectivity and performance in robot teams , 2008, J. Field Robotics.

[9]  Oliver Sawodny,et al.  A distributed minimum restrictive connectivity maintenance algorithm , 2009 .

[10]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, ACC.

[11]  Andrea Gasparri,et al.  Decentralized Laplacian eigenvalues estimation for networked multi-agent systems , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[12]  Mac Schwager,et al.  Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments , 2011, IEEE Transactions on Robotics.

[13]  Dimos V. Dimarogonas,et al.  Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots , 2008, IEEE Transactions on Robotics.

[14]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[15]  Pierre A. Humblet.  A Distributed Algorithm for Minimum Weight Directed Spanning Trees , 1983, IEEE Trans. Commun..

[16]  Giuseppe Notarstefano,et al.  Maintaining limited-range connectivity among second-order agents , 2006, 2006 American Control Conference.

[17]  George J. Pappas,et al.  Flocking while preserving network connectivity , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[19]  Andrea Gasparri,et al.  Decentralized topology control for robotic networks with limited field of view sensors , 2012, 2012 American Control Conference (ACC).

[20]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

[21]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.