Related papers: Pinning consensus in networks of multiagents via a…
A theorem on (partial) convergence to consensus of multiagent systems is presented. It is proven with tools studying the convergence properties of products of row stochastic matrices with positive diagonals which are infinite to the left.…
This paper focuses on the consensus and formation problems of multiagent systems under unknown persistent disturbances. Specifically, we propose a novel method that combines an existing consensus (or formation) algorithm with a new…
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes…
This paper studies a consensus problem of multi-agent systems subjected to external disturbances over the clustered network. It considers that the agents are divided into several clusters. They are almost all the time isolated one from…
This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly…
In this paper, a discrete-time multi-agent system is presented which is formulated in terms of the delta operator. The proposed multi-agent system can unify discrete-time and continuous-time multi-agent systems. In a multi-agent network, in…
We present consensus analysis of systems with single integrator dynamics interacting via time-varying graphs under the event-triggered control paradigm. Event-triggered control sparsifies the control applied, thus reducing the control…
In this paper, the effects of graph gluing operations in networks of multi-agent systems and their impact on system performance are investigated. In many practical applications, multiple multi-agent subsystems must be interconnected through…
This paper addresses the problem of positive consensus of directed multi-agent systems with observer-type output-feedback protocols. More specifically, directed graph is used to model the communication topology of the multi-agent system and…
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 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…
This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random…
This paper addresses the problem of resilient consensus in the presence of misbehaving nodes. Although it is typical to assume knowledge of at least some nonlocal information when studying secure and fault-tolerant consensus algorithms,…
We consider the problem of identifying the topology of a weighted, undirected network $\mathcal G$ from observing snapshots of multiple independent consensus dynamics. Specifically, we observe the opinion profiles of a group of agents for a…
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…
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…
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…
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…
The consensus problem for multi-agent systems with quantized communication or sensing is considered. Centralized and distributed self-triggered rules are proposed to reduce the overall need of communication and system updates. It is proved…
In this paper, we propose matrix-scaled consensus algorithms for linear dynamical agents interacting over an undirected network. Under the proposed algorithms, the state vectors of all agents to asymptotically agree up to some matrix…