TY - GEN
T1 - A game theoretic approach to distributed coverage of graphs by heterogeneous mobile agents
AU - Yazicioiǧlu, A. Yasin
AU - Egerstedt, Magnus
AU - Shamma, Jeff S.
PY - 2013/11/1
Y1 - 2013/11/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84886625093&partnerID=8YFLogxK
U2 - 10.3182/20130925-2-DE-4044.00034
DO - 10.3182/20130925-2-DE-4044.00034
M3 - Conference contribution
AN - SCOPUS:84886625093
SN - 9783902823557
T3 - IFAC Proceedings Volumes (IFAC-PapersOnline)
SP - 309
EP - 315
BT - 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Proceedings
T2 - 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013
Y2 - 25 September 2013 through 26 September 2013
ER -