Consensus of heterogeneous discrete‐time multi‐agent systems with noise over Markov switching topologies
Fenglan Sun, Chengyu Lei, Jürgen Kurths
Abstract
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.
Topics & Concepts
Multi-agent systemCorrectnessNetwork topologyDiscrete time and continuous timeBounded functionMarkov chainNoise (video)Lyapunov functionComputer scienceMathematicsConsensusMathematical optimizationControl theory (sociology)Topology (electrical circuits)AlgorithmControl (management)Artificial intelligenceMachine learningNonlinear systemStatisticsCombinatoricsPhysicsImage (mathematics)Operating systemMathematical analysisQuantum mechanicsDistributed Control Multi-Agent SystemsNeural Networks Stability and SynchronizationOpportunistic and Delay-Tolerant Networks