Convergence in multiagent coordination, consensus, and flocking
We discuss an old distributed algorithm for reaching consensus that has received a fair
amount of recent attention. In this algorithm, a number of agents exchange their values …
amount of recent attention. In this algorithm, a number of agents exchange their values …
Convergence speed in distributed consensus and averaging
A Olshevsky, JN Tsitsiklis - SIAM journal on control and optimization, 2009 - SIAM
We study the convergence speed of distributed iterative algorithms for the consensus and
averaging problems, with emphasis on the latter. We first consider the case of a fixed …
averaging problems, with emphasis on the latter. We first consider the case of a fixed …
Convergence of type-symmetric and cut-balanced consensus seeking systems
JM Hendrickx, JN Tsitsiklis - IEEE Transactions on Automatic …, 2012 - ieeexplore.ieee.org
We consider continuous-time consensus seeking systems whose time-dependent
interactions are cut-balanced, in the following sense: if a group of agents influences the …
interactions are cut-balanced, in the following sense: if a group of agents influences the …
Multi-agent systems with dynamical topologies: Consensus and applications
It is well known that a multi-agent system (MAS) is a specific system consisting of multiple
interacting autonomous agents. Consensus or synchronization, as one of the typical …
interacting autonomous agents. Consensus or synchronization, as one of the typical …
On the cluster consensus of discrete-time multi-agent systems
Nowadays, multi-agent systems (MAS) are ubiquitous in the real world. Consensus is a
fundamental natural phenomenon. Over the past decade, consensus of MAS has received …
fundamental natural phenomenon. Over the past decade, consensus of MAS has received …
Convergence speed in distributed consensus and averaging
A Olshevsky, JN Tsitsiklis - SIAM review, 2011 - SIAM
We study the convergence speed of distributed iterative algorithms for the consensus and
averaging problems, with emphasis on the latter. We first consider the case of a fixed …
averaging problems, with emphasis on the latter. We first consider the case of a fixed …
Consensus of discrete-time second-order multiagent systems based on infinite products of general stochastic matrices
Traditionally, the consensus of a discrete-time multiagent system (MAS) with a switching
topology is transformed into the convergence problem of the infinite products of stochastic …
topology is transformed into the convergence problem of the infinite products of stochastic …
Consensus of discrete-time multi-agent systems with transmission nonlinearity
A multi-agent system (MAS) consists of multiple agents, each under the influence of a local
rule that represents its interaction with other agents. Most recent research on discrete-time …
rule that represents its interaction with other agents. Most recent research on discrete-time …
Information consensus of asynchronous discrete-time multi-agent systems
L Fang, PJ Antsaklis - Proceedings of the 2005, American …, 2005 - ieeexplore.ieee.org
This paper studies the consensus problem of multi-agent systems in an asynchronous
framework. Under certain assumptions, the consensus protocol leads to stable behaviors …
framework. Under certain assumptions, the consensus protocol leads to stable behaviors …
Convergence rates in distributed consensus and averaging
A Olshevsky, JN Tsitsiklis - … of the 45th IEEE Conference on …, 2006 - ieeexplore.ieee.org
We propose three new algorithms for the distributed averaging and consensus problems:
two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates …
two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates …