Related papers: Delay Robustness of Consensus Algorithms: Beyond T…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
We study the effect of communication delays on distributed consensus algorithms. Two ways to model delays on a network are presented. The first model assumes that each link delivers messages with a fixed (constant) amount of delay, and the…
In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the literature. Each node iteratively updates its state as a…
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree…
We study a simple random process in which vertices of a connected graph reach consensus through pairwise interactions. We compute outcome probabilities, which do not depend on the graph structure, and consider the expected time until a…
The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a…
In this paper, we study accelerating a Laplacian-based dynamic average consensus algorithm by splitting the conventional delay-free disagreement feedback into weighted summation of a current and an outdated term. We determine for what…
This paper concerns the consensus of discrete-time multi-agent systems with linear or linearized dynamics. An observer-type protocol based on the relative outputs of neighboring agents is proposed. The consensus of such a multi-agent system…
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…
This paper concerns the consensus and formation of a network of mobile autonomous agents in adversarial settings where a group of malicious (compromised) agents are subject to deception attacks. In addition, the communication network is…
We consider the problem of communication-constrained collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receiving data according to arbitrary unknown agent-specific…
This work shows an approach to achieve output consensus among heterogeneous agents in a multi-agent environment where each agent is subject to input constraints. The communication among agents is described by a time-varying…
In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected…
In this paper, we propose several consensus protocols of the first and second order for networked multi-agent systems and provide explicit representations for their asymptotic states. These representations involve the eigenprojection of the…
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…
We investigate notions of network centrality in terms of the underlying coupling graph of the network, structure of exogenous uncertainties, and communication time-delay. Our focus is on time-delay linear consensus networks, where…
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…
In this paper the problem of driving the state of a network of identical agents, modeled by boundary-controlled heat equations, towards a common steady-state profile is addressed. Decentralized consensus protocols are proposed to address…
Consensus conditions and convergence speeds are crucial for distributed consensus algorithms of networked systems. Based on a basic first-order average-consensus protocol with time-varying topologies and additive noises, this paper first…
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the consensus value lies within the convex hull of initial normal…