KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
MetadataShow full item record
AbstractIn this paper, we present a communication-free algorithm for 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 for maximizing the coverage.
CitationYazicioglu AY, Egerstedt M, Shamma JS (2016) Communication-Free Distributed Coverage for Networked Systems. IEEE Transactions on Control of Network Systems: 1–1. Available: http://dx.doi.org/10.1109/tcns.2016.2518083.
SponsorsThis work was supported by ONR project #N00014-09-1-0751.