A game theoretic approach to distributed coverage of graphs by heterogeneous mobile agents

A. Yasin Yazicioiǧlu, Magnus Egerstedt, Jeff S. Shamma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

In this paper, we study the problem of covering an apriori unknown network structure by a group of mobile agents with possibly nonidentical coverage and communication capabilities. The network is represented as a graph, and the agents are mobile devices that explore and cover the graph in a decentralized fashion. We study this problem in a game theoretic setting and achieve optimal coverage through learning in games.

Original languageEnglish (US)
Title of host publication4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Proceedings
Pages309-315
Number of pages7
EditionPART 1
DOIs
StatePublished - Nov 1 2013
Event4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Koblenz, Germany
Duration: Sep 25 2013Sep 26 2013

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
NumberPART 1
Volume4
ISSN (Print)1474-6670

Other

Other4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013
CountryGermany
CityKoblenz
Period09/25/1309/26/13

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'A game theoretic approach to distributed coverage of graphs by heterogeneous mobile agents'. Together they form a unique fingerprint.

Cite this