Mean Square Consensus of General Linear Multiagent Systems with Communication Noises under Switching Topologies

Abstract

This paper investigates the distributed consensus problem of general linear multiagent systems (MASs) with communication noises under fixed and Markovian switching topologies, respectively. Each agent can obtain full state of itself and receive its neighbors’ state with noises, where intensities of noises are vector functions of relative states of agents. Bearing in mind the above constrains, a consensus protocol is proposed, where the gain matrix is obtained by the algebraic Riccati equation and the coupling strength is restricted in a given interval. By using the stochastic stability theorem, we show that mean square consensus is achieved in fixed topology case and switching topologies case, respectively. Furthermore, an estimation of the exponential convergence rate of consensus is given explicitly. Finally, simulation examples are given to show the correctness of the proposed results.

Dynamic event‐triggered leader‐following consensus of nonlinear multi‐agent systems with measurement noises

“…In recent years, researchers have paid attention to the study of distributed coordination technology of multi-agent systems [1][2][3][4]. The consensus problem is generally considered a basic distributed coordination problem, which can generally be divided into two classes: leaderless consensus and leader-following consensus.…”