Related papers: Consensus Algorithms and the Decomposition-Separat…
We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide…
The class of nonlinear Markov processes is characterized by the dependence of the current state of the process on its current distribution in addition to the dependence on the previous state. Due to this feature, these processes are…
In the paper, we study a new rate of convergence estimate for homogeneous discrete-time nonlinear Markov chains based on the Markov-Dobrushin condition. This result generalizes the convergence estimates for any positive number of transition…
This work is concerned with stochastic consensus conditions of multi-agent systems with both time-delays and measurement noises. For the case of additive noises, we develop some necessary conditions and sufficient conditions for stochastic…
We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\ topology…
Multi agent consensus algorithms with update steps based on so-called balanced asymmetric chains, are analyzed. For such algorithms it is shown that (i) the set of accumulation points of states is finite, (ii) the asymptotic unconditional…
We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices…
In this technical note we address the problem of achieving consensus in a network of homogeneous nonlinear systems. The communication network is supposed to be switching within a finite set of topologies which may be disconnected for finite…
In a multi-agent system, unconditional (multiple) consensus is the property of reaching to (multiple) consensus irrespective of the instant and values at which states are initialized. For linear algorithms, occurrence of unconditional…
This paper is concerned with the study of synchronization and consensus phenomena in complex networks of diffusively-coupled nodes subject to external disturbances. Specifically, we make use of stochastic Lyapunov functions to provide…
A new theorem on conditions for convergence to consensus of a multiagent time-dependent time-discrete dynamical system is presented. The theorem is build up on the notion of averaging maps. We compare this theorem to results by Moreau (IEEE…
A theorem on (partial) convergence to consensus of multiagent systems is presented. It is proven with tools studying the convergence properties of products of row stochastic matrices with positive diagonals which are infinite to the left.…
Most algorithms for decentralized learning employ a consensus or diffusion mechanism to drive agents to a common solution of a global optimization problem. Generally this takes the form of linear averaging, at a rate of contraction…
The deterministic analog of the Markov property of a time-homogeneous Markov process is the semigroup property of solutions of an autonomous differential equation. The semigroup property arises naturally when the solutions of a differential…
The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
The non-consensus problems of high order linear time-invariant dynamical homogeneous multi-agent systems are concerned. Based on the conditions of consensus achievement, the mechanisms that lead to non-consensus motions are analyzed.…
This paper addresses the robust consensus problem under switching topologies. Contrary to existing methods, the proposed approach provides decentralized protocols that achieve consensus for networked multi-agent systems in a predefined…
In this paper we prove a sharp quantitative version of the Kendall's Theorem. The Kendal Theorem states that under some mild conditions imposed on a probability distribution on positive integers (i.e. probabilistic sequence) one can prove…
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of…