A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Discrete-time average-consensus under switching network topologies
2006
2006 American Control Conference
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
doi:10.1109/acc.2006.1657268
fatcat:fn6vw27y7jgerajwqkld6jr7t4