Communication constraints in the average consensus problem

被引:195
作者
Carli, Ruggero [2 ]
Fagnani, Fabio [1 ]
Speranzon, Alberto [3 ]
Zampieri, Sandro [2 ]
机构
[1] Politecn Torino, Dipartimento Matemat, Scuola Normale Super, I-10129 Turin, Italy
[2] Univ Padua, Dept Informat Engn, I-35131 Padua, Italy
[3] Royal Inst Technol, Sch Elect Engn, SE-10044 Stockholm, Sweden
关键词
consensus; multi-agent coordination; convergence rate; logarithmic quantization; random networks; mixing rate of Markov chains;
D O I
10.1016/j.automatica.2007.07.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of autonomous agents. In such a problem, communication constraints impose limits on the achievable control performance. We consider as instance of coordination the consensus problem. The aim of the paper is to characterize the relationship between the amount of information exchanged by the agents and the rate of convergence to the consensus. We show that time-invariant communication networks with circulant symmetries yield slow convergence if the amount of information exchanged by the agents does not scale well with their number. On the other hand, we show that randomly time-varying communication networks allow very fast convergence rates. We also show that by adding logarithmic quantized data links to time-invariant networks with symmetries, control performance significantly improves with little growth of the required communication effort. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:671 / 684
页数:14
相关论文
共 43 条
  • [1] EIGENVALUES AND EXPANDERS
    ALON, N
    [J]. COMBINATORICA, 1986, 6 (02) : 83 - 96
  • [2] RANDOM CAYLEY-GRAPHS AND EXPANDERS
    ALON, N
    ROICHMAN, Y
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (02) : 271 - 284
  • [3] SPECTRA OF CAYLEY GRAPHS
    BABAI, L
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (02) : 180 - 189
  • [4] BEHRENDS E, 1999, INTRO MARKOV CHAINS
  • [5] BOLZEN P, 2004, IEEE C DEC CONTR
  • [6] Fastest mixing Markov chain on a graph
    Boyd, S
    Diaconis, P
    Xiao, L
    [J]. SIAM REVIEW, 2004, 46 (04) : 667 - 689
  • [7] Randomized gossip algorithms
    Boyd, Stephen
    Ghosh, Arpita
    Prabhakar, Balaji
    Shah, Devavrat
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) : 2508 - 2530
  • [8] Boyd Stephen., 2003, Symmetry analysis of reversible markov chains
  • [9] Robust rendezvous for mobile autonomous agents via proximity graphs. in arbitrary dimensions
    Cortes, Jorge
    Martinez, Sonia
    Bullo, Francesco
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (08) : 1289 - 1298
  • [10] Distributed control design for spatially interconnected systems
    D'Andrea, R
    Dullerud, GE
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (09) : 1478 - 1495