Consensus protocols for networks of dynamic agents

By Reza Olfati-Saber, Richard M. Murray. Proceedings of the 2003 American Control Conference, 2003., 2003

868 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

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

Dynamic modeling and control of supply chain systems: A review (2008, background): “Thus, their main goal was to design a consensus protocol [187].”
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems (2008, methodology): “as described in [33], all of the local energy reserves will now converge to a single value.”
Consensus and Cooperation in Networked Multi-Agent Systems (2007, methodology): “A consensus algorithm with this specific invariance property is called an average-consensus algorithm [9] and has broad applications in distributed computing on networks (e.”
Decentralized control of vehicle formations (2005, background): “In [17,18] the authors only prove sufficiency and assume that the graph is either undirected [ 18 ] or strongly connected [17].”
Consensus Problems on Networks With Antagonistic Interactions (2013, background): “[34], [39] for the case of nonnegative weights in the adjacency matrix .”
Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise (2007, neutral): “) Average consensus computes iteratively the global average of distributed data using local communications, see [2]–[5] that consider versions and extensions of basic consensus.”
Passivity as a Design Tool for Group Coordination (2007, background): “However, both [19] and a related result in [20] assume that the nonlinearities satisfy an incremental sector assumption which is more restrictive than the sector condition (48) of Corollary 1.”
A theoretical study of different leader roles in networks (2006, background): “Recent results in the theoretical study of synchronization and group cooperation [7, 9, 17, 3, 19, 23, 24, 22, 25] have greatly helped understand distributed networks in the natural world and emulate them in artificial systems.”
Decentralized event-triggered consensus with general linear dynamics (2014, methodology): “The sampled-data approach is commonly used to estimate the sampling periods (Cao & Ren, 2010; Liu, Xie, & Wang, 2010; Qin & Gao, 2012). An important drawback of periodic transmission is that it requires synchronization between the agents, that is, all agents need to transmit their information at the”
Leader-following consensus of multi-agent systems under fixed and switching topologies (2010, background): “The systematical framework of consensus problem in networks of dynamic agents with switching topology and time-delays was proposed in [12,13].”
Consensus seeking in multiagent systems under dynamically changing interaction topologies (2005, neutral): “Research efforts in this direction are reported in [ 1], [2], [3], [4], [5], [6], [7], [8], to name a few.”
Ultrafast consensus in small-world networks (2005, methodology): “In [35], [33], OlfatiSaber & Murray show that the following linear dynamic system”
Distributed Kalman Filter with Embedded Consensus Filters (2005, methodology): “A scheme for approximate distributed Kalman filtering (DKF) was proposed in [30] based on reaching an average-consensus [23], [27], [21].”
Stability of multiagent systems with time-dependent communication links (2005, background): “Other studies that consider the connection between communication topology and system stability such as [14], [27]–[29], [31], [34], and [35] typically rely on algebraic graph theory, relating the graph topology with the algebraic structure of associated graph matrices.”
Consensus problems in networks of agents with switching topology and time-delays (2004, methodology): “The convergence analysis of protocol (A3) is very similar to the proof of Theorem 8 and is omitted from this paper due to the limitation of space.”
Flocking with obstacle avoidance: cooperation with limited communication in mobile networks (2003, background): “Either this information can be communicated to the agent via a coordinator, or all agents need to solve average-consensus problems [15] in a distributed fashion.”