DocumentCode :
2291073
Title :
Discrete-time average-consensus under switching network topologies
Author :
Kingston, Derek B. ; Beard, Randal W.
Author_Institution :
Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT
fYear :
2006
fDate :
14-16 June 2006
Abstract :
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
Keywords :
discrete time systems; distributed algorithms; graph theory; telecommunication network topology; telecommunication switching; average-consensus problem; discrete-time framework; switching network topologies; Autonomous agents; Distributed algorithms; Joining processes; Network topology; Protocols; Switches; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 2006
Conference_Location :
Minneapolis, MN
Print_ISBN :
1-4244-0209-3
Electronic_ISBN :
1-4244-0209-3
Type :
conf
DOI :
10.1109/ACC.2006.1657268
Filename :
1657268
Link To Document :
بازگشت