Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control

This paper unifies and extends several different existing strategies for multi-robot coverage control, including ones based on Voronoi partitions, probabilistic models, and artificial potential fields. We propose a cost function form for coverage problems that can be specialized to fit different distributed sensing and actuation scenarios. We show that controllers based on Voronoi partitions can be approximated arbitrarily well by simpler methods that do not require the computation of a Voronoi partition. The performance of three different controllers designed with the new approach is compared in simulation. We also formally delineate two classes of multi-agent problems: consensus problems and non-consensus problems. We show that coverage control is a non-consensus problem and that it requires the optimization of a nonconvex cost function.

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

[2]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[3]  Wei Li,et al.  Distributed Cooperative coverage Control of Sensor Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[4]  Yaakov Bar-Shalom,et al.  Multisensor Resource Deployment Using Posterior CramBounds , 2004 .

[5]  K. Passino,et al.  A class of attractions/repulsion functions for stable swarm aggregations , 2004 .

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

[7]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

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

[9]  Ralph L. Hollis,et al.  Complete distributed coverage of rectilinear environments , 2000 .

[10]  Mac Schwager,et al.  From Theory to Practice: Distributed Coverage Control Experiments with Groups of Robots , 2008, ISER.

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

[12]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[13]  Mac Schwager,et al.  Optimal coverage for multiple hovering robots with downward facing cameras , 2009, 2009 IEEE International Conference on Robotics and Automation.

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

[15]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[16]  Emilio Frazzoli,et al.  Efficient routing of multiple vehicles with no explicit communications , 2008 .

[17]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[18]  Emilio Frazzoli,et al.  Dynamic multi-vehicle routing with multiple classes of demands , 2009, 2009 American Control Conference.

[19]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .

[20]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

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

[22]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .