Abstract
AbstractThis 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
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
