Tight estimates for convergence of some non-stationary consensus algorithms
By David Angeli, Pierre-Alexandre Bliman. 2007
27 citations recorded by the source corpus.
The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some non-zero minimal weight of the information transfer along this tree is guaranteed, an estimate of the contraction rate is given. The latter is expressed explicitly as the spectral radius of some matrix depending upon the tree depth and the lower bounds on the weights.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Electrical and Electronic Engineering
Citations in the corpus
- An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “In the deterministic setting, it w as studied in [ 157]–[159] with estimation of lower bounds.”
- Convergence Speed in Distributed Consensus and Averaging (2009, unknown): “Recently, these problems have attracted considerable attention [35, 41, 7, 23, 44, 12, 28, 46, 45, 26, 29, 18, 3, 14, 10, 11, 2, 21, 15, 42, 13, 16, 17], motivated by new contexts and open problems in communications, sensor networks, and networked control theory.”