Related papers: Consensus with Output Saturations
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, 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.…
This paper fully studies distributed optimal consensus problem in non-directed dynamical networks. We consider a group of networked agents that are supposed to rendezvous at the optimal point of a collective convex objective function. Each…
This article addresses the problem of average consensus in a multi-agent system when the desired consensus quantity is a time varying signal. Although this problem has been addressed in existing literature by linear schemes, only bounded…
Distributed consensus algorithm over networks of quantum systems has been the focus of recent studies in the context of quantum computing and distributed control. Most of the progress in this category have been on the convergence conditions…
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…
The paper investigates consensus problem for continuous-time multi-agent systems with time-varying communication graphs subject to process noises. Borrowing the ideas from input-to-state stability (ISS) and integral input-to-state stability…
Average consensus algorithms can be implemented over wireless sensor networks (WSN), where global statistics can be computed using communications among sensor nodes locally. Simple execution, robustness to global topology changes due to…
In this paper, we study the consensus problem for continuous-time and discrete-time multi-agent systems in state-dependent switching networks. In each case, we first consider the networks with fixed connectivity, in which the communication…
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…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
We consider the problems of reaching average consensus and solving consensus-based optimization over unreliable communication networks wherein packets may be dropped accidentally during transmission. Existing work either assumes that the…
In this paper, we investigate the consensus problem of second-order multiagent systems under directed graphs. Simple yet robust consensus algorithms that advance existing achievements in accounting for velocity and input constraints, agent…
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…
We consider the global consensus problem for multi-agent systems with input saturation over digraphs. Under a mild connectivity condition that the underlying digraph has a directed spanning tree, we use Lyapunov methods to show that the…
We study the average consensus problem of multi-agent systems for general network topologies with unidirectional information flow. We propose two (linear) distributed algorithms, deterministic and gossip, respectively for the cases where…
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…
It is intuitive and well known, that if agents in a multi-agent system iteratively update their states in the Euclidean space as convex combinations of neighbors' states, all states eventually converge to the same value (consensus),…
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…
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…