Related papers: New Results on Delay Robustness of Consensus Algor…
In this work we study the problem of unconstrained convex-optimization in a fully distributed multi-agent setting which includes asynchronous computation and lossy communication. In particular, we extend a recently proposed algorithm named…
In this paper, we study the discrete-time consensus problem over networks with antagonistic and cooperative interactions. Following the work by Altafini [IEEE Trans. Automatic Control, 58 (2013), pp. 935--946], by an antagonistic…
Representation of a swarm of independent robotic agents under graph-theoretic constructs allows for more formal analysis of convergence properties. We consider the local and global convergence behavior of an N-member swarm of agents in a…
In this paper we focus on the distributed quantized average consensus problem in open multi-agent systems consisting of dynamic directed communication links among active nodes. We propose three communication-efficient distributed algorithms…
In this paper, we consider the consensus problem of switched multi-agent system composed of continuous-time and discrete-time subsystems. By combining the classical consensus protocols of continuous-time and discrete-time multi-agent…
In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact…
This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly…
In multi-agent systems, heterogeneous time delays exist for all agents because of the difference in communication environments. Therefore, the consensus analysis of a system considering a homogeneous time-varying delay among all agents…
Consensusability is an important property for many multi-agent systems (MASs) as it implies the existence of networked controllers driving the states of MAS subsystems to the same value. Consensusability is of interest even when the MAS…
This paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents. This problem consists of designing a distributed algorithm that enables a group of agents with communication and computation…
In this paper, we address the discrete-time average consensus problem in strongly connected directed graphs, where nodes exchange information over unreliable error-prone communication links. We enhance the Robustified Ratio Consensus…
This paper proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or…
Reaching consensus among states of a multi-agent system is a key requirement for many distributed control/optimization problems. Such a consensus is often achieved using the standard Laplacian matrix (for continuous system) or Perron matrix…
This brief addresses the distributed consensus problem of nonlinear multi-agent systems under a general directed communication topology. Each agent is governed by higher-order dynamics with mismatched uncertainties, multiple completely…
This paper proposes two algorithms, namely "back-tracking" and "history following", to reach consensus in case of communication loss for a network of distributed agents with switching topologies. To reach consensus in distributed control,…
There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept…
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…
Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries).…
This paper studies the consensus control problem faced with three essential demands, namely, discrete control updating for each agent, discrete-time communications among neighboring agents, and the fully distributed fashion of the…
Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper…