期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 56, 期 2, 页码 386-390出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2010.2093276
关键词
Consensus algorithms; cooperative control; multi-agent systems
资金
- NSF [CMS-0643673, IIS-0712746]
We introduce here a class of distributed quantized averaging algorithms for asynchronous communication networks with fixed and switching topologies. The focus of this technical note is on the study of the convergence time of the proposed quantized averaging algorithms. By appealing to random walks on graphs, we derive polynomial bounds on the expected convergence time of the algorithms presented, as a function of the number of agents in the network.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据