z-logo
open-access-imgOpen Access
Adaptive dynamic programming method‐based synchronisation control of a class of complex dynamical networks with unknown dynamics and actuator faults
Author(s) -
Xiao Xiang,
Li XiaoJian
Publication year - 2018
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.2017.0845
Subject(s) - control theory (sociology) , adaptive control , actuator , computer science , lyapunov function , controller (irrigation) , a priori and a posteriori , convergence (economics) , bounded function , fault tolerance , dynamic programming , control engineering , control (management) , mathematics , engineering , nonlinear system , algorithm , artificial intelligence , distributed computing , mathematical analysis , philosophy , physics , epistemology , quantum mechanics , agronomy , economics , biology , economic growth
This study is concerned with the adaptive fault‐tolerant synchronisation control problem for a class of complex dynamic networks with unknown internal dynamics and actuator faults. A controller which consists of adaptive fault‐tolerant control laws and a static feedback gain is designed to achieve the synchronisation. A modified iterative algorithm via adaptive dynamic programming technique is developed to compute the static feedback gain, and based on which adaptive fault‐tolerant control laws are then designed, without requiring the a priori knowledge of the system matrices, to compensate the actuator faults. Furthermore, the asymptotic convergence of synchronisation errors is rigidly analysed by combining graph theory and Lyapunov theory, and all the other signals in synchronised error system are also proved to be bounded. Finally, a simulation example is illustrated to demonstrate the effectiveness of the proposed method.

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