相关论文: Multi-agent consensus over time-invariant and time…
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…
State convergence is essential in several scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, monotone game theory, multi-agent learning over time-varying networks. This paper is the first on state…
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 considers the consensusability of multi-agent systems with delay and packet dropout. By proposing a kind of predictor-like protocol, sufficient and necessary conditions are given for the mean-square consensusability in terms of…
This paper examines the cluster consensus problem of multi-agent systems on matrix-weighted switching networks. Necessary and/or sufficient conditions under which cluster consensus can be achieved are obtained and quantitative…
This paper investigates structural herdability in a special class of temporally switching networks with fixed topology. We show that when the underlying digraph remains unchanged across all snapshots, the network attains complete SS…
This work is concerned with the stability properties of linear stochastic differential equations with random (drift and diffusion) coefficient matrices, and the stability of a corresponding random transition matrix (or exponential…
In this paper, we consider the consensus problem of switched multi-agent system composed of continuous-time and discrete-time subsystems. By combining the classical consensus protocols of continuous-time and discrete-time multi-agent…
This paper characterizes the graphical properties of an optimal topology with minimal Laplacian energy under the constraint of fixed numbers of vertices and edges, and devises an algorithm to construct such connected optimal graphs. These…
We discuss the possibility of reaching consensus in finite time using only linear iterations, with the additional restrictions that the update matrices must be stochastic with positive diagonals and consistent with a given graph structure.…
Two finite-time consensus protocols are proposed for multi-dimensional multi-agent systems, using direction-preserving and component-wise signum controls respectively. Filippov solutions and non-smooth analysis techniques are adopted to…
Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We…
We derive a generalization of the Perron-Frobenius theorem to time-varying row-stochastic matrices as follows: using Kolmogorov's concept of absolute probability sequences, which are time-varying analogs of principal eigenvectors, we…
This paper is concerned with the consensus problem for multi-agent systems subject to communication delays between the neighboring agents. We consider a scenario where each agent is characterized by a general high-order linear system and…
In this paper, we provide a theoretical analysis for nonlinear discontinuous consensus protocols in networks of multiagents over weighted directed graphs. By integrating the analytic tools from nonsmooth stability analysis and graph theory,…
For most existing prescribed performance formation control methods, performance requirements are not directly imposed on the relative states between agents but on the consensus error, which lacks a clear physical interpretation of their…
Reaction-diffusion processes on networked systems have received mounting attention in the past two decades, and the corresponding theory of network dynamics has been continuously enriched with the advancement of network science. Recently,…
This study develops an original and innovative matrix representation with respect to the information flow for networked multi-agent system. To begin with, the general concepts of the edge Laplacian of digraph are proposed with its algebraic…
This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize…
We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…