Related papers: Cluster Consensus on Matrix-weighted Switching Net…
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each…
In this work, we study the consensus problem in which legitimate agents send their values over an undirected communication network in the presence of an unknown subset of malicious or faulty agents. In contrast to former works, we…
In this paper, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented. By…
This work considers the problem of resilient consensus where stochastic values of trust between agents are available. Specifically, we derive a unified mathematical framework to characterize convergence, deviation of the consensus from the…
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 paper focuses on analyzing the finite-time convergence of a nonlinear consensus algorithm for multi-agent networks with unknown inherent nonlinear dynamics. Due to the existence of the unknown inherent nonlinear dynamics, the stability…
We consider multi-agent systems with cooperative interactions and study the convergence to consensus in the case of time-dependent connections, with possible communication failure. We prove a new condition ensuring consensus: we define a…
We consider a linear consensus system with n agents that can switch between r different connectivity patterns. A natural question is which switching law yields the best (or worst) possible speed of convergence to consensus? We formulate…
A novel approach rooted on the notion of consensus clustering, a strategy developed for community detection in complex networks, is proposed to cope with the heterogeneity that characterizes connectivity matrices in health and disease. The…
With a steady increase in the inverter technology integration to the grid, frequency response of the large inter-connection system becomes more unpredictable. This leads to a significant change in the boundaries of the coherent region,…
This paper addresses the finite-time non-overshooting leader-following consensus problem for multi-agent systems, whose agents are modeled by a dynamical system topologically equivalent to the integrator chain. Based on the weighted…
The structural balance of a signed graph is known to be necessary and sufficient to obtain a bipartite consensus among agents with friend-foe relationships. In the real world, relationships are multifarious, and the coexistence of different…
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…
Many algorithms have been proposed in prior literature to guarantee resilient multi-agent consensus in the presence of adversarial attacks or faults. The majority of prior work present excellent results that focus on discrete-time or…
This paper considers the multi-dimensional consensus in networked systems, where some of the agents might be misbehaving (or faulty). Despite the influence of these misbehaviors, the benign agents aim to reach an agreement while avoiding…
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…
This article provides an introduction to event-triggered coordination for multi-agent average consensus. We provide a comprehensive account of the motivations behind the use of event-triggered strategies for consensus, the methods for…
Our goal is to find a necessary and sufficient condition on the consensus over a random network, generated by i.i.d. stochastic matrices. We show that the consensus problem in three different convergence modes (almost surely, in…
We consider the problem of steering a multi-agent system to multi-consensus, namely a regime where groups of agents agree on a given value which may be different from group to group. We first address the problem by using distributed…
A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple…