Communication-Free Distributed Coverage for Networked Systems

In this paper, we present a communication-free algorithm for the distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game-theoretic setting and propose a communication-free learning algorithm to maximize the coverage.

[1]  Sonia Martínez,et al.  Distributed Coverage Games for Energy-Aware Mobile Sensor Networks , 2013, SIAM J. Control. Optim..

[2]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[3]  Emilio Frazzoli,et al.  Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications , 2009, IEEE Transactions on Automatic Control.

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

[5]  Daniela Rus,et al.  Distributed coverage with mobile robots on a graph: Locational optimization , 2012, 2012 IEEE International Conference on Robotics and Automation.

[6]  Lujun Jia,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.

[7]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[8]  Sonia Martínez,et al.  Deployment algorithms for a power-constrained mobile sensor network , 2008, 2008 IEEE International Conference on Robotics and Automation.

[9]  L. Blume.  The Statistical Mechanics of Strategic Interaction , 1993 .

[10]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[11]  H. Young,et al.  The Evolution of Conventions , 1993 .

[12]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[13]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[14]  R. Rob,et al.  Learning, Mutation, and Long Run Equilibria in Games , 1993 .

[15]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[16]  Ruggero Carli,et al.  Discrete Partitioning and Coverage Control With Gossip Communication , 2009 .

[17]  Timon C. Du,et al.  Mobile agents in distributed network management , 2003, CACM.

[18]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[19]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[20]  Zhu Han,et al.  Auction-Based Resource Allocation for Cooperative Communications , 2008, IEEE Journal on Selected Areas in Communications.

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

[22]  Jason R. Marden,et al.  Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[23]  Magnus Egerstedt,et al.  A Game Theoretic Approach to Distributed Coverage of Graphs by Heterogeneous Mobile Agents , 2013 .

[24]  Sonia Martinez,et al.  Deployment algorithms for a power‐constrained mobile sensor network , 2010 .

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

[26]  Jason R. Marden,et al.  Cooperative Control and Potential Games , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[27]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

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

[29]  J. Reese,et al.  Solution methods for the p‐median problem: An annotated bibliography , 2006, Networks.

[30]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[31]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[32]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[33]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..