Related papers: Discrete-Time Matrix-Weighted Consensus
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…
This paper investigates the fixed-time consensus problem for a class of multi-agent systems with simple dynamics. Unlike the traditional way to realize fixed-time convergence, a novel strategy using the property of periodic functions is…
In this paper, we study asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented only based on the state information at some…
This paper studies the consensus problem of general linear discrete-time multi-agent systems (MAS) with input constraints and bounded time-varying communication delays. We propose a robust distributed model predictive control (DMPC)…
This paper analyzes consensus in multi-agent systems under uniform and nonuniform communication delays, a key challenge in distributed coordination with applications to robotic swarms. It investigates the convergence of a consensus…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
Solving an output consensus problem in multi-agent systems is often hindered by multiple time-variant delays. To address such fundamental problems over time, we present a new optimal time-variant distributed control for linearly perturbed…
This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics. Two distributed adaptive dynamic consensus protocols are proposed, based on the relative output information of…
We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control…
We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete-continuous) linear switching systems on graphs, in…
This paper addresses the distributed consensus problem for a linear multi-agent system with switching directed communication topologies. By appropriately introducing a linear transformation, the consensus problem is equivalently converted…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
In this paper, robust finite-time consensus of a group of nonlinear multi-agent systems in the presence of communication time delays is considered. In particular, appropriate delay-dependent strategies which are less conservative are…
In this paper, we consider the consensus problem of dynamical multiple agents that communicate via a directed moving neighborhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each…
Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
This paper is concerned with the leader-following consensus problem for a class of Lipschitz nonlinear multi-agent systems with uncertain dynamics, where each agent only transmits its noisy output, at discrete instants and independently…
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to…
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…
Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…