Finite-Time Synchronization of Complex Dynamical Networks With Input Saturation
In the framework of input saturation, this article studies the problem of finite-time synchronization (FTS) of a class of complex dynamical networks. By designing different classes of saturated controllers, two types of FTS criteria, including leader-follower synchronization and leaderless synchroni...
Saved in:
Published in | IEEE transactions on cybernetics Vol. 54; no. 1; pp. 1 - 9 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
United States
IEEE
01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In the framework of input saturation, this article studies the problem of finite-time synchronization (FTS) of a class of complex dynamical networks. By designing different classes of saturated controllers, two types of FTS criteria, including leader-follower synchronization and leaderless synchronization, are presented, respectively. A potential relationship between the saturation structure, the settling time, and the domain of attraction is established, which is crucial to achieve FTS. It shows that the saturation structure not only affects the estimation of domain of attraction but also possibly changes the settling time for FTS. Two numerical examples are presented to illustrate the effectiveness of the proposed results. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 2168-2267 2168-2275 2168-2275 |
DOI: | 10.1109/TCYB.2022.3228325 |