Consensus seeking over random weighted directed graphs

被引：238
作者：
Porfiri, Maurizio
Stilwell, Daniel J.
机构：
[1] Polytech Univ, Dept Mech Aerosp & Mfg Engn, Brooklyn, NY 11201 USA
[2] Virginia Polytech Inst & State Univ, Bradley Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
来源：
IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2007年 / 52卷 / 09期
关键词：
consensus problem; directed graphs; fast switching; random graphs; weighted graphs;
D O I：
10.1109/TAC.2007.904603
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication among agents is modeled as a weighted directed random graph that switches periodically. The existence of any edge is probabilistic and independent from the existence of any other edge. We further allow each edge to be weighted differently. Sufficient conditions for asymptotic almost sure consensus are presented for the case of positive weights and for the case of arbitrary weights.
引用
收藏
页码：1767 / 1773
页数：7
相关论文
共 20 条
  • [1] Blondel VD, 2005, IEEE DECIS CONTR P, P2996
  • [2] ERDOS P, 1960, B INT STATIST INST, V38, P343
  • [3] FANG L, 2005, P 2005 WORKSH NETW E
  • [4] Godsil C., 2001, ALGEBRAIC GRAPH THEO
  • [5] Gut A., 2005, PROBABILITY GRADUATE
  • [6] Agreement over random networks
    Hatano, Y
    Mesbahi, M
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50 (11) : 1867 - 1872
  • [7] Stochastic stability theory for systems containing interval matrices
    Hibey, JL
    [J]. IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1996, 32 (04) : 1385 - 1391
  • [8] Horn R. A., 1986, Matrix analysis
  • [9] Coordination of groups of mobile autonomous agents using nearest neighbor rules
    Jadbabaie, A
    Lin, J
    Morse, AS
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) : 988 - 1001
  • [10] KUSHER H, 1971, INTRO STOCHASTIC CON
12