z-logo
Premium
Consensus of data‐sampled multi‐agent systems with Markovian switching topologies
Author(s) -
Zhao Huanyu,
Xu Shengyuan,
Yuan Deming
Publication year - 2012
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.444
Subject(s) - network topology , consensus , linearization , multi agent system , markov process , control theory (sociology) , markov chain , computer science , square (algebra) , stability (learning theory) , mathematics , mathematical optimization , control (management) , artificial intelligence , nonlinear system , statistics , machine learning , physics , geometry , quantum mechanics , operating system
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. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here