Agreement over random networks

被引：441

作者：

Hatano, Y ^{[1
]}

Mesbahi, M ^{[1
]}

机构：

[1] Univ Washington, Dept Aeronaut & Astronaut, Seattle, WA 98195 USA

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2005年 / 50卷 / 11期

基金：

美国国家科学基金会;

关键词：

agreement problem; networked systems; random graphs; stochastic stability; supermartingales;

D O I：

10.1109/TAC.2005.858670

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider the agreement problem over random information networks. In a random network, the existence of an information channel between a pair of units at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time. In such a framework, we address the asymptotic agreement for the networked units via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs.

引用

页码：1867 / 1872

页数：6

共 25 条

[1] [Anonymous], 1983, MARKOV CHAINS
[2] Bermudez A. J., 1994, SAVMA Symposium 1994 Proceedings., P1
[3] Bollobas B., 2001, CAMBRIDGE STUDIES AD, V73
[4] Spectra of random graphs with given expected degrees
Chung, F
Lu, LY
Vu, V
[J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (11) : 6313 - 6318
[5] Diestel R., 2000, GRAPH THEORY
[6] ERDOS P, 1960, B INT STATIST INST, V38, P343
[7] Information flow and cooperative control of vehicle formations
Fax, JA
Murray, RM
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) : 1465 - 1476
[8] FIEDLER M, 1973, CZECH MATH J, V23, P298
[9] Godsil C., 2001, ALGEBRAIC GRAPH THEO
[10] 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

← 1 2 3 →