A Game Theoretic Approach to Distributed Coverage of Graphs by Heterogeneous Mobile Agents
Loading...
Author(s)
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
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.
Sponsor
Date
2013-09
Extent
Resource Type
Text
Resource Subtype
Post-print
Proceedings
Proceedings