Consensus problems in networks of agents with switching topology and time-delays

By Reza Olfati-Saber, Richard M. Murray. 2004

12,440 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

Citations in the corpus

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication (2019, background): “It is well known that gossip-type algorithms converge linearly for average consensus (Kempe et al., 2003; Xiao & Boyd, 2004; Olfati-Saber & Murray, 2004; Boyd et al., 2006).”
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “Motivated by the observation that the smallest nonzero eigenvalue of the Laplacian matrix, , determines the worst-case convergence speed [8], research has been conducted to maximize the convergence speed [104], [105] by choosing optimal weights associated with edges.”
On the O(1=k) convergence of asynchronous distributed alternating Direction Method of Multipliers (2013, background): “nsensus and cooperative control, where the goal is to design local deterministic or random update rules to achieve global coordination (for deterministic update rules, see [4], [7], [15], [23], [27], [38], [39], [40], [44]; for random update rules, see [1], [5], [9], [14]). August 1, 2013 DRAFT 5 me”
Distributed subgradient methods and quantization effects (2008, neutral): “, [26], [9], [4], [16], [5], and [17], [18]).”
Distributed Consensus Strategy for Platooning of Vehicles in the Presence of Time-Varying Heterogeneous Communication Delays (2015, background): “The design of coupling protocols for the coordination of a group of agents exchanging information in the presence of limited and uncertain communication is a well-known problem known as consensus, [11], [12].”
Synchronization in networks of identical linear systems (2008, background): “The convergence of such consensus algorithms has attracted a lot of interest in the recent years and it only requires a weak form of connectivity for the communication graph [1], [2], [3], [4], [5].”
Decentralized finite-time sliding mode estimators and their applications in decentralized finite-time formation tracking (2010, background): “Recently, decentralized multi-vehicle cooperative control, including consensus [1] [2] [3] [4] [5] [6] [7], formation control [8] [9] [10] [11] [12], and flocking [13] [14] [15] [16], has drawn significant research attention in the control society.”
Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties (2013, background): “Two pioneering works on consensus are [3] and [4].”
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics (2010, background): “Based on the algebraic graph theory [8], it has been shown that the network connectivity is a key factor in reaching consensus [5], [14], [19], [25].”
Tracking control for multi-agent consensus with an active leader and variable topology (2006, background): “Note that ui in (6) is a local controller of agent i, which only depends on the information from its neighbors, and, in fact, when v0 = 0, a = 0, the proposed control law (6) is consistent with the one given in Olfati-Saber and Murray (2004). In addition, with the neighbor-based estimation rule in a”
Distributed Average Consensus With Dithered Quantization (2008, methodology): “We expect that the same techniques employed in [3], [27], [28] can be used to”
Coordination and Geometric Optimization via Distributed Dynamical Systems (2003, methodology): “Recent years have witnessed a large research eort focused on motion planning and formation control problems for multi-vehicle systems [18, 22, 19, 24 , 30, 31].”
Distributed consensus of linear multi-agent systems with adaptive dynamic protocols (2011, neutral): “Speciﬁcally, a general framework of the consensus problem for networks of integrators with ﬁxed or switching topologies is proposed in [2].”
Stochastic consensus over noisy networks with Markovian and arbitrary switches (2010, methodology): “The reader is referred to Olfati-Saber and Murray (2004) for the notion of balanced graphs which preserve the initial state average as an invariant during averaging.”
Stability and Convergence Properties of Dynamic Average Consensus Estimators (2006, methodology): “The proof of this result, omitted here, is based on examining the dynamics of the disagreement vector δ ( t ) = Π x ( t ) as done in [2].”