期刊
SIAM JOURNAL ON CONTROL AND OPTIMIZATION
卷 48, 期 1, 页码 1-32出版社
SIAM PUBLICATIONS
DOI: 10.1137/060673527
关键词
distributed consensus; multiagent systems; convergence rate; graph theory
Results for estimating the convergence rate of nonstationary distributed consensus algorithms are provided, on the basis of qualitative ( mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries). The results appear to be tight in a number of instances and are illustrated through simple as well as more sophisticated examples. The main idea is to follow propagation of information along certain spanning-trees which arise in the communication graph.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据