Multiagent coverage algorithms with gossip communication: control systems on the space of partitions

Authors:
Paolo Frasca;Ruggero Carli;Francesco Bullo
Affiliations:
DIIMA, Università di Salerno and Istituto per le Applicazioni del Calcolo-CNR, Roma, Italy and Dipartimento di Matematica, Politecnico di Torino;Center for Control, Dynamical Systems and Computation, University of California at Santa Barbara, Santa Barbara, CA;Center for Control, Dynamical Systems and Computation, University of California at Santa Barbara, Santa Barbara, CA
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 3
Cited 1

Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology

International Journal of Robotics Research
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications

Convergence of Distributed Asynchronous Learning Vector Quantization Algorithms

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deployment, coverage and partitioning are fundamental tasks for robotic networks. Recently proposed algorithms achieve these tasks under a critical assumption: information is exchanged synchronously among all agents and long-range communication is possibly required. This work proposes novel deployment and partitioning algorithms that require only asynchronous pairwise (so-called gossip) communication. Which robot pair communicates at any given time may be selected deterministically or randomly. A key novel idea is the description of the coverage control problem as a control system on the space of partitions - in other words, we study the evolution of the regions assigned to each agent, rather than the evolution of the agents' positions. The novel gossip algorithms are shown to converge to multicenter Voronoi partitions through various results of independent interest: we establish the compactness of the space of partitions, the continuity of certain geometric maps (e.g., the Voronoi and the centroid maps), and two convergence theorems for switching dynamical systems on metric spaces.