Tight estimates for convergence of some non-stationary consensus algorithms

被引:13
作者
Angeli, David [2 ]
Bliman, Pierre-Alexandre [1 ]
机构
[1] INRIA, F-78153 Le Chesnay, France
[2] Univ London Imperial Coll Sci Technol & Med, Dept Elect & Elect Engn, London, England
关键词
Multiagent systems; Distributed consensus; Convergence rate; Linear time-varying systems; Uncertain systems; Stochastic matrices; Perron-Frobenius theory; Mixing rates;
D O I
10.1016/j.sysconle.2008.06.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some non-zero minimal weight of the information transfer along this tree is guaranteed, an estimate of the contraction rate is given. The latter is expressed explicitly as the spectral radius of some matrix depending upon the tree depth and the lower bounds on the weights. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:996 / 1004
页数:9
相关论文
共 24 条
[1]  
ANGELI D, SIAM J CONT IN PRESS
[2]   Stability of leaderless discrete-time multi-agent systems [J].
Angeli, David ;
Bliman, Pierre-Alexandre .
MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS, 2006, 18 (04) :293-322
[3]  
[Anonymous], 1969, P PRINCETON C HONOR
[4]  
[Anonymous], INT J MATH MATH SCI
[5]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[6]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[7]  
CAO M, 2005, P JOINT EUR CONTR C
[8]  
Diaconis P., 1991, ANN APPL PROBAB, V1, P36
[9]  
Fill J. A., 1991, Annals of Applied Probability, V1, P62, DOI 10.1214/aoap/1177005981
[10]  
FORSTER KH, 1989, LINEAR ALGEBRA APPL, V121, P593