Consensus and Cooperation in Networked Multi-Agent Systems

By Reza Olfati-Saber, J. Alexander Fax, Richard M. Murray. 2007

10,315 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics, Game & Decision Theory, Network Science & Complex Systems

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 Statistical and Nonlinear Physics

In Game & Decision Theory

In Network Science & Complex Systems

Citations in the corpus

Asynchronous Decentralized Parallel Stochastic Gradient Descent (2017, methodology): “…studied by the control community for solving the consensus problem where the goal is to compute the mean of all the data distributed on multiple nodes [Aysal et al., 2009, Boyd et al., 2005, Carli et al., 2010, Fagnani and Zampieri, 2008, Olfati-Saber et al., 2007, Schenato and Gamba, 2007].”
Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent (2017, methodology): “Nedic and Ozdaglar [2009], Ram et al. [2009b] are similar to Yuan et al. [2016] but they use subgradients. The algorithm in Nedic and Ozdaglar [2009], Ram et al. [2009b], Yuan et al. [2016] does not converge to the exact solution due to the inconsistent nature of decentralized gradient descent. This”
Differentially Private Distributed Optimization (2014, methodology): “For instance, such algorithms have been designed for the smart grids [3] and sensor networks [13].”
Learning Multiagent Communication with Backpropagation (2016, background): “Th re i a rich liter ture on ulti-agent reinforc ent learning (MARL) [1], particularly in the robotics domain [18, 25, 5, 21, 2].”
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “Distributed formation refers to the group behavior that all the agents form a pre-designed geometrical configuration through local interactions with or without a common reference.”
Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks (2016, background): “Such problems arise naturally in a variety of settings, such as multi-robot systems and sensor networks (Matari, 1997; Fox et al., 2000; Gerkey & Matari, 2004; Olfati-Saber et al., 2007; Cao et al., 2013).”
On the Convergence of Decentralized Gradient Descent (2013, background): “Compared to optimization with a fusion center that collects data and performs computation, decentralized optimization enjoys the advantages of scalability to network sizes, robustness to dynamic topologies, and privacy preservation in data-sensitive applications [7, 17, 22, 32].”
Gossip consensus algorithms via quantized communication (2009, background): “Among the vast literature, we refer the reader to [14] and references therein.”
An Exact Quantized Decentralized Gradient Descent Algorithm (2018, background): “D ISTRIBUTED optimization of a sum of convex functions has a variety of applications in different areas including decentralized control systems [2], wireless systems [3], sensor networks [4], networked multiagent systems [5], multirobot networks [6], and large scale machine learning [7].”
Interactive machine learning for health informatics: when do we need the human-in-the-loop? (2016, background): “On this basis, Olfati-Saber et al. [94] presented a theoretical framework for analysis of consensus algorithms for networked multi-agent systems with ﬁxed or dynamic topology and directed information ﬂow.”
Fully Distributed Event-Triggered Protocols for Linear Multiagent Networks (2018, background): “INTRODUCTION Cooperative control, having broad applications in various areas, including flocking, formation control, and distributed sensor networks [1]–[5], relies on the information exchange between neighboring agents and over the network.”
Structural Properties of the Caenorhabditis elegans Neuronal Network (2009, result): “Such overlap is consistent with the view [55] that this network of neurons solves a consensus problem [56].”
Distributed Consensus With Limited Communication Data Rate (2011, background): “From then on, many valuable results ([6]–[10]) have appeared.”
Synchronization of Networks of Nonidentical Euler-Lagrange Systems With Uncertain Parameters and Communication Delays (2011, background): “Similarly to [10], [11], the standard assumption of a balanced graph [3], [5], [9], [19] is conspicuous by its absence.”
Notes on averaging over acyclic digraphs and discrete coverage control (2006, methodology): “The averaging protocol (Blondel et al., 2005; Ren et al., 2007; Olfati-Saber et al., 2007) is the linear control law defined by”
Secondary Frequency and Voltage Control of Islanded Microgrids via Distributed Averaging (2015, background): “relaxed to allow for asymmetric, asynchronous, and discretetime communication with delays [24], [25].”
Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies (2011, background): “Switching network topologies were studied in Moreau (2005), Olfati-Saber, Fax, and Murray (2007), and more recently in Huang, , the authors considered stochastic consensus over lossy wireless networks, in which the proposed measurement model has a random link gain, an additive noise, and a Markov…”