Agreement over random networks

被引：28

作者：

Hatano, Y ^{[1
]}

Mesbahi, M ^{[1
]}

机构：

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

来源：

2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5 | 2004年

关键词：

agreement problem; spatially distributed systems; random graphs; stochastic stability;

D O I：

10.1109/CDC.2004.1430343

中图分类号：

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 elements 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 elements via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs.

引用

页码：2010 / 2015

页数：6

共 20 条

[1]

Bermudez A. J., 1994, SAVMA Symposium 1994 Proceedings., P1

[2]

Bollobas B., 2001, CAMBRIDGE STUDIES AD, V73

[3] Spectra of random graphs with given expected degrees [J].

Chung, F ;

Lu, LY ;

Vu, V .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (11) :6313-6318

[4]

Diestel R., 2000, GRAPH THEORY

[5]

ERDOS P, 1960, B INT STATIST INST, V38, P343

[6]

FAX A, 2002, IFAC WORLD C JUN 200

[7]

FIEDLER M, 1973, CZECH MATH J, V23, P298

[8]

Godsil C., 2001, ALGEBRAIC GRAPH THEO

[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]

Janson S, 2000, WIL INT S D

← 1 2 →