Name
Title | ||
|---|---|---|
Convergence speed in distributed consensus over dynamically switching random networks |
Abstract | ||
|---|---|---|
Characterizing convergence speed is one of the most important research challenges in the design of distributed consensus algorithms for networked multi-agent systems. In this paper, we consider a group of agents that communicate via a dynamically switching random information network. Each link in the network, which represents the directed/undirected information flow between any ordered/unordered pair of agents, could be subject to failure with a certain probability. Hence we model the information flow using dynamically switching random graphs. We characterize the convergence speed for the distributed discrete-time consensus algorithm over a variety of random networks with arbitrary weights. In particular, we propose the asymptotic and per-step (mean square) convergence factors as measures of the convergence speed and derive the exact value for the per-step (mean square) convergence factor. Numerical examples are also given to illustrate our theoretical results. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.automatica.2009.01.021 | Automatica |
Keywords | Field | DocType |
Consensus,Convergence speed,Stochastic stability,Convergence factor,Multi-agent coordination,Random networks | Consensus,Convergence (routing),Convergence of random variables,Unordered pair,Mathematical optimization,Random graph,Compact convergence,Distributed algorithm,Discrete time and continuous time,Mathematics | Journal |
Volume | Issue | ISSN |
45 | 6 | 0005-1098 |
Citations | PageRank | References |
31 | 1.43 | 20 |
Authors | ||
2 | ||