You are not logged in.

Synchronization of discrete-time Markovian jump complex dynamical networks with random delays via non-fragile control

Rakkiyappan, R., Sasirekha, R., Shanmugam, L. and Lim, C.P. 2016, Synchronization of discrete-time Markovian jump complex dynamical networks with random delays via non-fragile control, Journal of the Franklin Institute, vol. 353, no. 16, pp. 4300-4329, doi: 10.1016/j.jfranklin.2016.07.024.

Attached Files
Name Description MIMEType Size Downloads

Title Synchronization of discrete-time Markovian jump complex dynamical networks with random delays via non-fragile control
Author(s) Rakkiyappan, R.
Sasirekha, R.
Shanmugam, L.ORCID iD for Shanmugam, L. orcid.org/0000-0002-4622-3782
Lim, C.P.ORCID iD for Lim, C.P. orcid.org/0000-0003-4191-9083
Journal name Journal of the Franklin Institute
Volume number 353
Issue number 16
Start page 4300
End page 4329
Total pages 30
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2016-11
ISSN 0016-0032
Keyword(s) Science & Technology
Technology
Physical Sciences
Automation & Control Systems
Engineering, Multidisciplinary
Engineering, Electrical & Electronic
Mathematics, Interdisciplinary Applications
Engineering
Mathematics
STOCHASTIC NEURAL-NETWORKS
H-INFINITY CONTROL
VARYING DELAYS
STATE ESTIMATION
GLOBAL SYNCHRONIZATION
STABILITY ANALYSIS
SYSTEMS
PARAMETERS
STABILIZATION
CRITERIA
Summary In this proposed article, a framework is presented for the analysis of the problem of synchronization of Markovian jumping discrete-time complex dynamical networks (CDNs) with probabilistic interval time-varying delay in the dynamical node and in the network coupling. The networks are expressed in terms of Kronecker product technique. The delay in time is taken to be unexpected and the probability distribution is known a prior. The synchronization is achieved by introducing a non-fragile procedure. This controller is subject to randomly occurring perturbation and is assumed to belong to the Binomial sequence. A suitable Lyapunov–Krasovskii functional (LKF) with triple summation terms is considered. By utilizing the reciprocal convex combination approach and Finsler׳s Lemma, conditions for the synchronization of networks are established in terms of linear matrix inequalities (LMIs). The effectiveness of the results obtained theoretically are illustrated through two numerical examples.
Language eng
DOI 10.1016/j.jfranklin.2016.07.024
Field of Research 0102 Applied Mathematics
0906 Electrical And Electronic Engineering
Socio Economic Objective 0 Not Applicable
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2016, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30089099

Document type: Journal Article
Collection: Centre for Intelligent Systems Research
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 7 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Mon, 03 Apr 2017, 10:25:45 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.