arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.00199math.OC
收藏

用有限的信息达成共识

Reaching a Consensus with Limited Information

Jingxuan Zhu, Yixuan Lin, Ji Liu, A. Stephen Morse

摘要:

在其最简单的形式,众所周知的共识问题的一个网络家庭的自主代理是设计一组协议或更新规则,一个为每个代理,这可以使所有的代理,以调整或调整其“协议变量”相同的值,通过利用实时信息从他们的“邻居”在网络内。本文的目的是研究在有限的信息传递代理人之间达成共识的问题。这意味着每个代理不是从其每个邻居接收协议变量或实值状态向量,而是接收每个状态的线性函数。制定的具体问题的利益和可证明正确的算法开发的一些特殊情况下的问题。

英文摘要:

In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement variable" to the same value by utilizing real-time information obtained from their "neighbors" within the network. The aim of this paper is to study the problem of achieving a consensus in the face of limited information transfer between agents. By this it is meant that instead of each agent receiving an agreement variable or real-valued state vector from each of its neighbors, it receives a linear function of each state instead. The specific problem of interest is formulated and provably correct algorithms are developed for a number of special cases of the problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑