Gossip coverage control for robotic networks: dynamical systems on the space of partitions

From MaRDI portal
Publication:2884602

DOI10.1137/100806370zbMATH Open1253.37089DBLPjournals/siamco/BulloCF12arXiv0903.3642OpenAlexW2089998775WikidataQ90156641 ScholiaQ90156641MaRDI QIDQ2884602FDOQ2884602


Authors: Francesco Bullo, Ruggero Carli, Paolo Frasca Edit this on Wikidata


Publication date: 30 May 2012

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Abstract: Future applications in environmental monitoring, delivery of services and transportation of goods motivate the study of deployment and partitioning tasks for groups of autonomous mobile agents. These tasks are achieved by recent coverage algorithms, based upon the classic methods by Lloyd. These algorithms however rely upon critical requirements on the communication network: information is exchanged synchronously among all agents and long-range communication is sometimes required. This work proposes novel coverage algorithms that require only gossip communication, i.e., asynchronous, pairwise, and possibly unreliable communication. Which robot pair communicates at any given time may be selected deterministically or randomly. A key innovative idea is describing coverage algorithms for robot deployment and environment partitioning as dynamical systems on a 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 proposed gossip algorithms are shown to converge to centroidal Voronoi partitions under mild technical conditions.


Full work available at URL: https://arxiv.org/abs/0903.3642




Recommendations





Cited In (15)





This page was built for publication: Gossip coverage control for robotic networks: dynamical systems on the space of partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884602)