Regional consensus of linear differential inclusions subject to input saturation

Summary In this article, we consider regional consensus problem for a group of identical linear systems represented by a linear differential inclusion over an undirected communication topology. Each vertex system of the linear differential inclusion is represented by a general linear system subject...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of robust and nonlinear control Vol. 30; no. 6; pp. 2461 - 2474
Main Authors Song, Qilin, Li, Yuanlong, Lin, Zongli
Format Journal Article
LanguageEnglish
Published Bognor Regis Wiley Subscription Services, Inc 01.04.2020
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Summary In this article, we consider regional consensus problem for a group of identical linear systems represented by a linear differential inclusion over an undirected communication topology. Each vertex system of the linear differential inclusion is represented by a general linear system subject to input saturation, and hence only regional consensus can be achieved. For given saturated distributed linear control protocols, we establish a set of conditions under which these control protocols achieve regional consensus and a level set of a Laplacian quadratic function can be used as an estimate of the domain of consensus. These conditions are given in the form of matrix inequalities and involve the properties of the communication topology. Based on these matrix inequalities, we formulate a linear matrix inequalities based optimization problem for obtaining as large an estimate of the domain of consensus as possible. By viewing the gain matrix in the consensus algorithms as an additional variable, this optimization problem can be adapted for the design of the consensus protocols. Simulation results illustrate the effectiveness of our proposed approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1049-8923
1099-1239
DOI:10.1002/rnc.4899