
Containment control of second‐order discrete‐time multi‐agent systems with Markovian missing data
Author(s) -
Mu Xiaowu,
Zheng Baojie
Publication year - 2015
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2014.0895
Subject(s) - convex hull , control theory (sociology) , discrete time and continuous time , controller (irrigation) , markov process , markov chain , mathematics , containment (computer programming) , linear matrix inequality , actuator , mathematical optimization , computer science , control (management) , regular polygon , statistics , geometry , artificial intelligence , agronomy , biology , programming language
This study investigates the containment control problem of second‐order discrete‐time multi‐agent systems with Markovian missing data in actuators and one step network‐induced time delay. The process of missing data from the controller to the actuator is modelled by a homogeneous, finite‐state and discrete‐time Markov chain. The authors first discuss the containment control problem for the case when all the elements of the transition probability matrix are completely known, then the result is extended to a more general case with only partially known transition probabilities. The distributed control protocol with one step time delay is proposed. Based on the stochastic Lyapunov–Krasovskii functional method, sufficient conditions in terms of a set of matrix inequalities are given to guarantee that the states of all the followers asymptotically converge to the convex hull formed by the corresponding states of the leaders in mean square sense. A cone complementary linearisation algorithm is used to obtain the control gains. Finally, two numerical simulations are provided to show the effectiveness of theoretical results.