Related papers: A necessary and sufficient condition for discrete-…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory…
In this paper, we investigate distributed multi-agent tracking of a convex set specified by multiple moving leaders with unmeasurable velocities. Various jointly-connected interaction topologies of the follower agents with uncertainties are…
We study asymptotic dynamical patterns that emerge among a set of nodes interacting in a dynamically evolving signed random network, where positive links carry out standard consensus and negative links induce relative-state flipping. A…
We consider an infinite-horizon optimal control problem with an asymptotic terminal constraint. For the the weakly overtaking criterion and the overtaking criterion, necessary boundary conditions on co-state arcs are deduced, these…
In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed…
The paper presents a result which relates connectedness of the interaction graphs in a multi-agent systems with the capability for global convergence to a common equilibrium of the system. In particular we extend a previously known result…
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…
This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed…
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…
This paper presents a novel approach for resilient distributed consensus in multiagent networks when dealing with adversarial agents imprecision in states observed by normal agents. Traditional resilient distributed consensus algorithms…
Certain consensus seeking multi-agent systems can be formulated as gradient descent flows of a disagreement function. We study how known pathologies of gradient descent flows in Euclidean spaces carry over to consensus seeking systems that…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. By defining the graph filter from the consensus protocol, we establish the direct relation between average consensus of multi-agent systems…
This paper gives sufficient conditions for having complete synchronization of oscillators in connected undirected networks. The considered oscillators are not necessarily identical and the synchronization terms can be nonlinear. An…
This paper addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of…
This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed over time.…
We study asynchronous dynamics in a network of interacting agents updating their binary states according to a time-varying threshold rule. Specifically, agents revise their state asynchronously by comparing the weighted average of the…
In this paper, we present new results on consensus for continuous-time multi- agent systems. We introduce the assumptions of persistent connectivity of the interaction graph and of slow divergence of reciprocal interaction weights.…
In this paper, the behavior of scalar multi-agent systems over networks subject to time-driven jumps. Assuming that all agents communicate through distinct communication digraphs at jump and flow times, the asymptotic multi-consensus…
This paper introduces a novel approach of clustering, which is based on group consensus of dynamic linear high-order multi-agent systems. The graph topology is associated with a selected multi-agent system, with each agent corresponding to…