Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 AMERICAN CONTROL CONFERENCE (ACC) | Convergence (routing),Graph,Algorithm design,Vertex (geometry),Computer science,Directed graph,Theoretical computer science,Symmetric matrix,Distributed algorithm,Rate of convergence |
DocType | ISSN | Citations |
Conference | 0743-1619 | 1 |
PageRank | References | Authors |
0.35 | 21 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Liu | 1 | 32 | 11.55 |
| Ji Liu | 2 | 146 | 26.61 |
| Tamer Basar | 3 | 3497 | 402.11 |
| Mingyan Liu | 4 | 2569 | 224.92 |