Consensus of data‐sampled multi‐agent systems with Markovian switching topologies

This paper studies the consensus problem of data‐sampled multi‐agent systems with Markovian switching topologies. Two different consensus algorithms are considered. By a system transformation, the mean‐square consensus problem of multi‐agent systems is converted into the mean‐square stability problem of Markov jump systems. Necessary and sufficient conditions of mean‐square consensus are obtained. The cone complementary linearization algorithm is used to get the allowable control gain. Simulation examples are given to show the effectiveness of the results.