Triggered Minimum Spanning Tree for distributed coverage with connectivity maintenance

We study the problem of distributed coverage with connectivity maintenance for robot networks with range-limited communication and sensing.We let the robots perform coverage while keeping a set of communication links. The structure that ensures that the network does not get disconnected, and that provides the highest freedom of robot motions is the Minimum-distance Spanning Tree (MST). As robots move to perform the coverage task, their distances change as well and this MST becomes obsolete. Computing the MST at each coverage step may be too communication demanding. The contribution of this paper is the proposal of a triggering strategy, where agents decide when to compute a new MST of the graph. In our simulations, we show that our method achieves a similar coverage goal as the one computing the MST at each step, whereas it has much lower communication costs.

[1]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[2]  Masayuki Fujita,et al.  Coverage control for mobile networks with limited-range anisotropic sensors , 2008, 2008 47th IEEE Conference on Decision and Control.

[3]  Emilio Frazzoli,et al.  On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[4]  Yogen K. Dalal,et al.  A Distributed Algorithm for Constructing Minimal Spanning Trees , 1987, IEEE Transactions on Software Engineering.

[5]  Warren E. Dixon,et al.  Formation reconfiguration for mobile robots with network connectivity constraints , 2012, IEEE Network.

[6]  Emilio Frazzoli,et al.  On synchronous robotic networks Part I: Models, tasks and complexity notions , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  F. Bullo,et al.  On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity , 2005, IEEE Transactions on Automatic Control.

[8]  Vijay Kumar,et al.  Sensing and coverage for a network of heterogeneous robots , 2008, 2008 47th IEEE Conference on Decision and Control.

[9]  Jorge Cortés,et al.  Coverage control by multi-robot networks with limited-range anisotropic sensory , 2009, Int. J. Control.

[10]  Antonio Franchi,et al.  A passivity-based decentralized strategy for generalized connectivity maintenance , 2013, Int. J. Robotics Res..

[11]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.

[12]  Francesco Bullo,et al.  Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions , 2022 .

[13]  Mac Schwager,et al.  Decentralized, Adaptive Coverage Control for Networked Robots , 2009, Int. J. Robotics Res..

[14]  Karl Henrik Johansson,et al.  Bounded control of network connectivity in multi-agent systems , 2010 .

[15]  S. Hirche,et al.  Voronoi based coverage control with anisotropic sensors , 2008, 2008 American Control Conference.

[16]  Mac Schwager,et al.  Unifying geometric, probabilistic, and potential field approaches to multi-robot deployment , 2011, Int. J. Robotics Res..

[17]  Maleq Khan,et al.  A fast distributed approximation algorithm for minimum spanning trees , 2007, Distributed Computing.

[18]  Andrea Gasparri,et al.  Distributed Control of Multirobot Systems With Global Connectivity Maintenance , 2013, IEEE Trans. Robotics.

[19]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[20]  Yugeng Xi,et al.  Distributed cooperative coverage and connectivity maintenance for mobile sensing devices , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[21]  Jorge Cortes,et al.  Self-triggered coordination of robotic networks for optimal deployment , 2012, Autom..

[22]  Majid Sarrafzadeh,et al.  Constant Approximation Algorithm for MST in Resource Constrained Wireless Sensor Networks , 2008 .

[23]  Warren E. Dixon,et al.  Network Connectivity Preserving Formation Stabilization and Obstacle Avoidance via a Decentralized Controller , 2012, IEEE Transactions on Automatic Control.

[24]  Jorge Cortés,et al.  Distributed Tree Rearrangements for Reachability and Robust Connectivity , 2009, SIAM J. Control. Optim..