Related papers: Consensus in Complex Networks with Noisy Agents an…
This paper focuses on the problem of distributed consensus control of multi-agent systems while considering two main practical concerns (i) stochastic noise in the agent dynamics and (ii) predefined performance constraints over evolutions…
The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…
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…
Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and…
By incorporating a multilayer network and time-decaying memory into the original voter model, the coupled effects of spatial and temporal cumulation of peer pressure on consensus are investigated. Heterogeneity in peer pressure and…
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, cluster consensus of multi-agent systems is studied via inter-cluster nonidentical inputs. Here, we consider general graph topologies, which might be time-varying. The cluster consensus is defined by two aspects: the…
We study a general framework for broadcast gossip algorithms which use companion variables to solve the average consensus problem. Each node maintains an initial state and a companion variable. Iterative updates are performed asynchronously…
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…
We study the consensus formation for an agents based model, generalizing that originally proposed by Krause \cite{Kr}, by allowing the communication channels between any couple of agents to be switched on or off randomly, at each time step,…
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…
In this paper, we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics and vector-valued agent states. This allows us to explore how measurement and process noise affect consensus on…
This paper investigates the differentially private bipartite consensus algorithm over signed networks. The proposed algorithm protects each agent's sensitive information by adding noise with time-varying variances to the…
We have recently proposed a "surplus-based" algorithm which solves the multi-agent average consensus problem on general strongly connected and static digraphs. The essence of that algorithm is to employ an additional variable to keep track…
This paper addresses the distributed consensus design problem for linear multi-agent systems with directed communication graphs and external disturbances. Both the cases with strongly connected communication graphs and leader-follower…
We consider resilient versions of discrete-time multi-agent consensus in the presence of faulty or even malicious agents in the network. In particular, we develop event-triggered update rules which can mitigate the influence of the…
Contemporary technological challenges often involve many degrees of freedom in a distributed or networked setting. Three aspects are notable: the variables are usually associated with the nodes of a graph with limited communication…
In this paper, we consider the consensus problem of hybrid multi-agent system. First, the hybrid multi-agent system is proposed which is composed of continuous-time and discrete-time dynamic agents. Then, three kinds of consensus protocols…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus…
In this paper we propose a novel consensus protocol for discrete-time multi-agent systems (MAS), which solves the dynamic consensus problem on the max value, i.e., the dynamic max-consensus problem. In the dynamic max-consensus problem to…