Constructive conditions for consensus of multi‐agents under fast switching networks: A time‐delay approach

This article studies consensus problem of multi‐agent systems under fast switching networks depending on a small parameter ε>0$$ \varepsilon >0 $$. In contrast to the existing methods that are qualitative, we present, for the first time, constructive and quantitative results for finding an upp...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of robust and nonlinear control Vol. 33; no. 1; pp. 659 - 679
Main Authors Zhang, Jin, Shi, Jing, Ding, Lei, Peng, Chen
Format Journal Article
LanguageEnglish
Published Bognor Regis Wiley Subscription Services, Inc 10.01.2023
Subjects
Online AccessGet full text
ISSN1049-8923
1099-1239
DOI10.1002/rnc.6413

Cover

Loading…
More Information
Summary:This article studies consensus problem of multi‐agent systems under fast switching networks depending on a small parameter ε>0$$ \varepsilon >0 $$. In contrast to the existing methods that are qualitative, we present, for the first time, constructive and quantitative results for finding an upper bound on ε$$ \varepsilon $$ that preserves the consensus and for designing the consensus protocol that includes the designs of continuous‐time controller and of sampled‐data controller. We first employ a time‐delay approach to periodic averaging for continuous‐time control of multi‐agent systems under fast switching networks leading to a time‐delay model where the delay length is equal to ε$$ \varepsilon $$. We construct an appropriate Lyapunov functional for finding sufficient stability conditions in the form of linear matrix inequalities (LMIs). The upper bound on ε$$ \varepsilon $$ that preserves the exponential stability is found from LMIs. Moreover, sufficient conditions on the existence of controller gain are, for the first time, derived for the multi‐agent systems under fast switching networks. For the implementation of consensus protocol, we further extend our method to sampled‐data consensus of multi‐agent systems under fast switching networks where additional Lyapunov functionals are presented to compensate the term due to the sampling. Finally, an example of Caltech multivehicle wireless test bed vehicles is given to illustrate the efficiency of the method.
Bibliography:Funding information
Israel Science Foundation, Grant/Award Number: 673/19; National Key Research and Development Program of China, Grant/Award Number: 2020YFB1708200; National Natural Science Foundation of China, Grant/Award Numbers: 61833011; 62173218
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1049-8923
1099-1239
DOI:10.1002/rnc.6413