当前位置: X-MOL 学术IEEE Trans. Signal Inf. Process. Over Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal Memory Scheme for Accelerated Consensus Over Multi-Agent Networks
IEEE Transactions on Signal and Information Processing over Networks ( IF 3.0 ) Pub Date : 4-26-2022 , DOI: 10.1109/tsipn.2022.3169644
Jiahao Dai 1 , Jing-Wen Yi 1 , Li Chai 2
Affiliation  

Consensus overmulti-agent networks can be accelerated by utilizing agent’s memory to the control protocol. In this paper, a general protocol with memory information from the node and its neighbors is designed. We aim to provide an optimal memory scheme to accelerate consensus. The contributions of this paper include: (i) For the one-tap memory scheme, we prove that the memory information of neighbors is unnecessary for the optimal convergence. (ii) It is proved that in the worst-case scenario, one-tap node memory is sufficient to achieve the optimal convergence rate, that is, adding more taps of past information from neighbors can not improve the rate further. (iii) It is found that the convergence rate with two-tap memory can be further improved on star networks. Numerical examples are presented to illustrate the validity and correctness of the obtained results.

中文翻译:


多代理网络上加速共识的最佳内存方案



通过利用代理的记忆来控制协议,可以加速多代理网络上的共识。在本文中,设计了一种具有来自节点及其邻居的内存信息的通用协议。我们的目标是提供最佳的内存方案来加速达成共识。本文的贡献包括:(i)对于一键记忆方案,我们证明邻居的记忆信息对于最优收敛来说是不必要的。 (ii) 事实证明,在最坏的情况下,一抽节点内存足以实现最佳收敛速度,即添加更多来自邻居的过去信息的抽头并不能进一步提高速度。 (iii)发现在星形网络上使用两抽头存储器可以进一步提高收敛速度。数值算例说明了所得结果的有效性和正确性。
更新日期:2024-08-26
down
wechat
bug