Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria

Minghui Zhu, Sonia Martínez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Scopus citations

Abstract

We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while minimizing the processing cost. The rewards for the sensing are not prior information for the agents. We present a synchronous distributed learning algorithm where each sensor only remembers its own utility values and actions played during the last two time steps. The algorithm is proven to be convergent in probability to the set of (restricted) Nash equilibria from which none has incentive to unilaterally deviate.

Original languageEnglish (US)
Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages169-174
Number of pages6
ISBN (Print)9781424438716
DOIs
StatePublished - 2009
Event48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009 - Shanghai, China
Duration: Dec 15 2009Dec 18 2009

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
Country/TerritoryChina
CityShanghai
Period12/15/0912/18/09

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria'. Together they form a unique fingerprint.

Cite this