z-logo
open-access-imgOpen Access
Synchronisation control of dynamical networks subject to variable sampling and actuators saturation
Author(s) -
Wu YuanQing,
Su Hongye,
Wu ZhengGuang
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.0383
Subject(s) - control theory (sociology) , aperiodic graph , actuator , upper and lower bounds , sawtooth wave , mathematics , sampling (signal processing) , controller (irrigation) , lyapunov function , mathematical optimization , computer science , control (management) , nonlinear system , mathematical analysis , combinatorics , artificial intelligence , physics , filter (signal processing) , quantum mechanics , agronomy , computer vision , biology
This study investigates aperiodic sampled‐data synchronisation of complex dynamical network (CDN) incorporate dynamics of actuators saturation. The sampling intervals considered here are time‐varying which allowed to be variable within the lower and upper bounds. In order to fully captures the sawtooth structure characteristic of the sampled‐data systems, a novel time‐dependent continuous Lyapunov functional is employed to obtain less conservative criteria. Furthermore, the generalised sector bound condition is utilised for the estimate about the basin of the attraction. Based on the local stability condition, the sampled‐data controller is constructed to guarantee the synchronisation of CDN in the presence of actuators saturation. The obtained sufficient conditions can be cast in two optimisation cases to maximise the admissible upper bound of sampling instants or enlarge estimate about the domain of attraction for the closed‐loop systems. Subsequently, the validity and applicability of the criteria are verified through numerical examples.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here