Distributed algorithms for reaching consensus on general functions

By Jorge Cortés. 2008

473 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

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, methodology): “The main techniques used in their stability analysis include dissipativity theory [54], nonsmooth analysis [89], [92], [93], and especially Lyapunov functions [59], [65], [67], [68], [92], [94].”
Consensus of Multi-Agent Systems With General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols (2011, methodology): “A distributed algorithm is proposed in [5] to achieve consensus in finite time.”
Event based agreement protocols for multi-agent networks (2013, unknown): “Numerous contributions have been given in the literature for multi-agent systems by research papers (Arcak, 2007; Cortés, 2008; Jadbabaie, Lin, & Morse, 2003; Lin, Broucke, & Francis, 2004; Moreau, 2005; Olfati-Saber & Murray, 2004; Tanner, Jadbabaie, & Pappas, 2007; Xiao & Wang, 2008) and…”
Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs (2013, background): “…INTRODUCTION AND BACKGROUND O VER the past few decades, the design of protocols andalgorithms for distributed function calculation and control/decision tasks has attracted significant attention by the computer science, communication, and control communities (e.g., [1]–[7], and references therein).”
Discontinuities and hysteresis in quantized average consensus (2010, unknown): “The following result, which can be deduced from [9], gives the weakest conditions for system (2) to converge to average consensus.”
Control of Minimally Persistent Formations in the Plane (2009, background): “(c) It may be important to study topologically balanced graphs (and then perhaps graphs with weights which can balance them) [11, 17] and see whether the results can be obtained far more easily.”
On Distributed Convex Optimization Under Inequality and Equality Constraints (2010, background): “Another related paper is [8] where a special case of [17], the network topology is ﬁxed and all the local constraint sets are identical, is addressed.”
Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint (2016, methodology): “Reference[7] characterized a distributed algorithm that asymptotically achieved consensus, and provided two discontinuous distributed algorithms that achieve max and min consensus, respectively, in finite time.”
When does a digraph admit a doubly stochastic adjacency matrix? (2010, background): “The notion of weight-balanced digraph is key in establishing convergence results of distributed algorith ms for average-consensus [10], [2] and consensus on general functions [11] via Lyapunov stability analysis.”
Decentralized Robust Adaptive Control for the Multiagent System Consensus Problem Using Neural Networks (2009, background): “By the nonsmooth analysis, a nonlinear controller was proposed to make all the agents to reach consensus on general functions [15].”
On H ∞ and H 2 performance regions of multi-agent systems ✩ (2011, methodology): “A distributed algorithm was proposed in Cortés (2008) to asymptotically achieve consensus in finite time. The notion of consensus region was introduced in Li, Duan, Chen, and Huang (2010) as a basis for a multi-step consensus protocol design algorithm. Flocking algorithms were investigated in Olfati”
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents (2011, background): “Various algorithms to accomplish function calculation in networks have been proposed by the computer science, communication, and control communities over the past few decades [4], [5], [6], [7].”
Consensus in Directed Networks of Agents With Nonlinear Dynamics (2011, background): “In [24], distributed algorithms for reaching network consensus was proposed based on nonsmooth analysis and many results assumed that the network is weightbalanced.”