Finite-time H-infinity synchronization for complex networks with semi-Markov jump topology

Title
Finite-time H-infinity synchronization for complex networks with semi-Markov jump topology
Author(s)
박주현H. Shen[H. Shen]Z.G. Wu[Z.G. Wu]Z. Zhang[Z. Zhang]
Keywords
DELAYED NEURAL-NETWORKS; SMALL-WORLD NETWORKS; DYNAMICAL NETWORKS; VARYING DELAYS; EXPONENTIAL SYNCHRONIZATION; ROBUST SYNCHRONIZATION; SWITCHING TOPOLOGY; NEUTRAL-TYPE; SYSTEMS; PARAMETERS
Issue Date
201507
Publisher
ELSEVIER SCIENCE BV
Citation
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, v.24, no.1-3, pp.40 - 51
Abstract
This paper investigates the problem of finite-time H-infinity synchronization for complex networks with time-varying delays and semi-Markov jump topology. The network topologies are assumed to switch from one to another at different instants. Such a switching is governed by a semi-Markov process which are time-varying and dependent on the sojourn-time h. Attention is focused on proposing some synchronization criteria guaranteeing the underlying network is stochastically finite-time H-infinity synchronized. By using the properties of Kronecker product combined with the Lyapunov-Krasovskii method, the solutions to the finite-time H-infinity synchronization problem are formulated in the form of low-dimensional linear matrix inequalities. Finally, a numerical example is given to demonstrate the effectiveness of our proposed approach. (C) 2014 Elsevier B.V. All rights reserved.
URI
http://hdl.handle.net/YU.REPOSITORY/31579http://dx.doi.org/10.1016/j.cnsns.2014.12.004
ISSN
1007-5704
Appears in Collections:
공과대학 > 전기공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE