Skip to main navigation Skip to search Skip to main content

An evolutionary potential game theoretic approach for the K-COVER problem in multi-UAV sensor networks

  • Changhao Sun
  • , Haibin Duan*
  • *Corresponding author for this work
  • Beihang University
  • China Aerospace Science and Technology Corporation

Research output: Contribution to journalArticlepeer-review

Abstract

This paper focuses on the K-COVER problem in unmanned aerial vehicle (UAV) sensor networks and proposes a game theoretic approach based on the network potential game and Log-linear learning. After detailing the research progress at home and abroad, we firstly model the K-COVER problem in UAV networks as network potential game via appropriately designing of individual and global payoff functions. Secondly, a Log-linear learning based algorithm is proposed, whose convergence and optimality are proven using inhomogeneous Markov chain theory. Simulation results demonstrate the feasiblity, effectiveness, and superiority.

Original languageEnglish
Pages (from-to)1016-1023
Number of pages8
JournalScientia Sinica Technologica
Volume46
Issue number10
DOIs
StatePublished - 1 Oct 2016

Keywords

  • Evolutionary game theory
  • K-COVER
  • Log-learning
  • Markov chain
  • Sensor network
  • Unmanned aerial vehicle (UAV)

Fingerprint

Dive into the research topics of 'An evolutionary potential game theoretic approach for the K-COVER problem in multi-UAV sensor networks'. Together they form a unique fingerprint.

Cite this