Consensus and cooperation in networked multi-Agent systems

By R. Saber. 2007

377 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/e5ee3a115c45d828413ed6196b9622c2f646820e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Asynchronous Consensus Protocols Using Nonlinear Paracontractions Theory (2008, background): “Consensus seeking among agents therefore becomes one of the fundamental problems in control theory, namely to reach an agreement regarding a certain quantity of interest that depends on the state of all agents [1]–[5].”
Cooperative Optimal Control for Multi-Agent Systems on Directed Graph Topologies (2014, background): “Early work with networked cooperative systems in continuous and discrete time is presented in [1]–[4] Early work generally referred to consensus without a leader, where the final consensus value is determined solely by the initial conditions.”
Autonomous driving in urban environments: approaches, lessons and challenges (2010, methodology): “using consensus or gossip algorithm (Boyd et al. 2006; Olfati-Saber et al. 2007), provides a promising starting point for this undertaking.”
On the Convergence of Decentralized Gradient Descent (2013, background): “Compared to centralized optimization in which a fusion center collects data and takes over computation, decentralized optimization enjoys the advantages of scalability to network sizes, robustness to dynamic topologies, and privacy preservation in data-sensitive applications [6, 16, 21, 30].”
Feedback Systems: An Introduction for Scientists and Engineers (2008, unknown): “Examples include finding the maximum or minimum value in a network, counting the number of nodes in a network or computing higher order statistical moments of a distributed quantity [155].”
Mean-field and graph limits for collective dynamics models with time-varying weights (2020, background): “In the first one, interactions are pre-determined by a given interaction network, which represents the inherent structure of the population’s interactions [26, 33].”
Leader‐following control for multiple inertial agents (2011, background): “For a variety of consensus algorithms and convergence results, we refer the readers to the recent surveys [1, 2] and the references therein.”
Random walks and diffusion on networks (2016, background): “it as an example of a decentralized consensus algorithm (or protocol) [403].”