Discrete-time average-consensus under switching network topologies Export

@proceedings{KingstonBeard_ACC06, 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.}, author = {Kingston, D. B. and Beard, R. W.}, booktitle = {American Control Conference, 2006}, citeulike-article-id = {3431237}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ACC.2006.1657268}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1657268}, doi = {10.1109/ACC.2006.1657268}, journal = {American Control Conference, 2006}, keywords = {consensus, distributed\_algorithms}, pages = {6 pp.+}, posted-at = {2008-10-20 16:52:59}, priority = {2}, title = {Discrete-time average-consensus under switching network topologies}, url = {http://dx.doi.org/10.1109/ACC.2006.1657268}, year = {2006} }

TY - CONF ID - KingstonBeard_ACC06 L3 - citeulike-article-id:3431237 N2 - 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. JF - American Control Conference, 2006 TI - Discrete-time average-consensus under switching network topologies T2 - American Control Conference, 2006 SP - 6 pp. KW - consensus KW - distributed_algorithms AU - Kingston, DB AU - Beard, RW PY - 2006/// UR - http://dx.doi.org/10.1109/ACC.2006.1657268 ER -