Discrete-time average-consensus under switching network topologies

被引：73

作者：

Kingston, Derek B. ^{[1
]}

Beard, Randal W. ^{[1
]}

机构：

[1] Brigham Young Univ, Dept Elect & Comp Engn, Provo, UT 84602 USA

来源：

2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12 | 2006年 / 1-12卷

关键词：

D O I：

10.1109/ACC.2006.1657268

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper develops a distributed algorithm for average-consensus in a discrete-time framework based on a formal matrix limit definition of average-consensus. Using this algorithm, the average-consensus problem is solved under switching network topologies provided that the network switch between instantaneously balanced, connected-over-time networks. In other words, if at each instant the network is balanced and the union of graphs over every interval T is connected, then average-consensus can be achieved. An interesting product of this analysis is the notion of "deadbeat" consensus where a system of agents achieves consensus (average or otherwise) in finite time rather than asymptotically.

引用

页码：3551 / 3556

页数：6

共 11 条

[1]

[Anonymous], AIAA C GUID NAV CONT

[2]

Godsil C., 2001, ALGEBRAIC GRAPH THEO

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

[4]

Lynch N.A., 1996, Distributed Algorithms

[5]

MOREAU L, 2005, IEEE T AUTOMATIC CON

[6] Consensus problems in networks of agents with switching topology and time-delays [J].

Olfati-Saber, R ;

Murray, RM .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) :1520-1533

[7]

OLFATISABER R, 2005, IN PRESS P IEEE C DE

[8]

REN W, 2004, P IEEE AM CONTR C

[9]

REN W, 2005, P IEEE AM CONTR C

[10]

SPANOS DP, 2005, P INT C INF PROC SEN

← 1 2 →