期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 59, 期 3, 页码 763-768出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2013.2275669
关键词
Average consensus; bounded delays; digraphs; ratio consensus; weak convergence
资金
- Cyprus Research Promotion Foundation (CRPF) [TE/OPIZO/0609(BE)/08]
- Research Center for Intelligent Systems and Networks
- Swedish Foundation for Strategic Research (SSF)
Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a protocol that overcomes this limitation and, unlike existing consensus protocols in the presence of delays, ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its out-neighbors (i.e., the number of components to which it can send information) and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices. The proposed algorithm is demonstrated via illustrative examples.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据