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

Minghui Zhu and Sonia Martínez
48th IEEE Int. Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, China, December 2009

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. 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.

File: main.pdf

Bib-tex entry:

@InProceedings{MZ-SM:09i-cdc,
author = {M. Zhu and S. Mart{\'\i}nez},
booktitle = {Proceedings of the 48th IEEE International Conference on Decision and Control and 28th Chinese Control Conference},
title = {Distributed coverage games for mobile visual sensors (II): {R}eaching the set of {N}ash equilibria},
year = {2009},
month = {December},
address = {Shanghai, China},
pages = {169--174}
}