论文标题
分布式平均共识与有向图中的嘈杂通信链接
Distributed Average Consensus Over Noisy Communication Links in Directed Graphs
论文作者
论文摘要
由弹性，可扩展性和插件操作的需求激励，分布式决策变得越来越普遍。在多代理系统中达成共识的问题是分布式决策的核心。在本文中，我们研究了当通信链接被噪声损坏时，在有指示的多代理网络上达成平均共识的问题。我们提出了一种算法，每个代理都会根据信息的本地混合来更新其估计值，并在每次迭代期间将其加权无噪声的初始信息添加到其更新中。我们证明，通过适当设计的权重，代理在加性通信噪声下达成共识。我们确定，当通信链接无噪音时，提出的算法以几何速率提出共识。在通信噪声下，我们证明代理商估计几乎可以肯定达到共识值。我们提出了数值实验，以证实在不同的噪声实现和各种算法参数下所提出的算法的功效。
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 mixing 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 under 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.
