Brunel University Research Archive (BURA) >
School of Information Systems, Computing and Mathematics >
School of Information Systems, Computing and Mathematics Research Papers >
Please use this identifier to cite or link to this item:
|Title: ||Global synchronization control of general delayed discrete-time networks with stochastic coupling and disturbances|
|Authors: ||Liang, J|
|Keywords: ||Control law|
Linear matrix inequality (LMI)
|Publication Date: ||2008|
|Citation: ||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 38(4): 1073 - 1083, Aug 2008|
|Abstract: ||In this paper, the synchronization control problem is considered for two coupled discrete-time complex networks with time delays. The network under investigation is quite general to reflect the reality, where the state delays are allowed to be time varying with given lower and upper bounds, and the stochastic disturbances are assumed to be Brownian motions that affect not only the network coupling but also the overall networks. By utilizing the Lyapunov functional method combined with linear matrix inequality (LMI) techniques, we obtain several sufficient delay-dependent conditions that ensure the coupled networks to be globally exponentially synchronized in the mean square. A control law is designed to synchronize the addressed coupled complex networks in terms of certain LMIs that can be readily solved using the Matlab LMI toolbox. Two numerical examples are presented to show the validity of our theoretical analysis results.|
|Description: ||Copyright  IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.|
|Sponsorship: ||This work was supported by the Royal Society Sino-British Fellowship Trust Award of the
|Appears in Collections:||School of Information Systems, Computing and Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.