Open AccessConsensus of semi‐Markov multi‐agent systems with stochastically unmatched topologies
Author(s) -
Wang Guoliang,
Huang Yifan,
Wang Xiaoqiang
Publication year - 2021
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/cth2.12098
Subject(s) - probability density function , dwell time , control theory (sociology) , markov chain , mathematics , network topology , conditional probability , lyapunov function , multi agent system , markov process , topology (electrical circuits) , invertible matrix , controller (irrigation) , stochastic matrix , computer science , mathematical optimization , control (management) , artificial intelligence , statistics , combinatorics , medicine , clinical psychology , physics , nonlinear system , quantum mechanics , pure mathematics , agronomy , biology , operating system
This paper addresses the consensus problem of semi‐Markov multi‐agent systems, where the topology switching is stochastically unmatched to the original switching. The unmatched property is described by a stochastically conditional probability and quantized by a given transition probability density function (PDF). Then a consensus protocol based on the aforementioned topology is proposed and includes mode‐dependent and ‐independent control inputs as special cases. Based on the Lyapunov function approach and some enlarging techniques, sufficient LMI conditions are presented to solve the controller directly. All the features such as conditional probability, dwell time and transition probability are involved. An improved method but needing nonsingular expectation of the truncated PDF matrix is also proposed. A practical example is offered so as to verify the effectiveness and superiority of the methods proposed in this study.