.png){kind=icon}
返回
Noise Resilient Distributed Average Consensus Over Directed Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TSIPN.2023.3324583.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by the needs of resiliency, scalability, and plug-and-play operation, distributed decision making is becoming increasingly prevalent. The problem of achieving consensus in a multi-agent system is at the core of distributed decision making. In this article, we study the problem of achieving average consensus over a directed multi-agent network when the communication links are corrupted with noise. We propose an algorithm where each agent updates its estimates based on the local mixture of information and adds its weighted noise-free initial information to its updates during every iteration. We demonstrate that, with appropriately designed weights, the agents achieve consensus despite additive communication noise. We establish that when the communication links are noiseless, the proposed algorithm moves towards consensus at a geometric rate. Under communication noise, we prove that the agent estimates reach a consensus value almost surely. We present numerical experiments to corroborate the efficacy of the proposed algorithm under different noise realizations and various algorithm parameters.
Keyword:
Almost sure convergence
average consensus
communication noise
directed graphs
multi-agent networks
push sum
ratio consensus
期刊
IF:
4.9
论文数:
734
被引数:
1.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容