Distributed belief averaging using sequential observations

Yang Liu, Ji Liu, Tamer Basar, Mingyan Liu

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


This paper considers a distributed belief averaging problem with sequential observations in which a group of n > 1 agents in a network, each having sequentially arriving samples of its belief in an online manner, aim to reach a consensus at the average of their beliefs, by exchanging information only with their neighbors. The neighbor relationships among the n agents are described by a time-varying undirected graph whose vertices correspond to agents and whose edges depict neighbor relationships. A distributed algorithm is proposed to solve this problem over sequential observations with O(1/t) convergence rate. Extensions to the case of directed graphs are also detailed.

Original languageEnglish (US)
Title of host publication2017 American Control Conference, ACC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781509059928
StatePublished - Jun 29 2017
Event2017 American Control Conference, ACC 2017 - Seattle, United States
Duration: May 24 2017May 26 2017

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619


Other2017 American Control Conference, ACC 2017
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Distributed belief averaging using sequential observations'. Together they form a unique fingerprint.

Cite this