Consensus of heterogeneous discrete‐time multi‐agent systems with noise over Markov switching topologies

Abstract

This paper considers the mean‐square bounded consensus of heterogeneous discrete‐time multi‐agent systems with noise over fixed and Markov switching topologies. Firstly, a protocol is designed based on the agents' neighbor information with noise. Secondly, by using the Lyapunov function method, matrix analysis and probability theory, sufficient conditions for the mean‐square bounded consensus are given. Finally, several simulations are presented to illustrate the potential correctness of the results.

Bounded Consensus of Discrete Stochastic Double-Integrator Multi-Agent Systems Over Switching Topologies

“…In the fixed topology, we give the following form of consensus protocol: Inspired by the work [39], we give the following definition.…”

Mean square leader‐following consensus of heterogeneous multi‐agent systems with Markovian switching topologies and communication delays

“…Specifically, the communication channel among agents in MASs is vulnerable to uncertainties in the form of random packet dropouts, random link failure, channel fading, and communication delays, which often lead to poor performance and even instability of the concerned MASs. Therefore, increasing attention has been paid to consensus problems of MASs under randomly switching topologies and many significant results have been reported, see for example, References 22‐34. Particularly, in References 22‐26, consensus problems of homogeneous MASs have been investigated under some special randomly switching topologies, like Bernoulli switching topologies 22,23 as well as balanced and undirected topologies 24‐26 .…”

“…It is noted that most of those existing works 22‐43 mentioned above address consensus problems of MASs by taking only either Markovian switching topologies or communication time delays into consideration. However, in real‐world applications, Markovian switching topologies and communication time delays often occur simultaneously and they should be handled at the same time.…”

“…[24][25][26] However, in real-world systems, Markov process is more suitable to model randomly switching topologies, where the probability of selecting every potential topology is only related to the last selection. For linear MASs with directed Markovian switching topologies, mean square consensus problems have been well investigated recently for single or double integrator agent dynamics, [27][28][29][30] homogeneous agent dynamics, 31,32 and heterogeneous agent dynamics. 33,34 On the other hand, communication time delays are an inherent property and often cause the instability and poor performance of MASs.…”

Switched Fractional Order Multiagent Systems Containment Control with Event-Triggered Mechanism and Input Quantization

“…Multiagent systems (MASs) cooperative control technology has been widely used in many fields [1][2][3][4]. As the most basic research content of multiagent cooperative control, the consensus problem has made much progress [5][6][7][8][9][10][11].…”