Skip to main navigation Skip to search Skip to main content

Reaching consensus on a binary state by exchanging binary actions

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

In this paper, we study the problem of distributed hypothesis testing in cooperative networks of agents. All agents are trying to reach consensus on the state of nature by their private signals and the binary actions of their neighbors. This is a challenging problem because the exchanged information of the agents is highly compressed. We propose a gossip-type method where every agent's decision converges in probability to the optimal decision held by a fictitious fusion center. We prove the asymptotical property of the proposed method and provide simulation results that demonstrate the communication cost and convergence time of the method.

Original languageEnglish
Title of host publication2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings
Pages3297-3300
Number of pages4
DOIs
StatePublished - 2012
Event2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Kyoto, Japan
Duration: Mar 25 2012Mar 30 2012

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012
Country/TerritoryJapan
CityKyoto
Period03/25/1203/30/12

Keywords

  • Binary consensus
  • distributed detection
  • gossip algorithm
  • multiagent system

Fingerprint

Dive into the research topics of 'Reaching consensus on a binary state by exchanging binary actions'. Together they form a unique fingerprint.

Cite this