Rate of Convergence for Consensus with Delays

被引：18
作者：
Bliman, Pierre-Alexander [1 ]
Nedic, Angelia [2 ]
Ozdaglar, Asuman [3 ]
机构：
[1] INRIA, Domaine Voluceau Rocquencourt BP105, F-78153 Le Chesnay, France
[2] Univ Illions, Dept Ind & Enterprise Syst Engn, Champaign, IL 16801 USA
[3] MIT, Dept Elect Engn & Comp Sci, Cambridge, MA 02142 USA
来源：
47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008) | 2008年
基金：
美国国家科学基金会;
关键词：
D O I：
10.1109/CDC.2008.4738941
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely studied consensus algorithm, in which every agent forms a weighted average of its own value with the values received from its neighboring agents. We study an asynchronous operation of this algorithm using delayed agent values. Our focus is on establishing convergence rate results for this algorithm. In particular, for general network topologies, we provide a bound on the time required to reach consensus, which is an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.
引用
收藏
页码：4849 / 4854
页数：6
相关论文
共 21 条
[1]  
Angeli D., 2006, CONVERGENCE SPEED UN
[2]  
Angeli D., 2007, TIGHT ESTIMATES CONV
[3]  
Bertsekas D., 2015, Parallel and distributed computation: numerical methods
[4]  
BLIMAN P, 2008, AUTOMATICA
[5]  
Blondel V.D., 2005, P IEEE CDC
[6]   Reaching a consensus in a dynamically changing environment: A graphical approach [J].
Cao, Ming ;
Morse, A. Stephen ;
Anderson, Brian D. O. .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2008, 47 (02) :575-600
[7]   Reaching a consensus in a dynamically changing environment: Convergence rates, measurement delays, and asynchronous events [J].
Cao, Ming ;
Morse, A. Stephen ;
Anderson, Brian D. O. .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2008, 47 (02) :601-623
[8]  
Carli R., 2006, P IEEE ACC
[9]   Coordination of groups of mobile autonomous agents using nearest neighbor rules [J].
Jadbabaie, A ;
Lin, J ;
Morse, AS .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) :988-1001
[10]  
Kashyap A., 2006, P IEEE CDC
123