Research Article Finite-Time Synchronization of Singular Hybrid Coupled Networks Cong Zheng

advertisement
Hindawi Publishing Corporation
Journal of Applied Mathematics
Volume 2013, Article ID 378376, 8 pages
http://dx.doi.org/10.1155/2013/378376
Research Article
Finite-Time Synchronization of Singular Hybrid
Coupled Networks
Cong Zheng1 and Jinde Cao1,2
1
Research Center for Complex Systems and Network Sciences, and Department of Mathematics, Southeast University,
Nanjing 210096, China
2
Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia
Correspondence should be addressed to Jinde Cao; jdcao@seu.edu.cn
Received 20 December 2012; Accepted 11 February 2013
Academic Editor: Jong Hae Kim
Copyright © 2013 C. Zheng and J. Cao. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper investigates finite-time synchronization of the singular hybrid coupled networks. The singular systems studied in this
paper are assumed to be regular and impulse-free. Some sufficient conditions are derived to ensure finite-time synchronization of
the singular hybrid coupled networks under a state feedback controller by using finite-time stability theory. A numerical example
is finally exploited to show the effectiveness of the obtained results.
1. Introduction
In recent years, singular systems, also known as descriptor systems, generalized state-space systems, differentialalgebraic systems, or semistate systems, are attracting more
and more attentions from many fields of scientific research
because they can better describe a larger class of dynamic
systems than the regular ones. Many results of regular systems
have been extended to the area about singular systems such
as [1–21]. For example, stability (robust stability or quadratic
stability) and stabilization for singular systems have been
studied via LMI approach in [2–8]; robust control (or 𝐻2 ,
𝐻∞ control and robust dissipative filtering) for singular
systems has been discussed in [9–16]; synchronization (or
state estimation) for singular complex networks has been
considered in [17–21].
Synchronization is an interesting and important characteristic in the coupled networks. There are a lot of results
in regular coupled networks. Recently, some authors study
synchronization of the singular systems such as [17–21] and
the references therein. In [17], Xiong et al. introduced the
singular hybrid coupled systems to describe complex network
with a special class of constrains. They gave a sufficient
condition for global synchronization of singular hybrid
coupled system with time-varying nonlinear perturbation
based on Lyapunov stability theory. Synchronization issues
are studied for singular systems with delays by using Linear
Matrix Inequality (LMI) approach [18]. Koo et al. considered
synchronization of singular complex dynamical network
with time-varying delays [19]. Li et al. in [20] investigated
synchronization and state estimation for singular complex
dynamical networks with time-varying delays. Li et al. in
[21] investigated robust 𝐻∞ control of synchronization for
uncertain singular complex delayed networks with stochastic
switched coupling.
Finite-time synchronization or finite-time control is
interesting topic for its practical application. There are some
results on finite-time stability [22–26], finite-time synchronization [27–33], finite-time consensus or agreement [34–
37], and finite-time observers [38]. However, these results are
obtained for regular systems. Up to now, to the best of our
knowledge, few authors studied finite-time synchronization
of singular hybrid coupled systems whose structures are more
complex than those in [27–33]. Considering the important
role of synchronization of complex networks, the finite-time
synchronization of singular hybrid coupled networks is worth
studying.
Motivated by the previous discussions, in this paper,
we investigate finite-time synchronization of singular hybrid
complex systems. Some sufficient conditions for it are
2
Journal of Applied Mathematics
obtained by the state feedback controller based on the finitetime stability theory. Finally, a numerical example is exploited
to illustrate the effectiveness of the obtained result.
The rest of this paper is organized as follows. In Section 2,
a singular hybrid coupled system is given, and some preliminaries are briefly outlined. In Section 3, some sufficient
criteria are derived for the finite-time synchronization of
the proposed singular system by the feedback controller. In
Section 4, an example is provided to show the effectiveness of
the obtained results. Some conclusions are finally drawn in
Section 5.
2. Model Formulation and Some Preliminaries
(1)
𝑖 = 1, 2, . . . , 𝑁,
where π‘₯𝑖 (𝑑) = (π‘₯𝑖1 (𝑑), π‘₯𝑖2 (𝑑), . . . , π‘₯𝑖𝑛 (𝑑))𝑇 ∈ R𝑛 represents the
state vector of the 𝑖th node, 𝐴, 𝐸 ∈ R𝑛×𝑛 are constant matrices,
and 𝐸 may be singular. Without loss of generality, we will
assume that 0 < rank(𝐸) = π‘Ÿ < 𝑛. 𝑓(π‘₯𝑖 (𝑑), 𝑑) is a vector-value
function. The constant 𝑐 > 0 denotes the coupling strength,
and Γ = diag(𝛾1 , 𝛾2 , . . . , 𝛾𝑛 ) ∈ R𝑛×𝑛 is inner-coupling matrix
between nodes. 𝐡 = (𝑏𝑖𝑗 )𝑁×𝑁 describes the linear coupling
configuration of the network, which satisfies
𝑏𝑖𝑗 = 𝑏𝑗𝑖 ,
𝑁
𝑏𝑖𝑖 = − ∑ 𝑏𝑖𝑗 ,
for 𝑖 =ΜΈ 𝑗,
𝑖 = 1, 2, . . . , 𝑁.
𝑁
+ 𝑐 ∑𝑏𝑖𝑗 (𝑑) Γ𝑒𝑗 (𝑑) ,
𝑖 = 1, 2, . . . , 𝑁.
(2)
𝑗=1,𝑗 =ΜΈ 𝑖
Remark 1. If rank(𝐸) = 𝑛, then system (1) is a general nonsingular coupled network. We will also give a sufficient condition
of the finite-time synchronization for this circumstance. See
Corollary 10.
Definition 2. The singular system (1) is said to be synchronized in the finite time, if for a suitable designed feedback
controller, there exists a constant 𝑑∗ > 0 (which depends on
𝑇
the initial vector value π‘₯(0) = (π‘₯1𝑇 (0), π‘₯2𝑇 (0), . . . , π‘₯𝑁
(0))𝑇 ),
such that lim𝑑 → 𝑑∗ β€– π‘₯𝑖 (𝑑) − π‘₯𝑗 (𝑑) β€–= 0 and β€– π‘₯𝑖 (𝑑) − π‘₯𝑗 (𝑑) β€–≡ 0
for 𝑑 > 𝑑∗ , 𝑖, 𝑗 = 1, 2, . . . , 𝑁.
Assumption 3. Assume that the singular system (1) is connected in the sense that there are no isolated clusters; that is,
the matrix 𝐡 is an irreducible matrix.
With Assumption 3, we obtain that zero is an eigenvalue
of 𝐡 with multiplicity 1, and all the other eigenvalues of
𝐡 are strictly negative, which are denoted by 0 = πœ† 1 >
πœ† 2 ≥ ⋅ ⋅ ⋅ ≥ πœ† 𝑁. At the same time, since 𝐡 is a symmetric
matrix, there exists a unitary matrix π‘Š = (π‘Š1 , π‘Š2 , . . . , π‘Šπ‘) ∈
R𝑛×𝑛 such that 𝐡 = π‘ŠΛπ‘Šπ‘‡ with π‘Šπ‘Šπ‘‡ = 𝐼 and Λ =
diag(πœ† 1 , πœ† 2 , . . . , πœ† 𝑁).
(3)
𝑗=1
Let 𝑒(𝑑) = (𝑒1 (𝑑), 𝑒2 (𝑑), . . . , 𝑒𝑁(𝑑)), 𝑦(𝑑) = 𝑒(𝑑)π‘Š; then
system (3) can be written as
𝐸𝑦̇ (𝑑) = 𝐴𝑦 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Š + 𝑐Γ𝑦 (𝑑) Λ,
𝑁
𝑗=1
𝐸𝑒𝑖̇ (𝑑) = 𝐴𝑒𝑖 (𝑑) + 𝑓 (π‘₯𝑖 (𝑑) , 𝑑) − 𝑓 (𝑠 (𝑑) , 𝑑)
𝐸𝑒 Μ‡ (𝑑) = 𝐴𝑒 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) + 𝑐Γ𝑒 (𝑑) 𝐡𝑇 ,
Consider a singular hybrid coupled system as follows:
𝐸π‘₯𝑖̇ (𝑑) = 𝐴π‘₯𝑖 (𝑑) + 𝑓 (π‘₯𝑖 (𝑑) , 𝑑) + 𝑐 ∑ 𝑏𝑖𝑗 (𝑑) Γπ‘₯𝑗 (𝑑) ,
Let 𝑠(𝑑) be a function to which all π‘₯𝑖 (𝑑) are expected to
synchronize in the finite time. That is, the synchronization
Μ‡ =
state is 𝑠(𝑑). Suppose that 𝑠(𝑑) satisfies the equation 𝐸𝑠(𝑑)
𝐴𝑠(𝑑) + 𝑓(𝑠(𝑑), 𝑑). Let 𝑒𝑖 (𝑑) = π‘₯𝑖 (𝑑) − 𝑠(𝑑), 𝑖 = 1, 2, . . . , 𝑁. We
can obtain the following singular error system:
(4)
where 𝐹(𝑒(𝑑), 𝑑) = (𝑓(π‘₯1 (𝑑), 𝑑) − 𝑓(𝑠(𝑑), 𝑑), 𝑓(π‘₯2 (𝑑), 𝑑) −
𝑓(𝑠(𝑑), 𝑑), . . . , 𝑓(π‘₯𝑁(𝑑), 𝑑)−𝑓(𝑠(𝑑), 𝑑)), 𝑦(𝑑) = (𝑦1 (𝑑), 𝑦2 (𝑑), . . . ,
𝑦𝑁(𝑑)), and 𝑦𝑖 (𝑑) = 𝑒(𝑑)π‘Šπ‘– ∈ R𝑛 , 𝑖 = 1, 2, . . . , 𝑁. Then, system
(4) can be written as
𝐸𝑦𝑖̇ (𝑑) = 𝐴𝑦𝑖 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + π‘πœ† 𝑖 Γ𝑦𝑖 (𝑑)
= (𝐴 + π‘πœ† 𝑖 Γ) 𝑦𝑖 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– .
(5)
Therefore, the finite-time synchronization problem of
system (1) is equivalent to the finite-time stabilization of
system (5) at the origin under the suitable controllers 𝑒𝑖 ,
𝑖 = 1, 2, . . . , 𝑁.
Assumption 4. Assume that there exist nonnegative constants
𝐿 𝑖 such that
σ΅„©
σ΅„©
σ΅„©σ΅„©
σ΅„©
󡄩󡄩𝑓 (π‘₯𝑖 (𝑑) , 𝑑) − 𝑓 (𝑠 (𝑑) , 𝑑)σ΅„©σ΅„©σ΅„© ≤ 𝐿 𝑖 σ΅„©σ΅„©σ΅„©π‘₯𝑖 (𝑑) − 𝑠 (𝑑)σ΅„©σ΅„©σ΅„© ,
𝑖 = 1, 2, . . . , 𝑁.
(6)
Assumption 5. There exist matrices 𝑃𝑖 such that
𝐸𝑇 𝑃𝑖 = 𝑃𝑖𝑇 𝐸 ≥ 0,
𝑖 = 1, 2, . . . , 𝑁,
𝐴𝑇 𝑃1 + 𝑃1𝑇 𝐴 < 0,
(𝐴 + π‘πœ† 𝑖 Γ)𝑇 𝑃𝑖 + 𝑃𝑖𝑇 (𝐴 + π‘πœ† 𝑖 Γ) ≤ −πœ‚π‘– 𝐼,
𝑖 = 2, . . . , 𝑁,
(7)
(8)
where πœ‚π‘– > 2𝐿(𝑁 − 1) β€– 𝑃𝑖 β€–, 𝐿 = ∑𝑁
𝑖=1 𝐿 𝑖 .
Lemma 6 (see [26]). Suppose that the function 𝑉(𝑑) : [𝑑0 ,
∞) → [0, ∞) is differentiable (the derivative of 𝑉(𝑑) at 𝑑0
Μ‡
is in fact its right derivative) and 𝑉(𝑑)
≤ −𝐾(𝑉(𝑑))𝛼 , ∀𝑑 ≥ 0,
𝑉(𝑑0 ) ≥ 0, where 𝐾 > 0, 0 < 𝛼 < 1 are two constants. Then,
for any given 𝑑0 , 𝑉(𝑑) satisfies the following inequality:
𝑉1−𝛼 (𝑑) ≤ 𝑉1−𝛼 (𝑑0 ) − 𝐾 (1 − 𝛼) (𝑑 − 𝑑0 ) ,
𝑉 (𝑑) ≡ 0, ∀𝑑 > 𝑑∗ ,
with 𝑑∗ given by 𝑑∗ = 𝑑0 + 𝑉1−𝛼 (𝑑0 )/𝐾(1 − 𝛼).
𝑑0 ≤ 𝑑 ≤ 𝑑∗ ,
(9)
Journal of Applied Mathematics
3
Lemma 7 (Jensen’s Inequality). If π‘Ž1 , π‘Ž2 , . . . , π‘Žπ‘› are positive
numbers and 0 < π‘Ÿ < 𝑝, then
(1/𝑝)
𝑝
(∑π‘Žπ‘– )
𝑖=1
𝑛
≤
(1/π‘Ÿ)
π‘Ÿ
(∑π‘Žπ‘– ) .
𝑖=1
𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– = 𝑀𝑖 𝐸𝑦𝑖 (𝑑) = 𝑀𝑖 𝐸𝑄𝑖 𝑄𝑖−1 𝑦𝑖 (𝑑)
𝑦𝑖1
πΌπ‘Ÿ 0
𝑦1
=(
) ( 2) = ( 𝑖 ) ,
0 0
0
𝑦𝑖
𝑛
(10)
𝑇
3. Main Results
In this section, we consider the finite-time synchronization
of the singular coupled network (1) under the appropriate
controllers. In order to control the states of all nodes to the
synchronization state 𝑠(𝑑) in finite time, we apply some simple
controllers 𝑒𝑖 (𝑑) ∈ R𝑛 , 𝑖 = 1, 2, . . . , 𝑁, to system (1). Then,
the controlled system can be written as
𝐸π‘₯𝑖̇ (𝑑) = 𝐴π‘₯𝑖 (𝑑) + 𝑓 (π‘₯𝑖 (𝑑) , 𝑑) + 𝑐 ∑𝑏𝑖𝑗 Γπ‘₯𝑗 (𝑑) + 𝑒𝑖 ,
𝑗=1
(11)
𝑖 = 1, 2, . . . , 𝑁.
Then, we have
𝐸𝑒𝑖̇ (𝑑) = 𝐴𝑒𝑖 (𝑑) + 𝑓 (π‘₯𝑖 (𝑑) , 𝑑) − 𝑓 (𝑠 (𝑑) , 𝑑)
𝑁
(12)
+ 𝑐 ∑ 𝑏𝑖𝑗 Γ𝑒𝑗 (𝑑) + 𝑒𝑖 ,
𝑗=1
𝐸𝑦𝑖̇ (𝑑) = (𝐴 + π‘πœ† 𝑖 Γ) 𝑦𝑖 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + V𝑖 ,
(13)
where V𝑖 = π‘’π‘Šπ‘– , 𝑒 = (𝑒1 , 𝑒2 , . . . , 𝑒𝑁).
With Assumption 5, it follows from the proof of Theorem 1 in [2] and Lemma 2.2 in [3] that the pair (𝐸, 𝐴 + π‘πœ† 𝑖 Γ)
is regular and impulse-free; that is, there exist nonsingular
matrices 𝑀𝑖 , 𝑄𝑖 ∈ R𝑛×𝑛 satisfying that
sign (π‘¦π‘–π‘Ÿ1 (𝑑)) , ⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟
0, . . . , 0) .
𝑛−π‘Ÿ
Remark 8. From (17), the controllers 𝑒𝑖 are dependent not
only on the coupled matrix 𝐡, but also on the singular matrix
𝐸. And from the shape of controllers, we only use the states
𝑦𝑖1 of slow subsystems (15) in controllers V𝑖 , but we do not
consider the states 𝑦𝑖2 of fast subsystems (16). It is very special.
It is interesting for our future research to design more general
controller which makes the singular hybrid coupled networks
synchronize in finite time.
Theorem 9. Suppose that Assumptions 3, 4, and 5 hold.
Under the controllers (17), the singular system (1) is synchronized in a finite time 𝑑∗ = 𝑑0 + (𝑉(1−𝛽)/2 (𝑑0 )/
𝑇
𝑇
π‘Žπ‘˜π‘−(1+𝛽)/2 (1 − 𝛽)), where 𝑉(𝑑0 ) = ∑𝑁
𝑖=1 𝑦𝑖 (𝑑0 )𝐸 𝑃𝑖 𝑦𝑖 (𝑑0 ) =
𝑁
𝑇 𝑇
∑𝑖=1 (𝑒(𝑑0 )π‘Šπ‘– ) 𝐸 𝑃𝑖 (𝑒(𝑑0 )π‘Šπ‘– ), 𝑒(𝑑0 ) is the initial condition of
𝑒(𝑑), and π‘Ž and 𝑏 are defined as (25).
𝑦𝑖1Μ‡ (𝑑) = 𝐴 𝑖 𝑦𝑖1 (𝑑) + 𝑀𝑖1 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + 𝑀𝑖1 V𝑖 ,
(15)
0 = 𝑦𝑖2 (𝑑) + 𝑀𝑖2 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + 𝑀𝑖2 V𝑖 ,
(16)
𝑦𝑖2 (𝑑)
𝑁
𝑉 (𝑑) = ∑𝑦𝑖𝑇 (𝑑) 𝐸𝑇 𝑃𝑖 𝑦𝑖 (𝑑) .
(19)
𝑖=1
where 𝐴 𝑖 ∈ Rπ‘Ÿ×π‘Ÿ , 𝑖 = 1, 2, . . . , 𝑁. So, system (13) is equivalent
to
∈ R , and
π‘˜ > 0 is a tunable constant, and the real number 𝛽 satisfies
0 < 𝛽 < 1. So, we obtain 𝑒 = (V1 , V2 , . . . , V𝑁)π‘Š−1 =
V(πœ‰1 , πœ‰2 , . . . , πœ‰π‘). That is, 𝑒𝑖 = Vπœ‰π‘– .
(14)
𝑀𝑖 (𝐴 + π‘πœ† 𝑖 Γ) 𝑄𝑖 = diag {𝐴 𝑖 , 𝐼𝑛−π‘Ÿ } ,
π‘Ÿ
sign (𝑀𝑖 𝐸𝑦𝑖 (𝑑)) = diag ( sign (𝑦𝑖11 (𝑑)) , sign (𝑦𝑖21 (𝑑)) , . . . ,
Proof. Consider the following Lyapunov function:
𝑀𝑖 𝐸𝑄𝑖 = diag {πΌπ‘Ÿ , 0} ,
𝑦1 (𝑑)
= ( 𝑦𝑖2 (𝑑) ), 𝑦𝑖1 (𝑑)
where
𝑖
𝑀1
𝑀𝑖 = ( 𝑀𝑖2 ), 𝑀𝑖1 ∈ Rπ‘Ÿ×𝑛 , 𝑀𝑖2 ∈
𝑖
R𝑛×π‘Ÿ , and 𝑄𝑖2 ∈ R𝑛×(𝑛−π‘Ÿ) .
󡄨 1 󡄨𝛽
󡄨 1 󡄨𝛽
󡄨󡄨
󡄨𝛽
0, . . . , 0) ,
󡄨󡄨𝑀𝑖 𝐸𝑦𝑖 (𝑑)󡄨󡄨󡄨 = (󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨 , . . . , σ΅„¨σ΅„¨σ΅„¨σ΅„¨π‘¦π‘–π‘Ÿ (𝑑)󡄨󡄨󡄨󡄨 , ⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟
𝑛−π‘Ÿ
(18)
𝑁
𝑄𝑖−1 𝑦𝑖 (𝑑)
where
The derivative of 𝑉(𝑑) along the trajectory of system (13) is
𝑉̇ (𝑑)
𝑁
= ∑ [𝑦𝑖𝑇 (𝑑) 𝑃𝑖𝑇 ((𝐴 + π‘πœ† 𝑖 Γ) 𝑦𝑖 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + V𝑖 )
𝑖=1
𝑇
∈R
R(𝑛−π‘Ÿ)×𝑛 , 𝑄𝑖 = ( 𝑄𝑖1
𝑛−π‘Ÿ
𝑄𝑖2
+((𝐴 + π‘πœ† 𝑖 Γ) 𝑦𝑖 (𝑑) + 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– + V𝑖 ) 𝑃𝑖 𝑦𝑖 (𝑑) ]
. And
), 𝑄𝑖1 ∈
In order to achieve our aim, we design the following
controllers:
󡄨󡄨𝛽
󡄨
V𝑖 = −π‘˜π‘€π‘–−1 sign (𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– ) 󡄨󡄨󡄨𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– 󡄨󡄨 ,
(17)
𝑁
𝑇
= ∑ [ 𝑦𝑖𝑇 (𝑑) (𝑃𝑖𝑇 (𝐴 + π‘πœ† 𝑖 Γ) + (𝐴 + π‘πœ† 𝑖 Γ) 𝑃𝑖 ) 𝑦𝑖 (𝑑)
𝑖=1
+ 2𝑦𝑖𝑇 (𝑑) 𝑃𝑖𝑇 𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘–
󡄨𝛽
󡄨
−2π‘˜π‘¦π‘–π‘‡ (𝑑) 𝑃𝑖𝑇 𝑀𝑖−1 sign (𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– ) 󡄨󡄨󡄨𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– 󡄨󡄨󡄨 ].
(20)
4
Journal of Applied Mathematics
By using Assumption 4, one can get the following inequality:
σ΅„©σ΅„© 𝑁
σ΅„©σ΅„©
σ΅„©σ΅„©
σ΅„©σ΅„©
σ΅„© σ΅„©σ΅„©
󡄩󡄩𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– σ΅„©σ΅„©σ΅„© = σ΅„©σ΅„©σ΅„© ∑ [𝑓 (π‘₯π‘˜ (𝑑) , 𝑑) − 𝑓 (𝑠 (𝑑) , 𝑑)] π‘Šπ‘–π‘˜ σ΅„©σ΅„©σ΅„©
σ΅„©σ΅„©π‘˜=1
σ΅„©σ΅„©
σ΅„©
σ΅„©
𝑁
Let
π‘Ž β‰œ min {πœ† min (𝑃𝑖1𝑇 )} ,
𝑖
From (22), we get
σ΅„©
σ΅„©
≤ ∑ 𝐿 π‘˜ σ΅„©σ΅„©σ΅„©π‘’π‘˜ (𝑑)σ΅„©σ΅„©σ΅„©
𝑁
𝑁
σ΅„©2
σ΅„©2
σ΅„©
σ΅„©
π‘Ž∑󡄩󡄩󡄩󡄩𝑦𝑖1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© ≤ 𝑉 (𝑑) ≤ 𝑏∑󡄩󡄩󡄩󡄩𝑦𝑖1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© .
π‘˜=1
𝑁
𝑁
π‘˜=1
π‘˜=1
σ΅„©
σ΅„©
σ΅„©
σ΅„©
σ΅„©
σ΅„©
= ∑ 𝐿 π‘˜ 󡄩󡄩󡄩𝑦 (𝑑) πœ‰π‘˜ σ΅„©σ΅„©σ΅„© ≤ ∑ 𝐿 π‘˜ 󡄩󡄩󡄩𝑦 (𝑑)σ΅„©σ΅„©σ΅„© = 𝐿 󡄩󡄩󡄩𝑦 (𝑑)σ΅„©σ΅„©σ΅„©
𝑖=1
σ΅„©
σ΅„©
≤ 𝐿 ∑ σ΅„©σ΅„©σ΅„©π‘¦π‘˜ (𝑑)σ΅„©σ΅„©σ΅„© ,
By the use of (24)–(26) and Lemma 7, we can obtain that
𝑖=1
π‘˜=1
(21)
𝑇
𝑖
Rπ‘Ÿ×(𝑛−π‘Ÿ) , 𝑃𝑖3 ∈ R(𝑛−π‘Ÿ)×π‘Ÿ , and 𝑃𝑖4 ∈ R(𝑛−π‘Ÿ)×(𝑛−π‘Ÿ) . Using (7) and
(8) (see [2]), one can obtain that 𝑃𝑖1 = (𝑃𝑖1 )𝑇 > 0 and 𝑃𝑖2 = 0;
then,
𝑉 (𝑑) =
−
𝑁
∑𝑦𝑖𝑇 (𝑑) 𝐸𝑇 𝑃𝑖 𝑦𝑖
𝑖=1
2π‘˜π‘¦π‘–π‘‡ (𝑑) 𝑃𝑖𝑇 𝑀𝑖−1
(𝑑) =
𝑁
∑(𝑦𝑖1
𝑖=1
𝑇
(𝑑)) 𝑃𝑖1 𝑦𝑖1
(𝑑) ,
(22)
󡄨
󡄨𝛽
= −2π‘˜π‘¦π‘–π‘‡ (𝑑) 𝑃𝑖𝑇 𝑀𝑖−1 (sign (𝑦𝑖11 (𝑑)) 󡄨󡄨󡄨󡄨𝑦𝑖11 (𝑑)󡄨󡄨󡄨󡄨 , . . . ,
=
𝑃𝑖1
𝑇
−𝑇
−2π‘˜π‘¦π‘– (𝑑) 𝑄𝑖 ( 3
𝑃𝑖
0
𝑃𝑖4
󡄨𝛽
󡄨
(𝑑)) σ΅„¨σ΅„¨σ΅„¨σ΅„¨π‘¦π‘–π‘Ÿ1 (𝑑)󡄨󡄨󡄨󡄨 , 0, . . . , 0)
𝑇
) 𝑀𝑖 𝑀𝑖−1
From Lemma 6, we have that the solutions 𝑦𝑖1 (𝑑) of system
(15) are globally asymptotically stable with respect to 𝑦𝑖1 (𝑑) =
0 in the finite time 𝑑∗ ; that is,
󡄨𝛽 σ΅„©σ΅„©
󡄨
×󡄨󡄨󡄨𝑀𝑖 𝐸𝑦𝑖 (𝑑)󡄨󡄨󡄨 σ΅„©σ΅„©σ΅„©
σ΅„©
.
σ΅„©σ΅„©
σ΅„©2
σ΅„©
σ΅„©
σ΅„© σ΅„© σ΅„©
𝑉̇ (𝑑) ≤ ∑ [−πœ‚π‘– 󡄩󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„©σ΅„© + 2𝐿 󡄩󡄩󡄩𝑃𝑖 σ΅„©σ΅„©σ΅„© ∑ 󡄩󡄩󡄩󡄩𝑦𝑗 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© 󡄩󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„©σ΅„©
𝑖=1
𝑗=1
[
𝑁
󡄨1+𝛽
󡄨
≤ ∑ − 2π‘˜πœ† min (𝑃𝑖1𝑇 ) 󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨 .
𝑖=1
(30)
𝑁
σ΅„©
σ΅„© σ΅„©
σ΅„©
σ΅„© σ΅„© σ΅„©
σ΅„©
≤ 𝐿∑ 󡄩󡄩󡄩󡄩𝑄𝑗 σ΅„©σ΅„©σ΅„©σ΅„© (󡄩󡄩󡄩󡄩𝑦𝑗1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© + 󡄩󡄩󡄩󡄩𝑦𝑗2 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„©) + π‘˜ 󡄩󡄩󡄩󡄩𝑀𝑖−1 σ΅„©σ΅„©σ΅„©σ΅„©
(23)
󡄨1+𝛽
(𝑑)󡄨󡄨󡄨󡄨 ]
]
(29)
𝑁
σ΅„© σ΅„©σ΅„©
σ΅„©
≤ 𝐿∑ 󡄩󡄩󡄩󡄩𝑦𝑗 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© + σ΅„©σ΅„©σ΅„© − π‘˜π‘€π‘–−1 sign (𝑀𝑖 𝐸𝑦𝑖 (𝑑))
σ΅„©
𝑗=1
𝑗=1
󡄨
󡄨𝛽
× σ΅„¨σ΅„¨σ΅„¨σ΅„¨π‘¦π‘–1 (𝑑)󡄨󡄨󡄨󡄨 .
𝑁
󡄨
−2π‘˜πœ† min (𝑃𝑖1𝑇 ) 󡄨󡄨󡄨󡄨𝑦𝑖1
(28)
Similar to the proof of Lemma 2.2 in [3] and the proof of
Theorem 1 in [17], let 𝑀𝑖2 (𝑀𝑖2 )𝑇 = 𝐼𝑛−π‘Ÿ , which implies that
β€– 𝑀𝑖2 β€–= 1. One has
Substituting (8), (21), and (23) into (20) and letting πœ‚1 = 0,
while πœ‚π‘– ≥ 2𝐿(𝑁 − 1) β€– 𝑃𝑖 β€–, 𝑖 = 2, . . . , 𝑁, one has
𝑁
for 𝑑 ≥ 𝑑∗ ,
σ΅„© σ΅„©
σ΅„©σ΅„© 2 σ΅„©σ΅„© σ΅„©σ΅„© 2 σ΅„©σ΅„© σ΅„©σ΅„©
󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„© ≤ 󡄩󡄩𝑀𝑖 σ΅„©σ΅„© 󡄩󡄩𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– σ΅„©σ΅„©σ΅„©σ΅„© + 󡄩󡄩󡄩𝑀𝑖2 σ΅„©σ΅„©σ΅„© σ΅„©σ΅„©σ΅„©σ΅„©V𝑖 σ΅„©σ΅„©σ΅„©σ΅„© .
σ΅„© σ΅„©
σ΅„©
σ΅„© σ΅„© σ΅„©
󡄨
󡄨𝛽
= −2π‘˜π‘¦π‘–1𝑇 (𝑑) 𝑃𝑖1𝑇 sign (𝑦𝑖1 (𝑑)) 󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨
󡄨
≤ −2π‘˜πœ† min (𝑃𝑖1𝑇 ) 󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨
σ΅„©σ΅„© 1 σ΅„©σ΅„©
󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„© = 0
σ΅„©
σ΅„©
σ΅„©
σ΅„©
lim∗ 󡄩󡄩󡄩󡄩𝑦𝑖1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© = 0,
𝑑→𝑑
σ΅„©σ΅„© 2 σ΅„©σ΅„© σ΅„©σ΅„©
󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„© ≤ 󡄩󡄩𝐹 (𝑒 (𝑑) , 𝑑) π‘Šπ‘– σ΅„©σ΅„©σ΅„©σ΅„© + 󡄩󡄩󡄩󡄩𝑒𝑖 π‘Šπ‘– σ΅„©σ΅„©σ΅„©σ΅„©
σ΅„©
σ΅„©
󡄨󡄨 1 󡄨󡄨𝛽
󡄨
󡄨
× diag (sign (𝑦𝑖1 (𝑑)) , 0) (󡄨󡄨𝑦𝑖 (𝑑)󡄨󡄨 )
0
󡄨󡄨1+𝛽
𝑖=1
where 𝑑∗ = 𝑑0 + (𝑉(1−𝛽)/2 (𝑑0 )/π‘Žπ‘˜π‘−(1+𝛽)/2 (1 − 𝛽)).
In the following, we show that 𝑦𝑖2 (𝑑) are globally asymptotically stable with respect to 𝑦𝑖2 (𝑑) = 0 in the finite time 𝑑∗ .
From (16), one has
󡄨𝛽
󡄨
sign (𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– ) 󡄨󡄨󡄨𝑀𝑖 𝐸𝑒 (𝑑) π‘Šπ‘– 󡄨󡄨󡄨
sign (π‘¦π‘–π‘Ÿ1
(1+𝛽)/2
(1+𝛽)/2
1
≤ − 2π‘Žπ‘˜( 𝑉 (𝑑))
= −2π‘Žπ‘˜π‘−(1+𝛽)/2 (𝑉 (𝑑))(1+𝛽)/2 .
𝑏
(27)
−1
where π‘Šπ‘– = (π‘Šπ‘–1 , π‘Šπ‘–2 , . . . , π‘Šπ‘–π‘› ) and (πœ‰1 , πœ‰2 , . . . , πœ‰π‘) = π‘Š =
π‘Šπ‘‡ .
𝑃1 𝑃2
Define 𝑀𝑖−𝑇 𝑃𝑖 𝑄𝑖 = ( 𝑃𝑖3 𝑃𝑖4 ), where 𝑃𝑖1 ∈ Rπ‘Ÿ×π‘Ÿ , 𝑃𝑖2 ∈
(26)
𝑖=1
𝑁
𝑁
󡄨1+𝛽
󡄨
σ΅„©2
σ΅„©
𝑉̇ (𝑑) ≤ − 2π‘Žπ‘˜∑󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨
≤ −2π‘Žπ‘˜(∑󡄩󡄩󡄩𝑦𝑖 (𝑑)σ΅„©σ΅„©σ΅„© )
𝑁
𝑖
𝑏 β‰œ max {πœ† max (𝑃𝑖1𝑇 )} . (25)
𝑖
Then,
(24)
𝑁
𝑁
σ΅„© 𝑁
σ΅„© σ΅„©
σ΅„©
σ΅„©
σ΅„© σ΅„© σ΅„©
∑ 󡄩󡄩󡄩󡄩𝑦𝑖2 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© ≤ ∑ [𝐿∑ 󡄩󡄩󡄩󡄩𝑄𝑗 σ΅„©σ΅„©σ΅„©σ΅„© (󡄩󡄩󡄩󡄩𝑦𝑗1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© + 󡄩󡄩󡄩󡄩𝑦𝑗2 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„©)
𝑖=1
𝑖=1
[ 𝑗=1
σ΅„©
󡄨𝛽
󡄩󡄨
+π‘˜ 󡄩󡄩󡄩󡄩𝑀𝑖−1 σ΅„©σ΅„©σ΅„©σ΅„© 󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨 ] ;
]
(31)
Journal of Applied Mathematics
5
that is,
𝑁
σ΅„© 𝑁
σ΅„©
σ΅„© σ΅„© σ΅„©
σ΅„© σ΅„©σ΅„©
∑ (1 − 𝑁𝐿 󡄩󡄩󡄩𝑄𝑖 σ΅„©σ΅„©σ΅„©) 󡄩󡄩󡄩󡄩𝑦𝑖2 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„© ≤ ∑ (𝑁𝐿 󡄩󡄩󡄩𝑄𝑖 σ΅„©σ΅„©σ΅„© 󡄩󡄩󡄩󡄩𝑦𝑗1 (𝑑)σ΅„©σ΅„©σ΅„©σ΅„©
𝑖=1
𝑖=1
(32)
σ΅„©
󡄨𝛽
󡄩󡄨
+π‘˜ 󡄩󡄩󡄩󡄩𝑀𝑖−1 σ΅„©σ΅„©σ΅„©σ΅„© 󡄨󡄨󡄨󡄨𝑦𝑖1 (𝑑)󡄨󡄨󡄨󡄨 ) .
With Assumption 4, there must exist nonsingular matrices 𝑀𝑖 , 𝑄𝑖 ∈ R𝑛×𝑛 satisfying the equalities 𝑀𝑖 𝐸𝑄𝑖 =
diag{πΌπ‘Ÿ , 0}, 𝑀𝑖 (𝐴+π‘πœ† 𝑖 Γ)𝑄𝑖 = diag{𝐴 𝑖 , 𝐼𝑛−π‘Ÿ }, where 𝐴 𝑖 ∈ Rπ‘Ÿ×π‘Ÿ ,
𝑖 = 1, 2, . . . , 𝑁. Moreover, nonsingular matrices 𝑄𝑖 can be
suitably chosen to satisfy 1 − 𝑁𝐿 β€– 𝑄𝑖 β€–> 0, for ∀𝑖 ∈
{1, 2, . . . , 𝑁}. Therefore, one can obtain lim𝑑 → 𝑑∗ β€– 𝑦𝑖2 (𝑑) β€–= 0,
and β€– 𝑦𝑖2 (𝑑) β€–= 0 for 𝑑 ≥ 𝑑∗ from (28) and (32), 𝑖 = 1, 2, . . . , 𝑁.
Consequently, lim𝑑 → 𝑑∗ β€– 𝑒𝑖 (𝑑) β€–= 0, and β€– 𝑒𝑖 (𝑑) β€–= 0 for
𝑑 ≥ 𝑑∗ , 𝑖 = 1, 2, . . . , 𝑁. The proof is completed.
If rank(𝐸) = 𝑛, system (1) is a general nonsingular
coupled network. By using the controllers 𝑒𝑖 similar to V𝑖 in
(17), we can derive the finite-time synchronization of system
(1). For simplicity, let 𝐸 = 𝐼𝑛 . Then, we have the following.
Corollary 10. When 𝐸 = 𝐼𝑛 , under Assumptions 3 and 4, let
the controllers 𝑒𝑖 (𝑑) be as follows:
󡄨
󡄨𝛽
𝑒𝑖 (𝑑) = −π‘˜ sign (𝑒𝑖 (𝑑)) 󡄨󡄨󡄨𝑒𝑖 (𝑑)󡄨󡄨󡄨 ,
𝑖 = 1, 2, . . . , 𝑁;
(33)
system (1) is synchronized in a finite time.
Remark 11. Since the conditions in Assumption 5 are not
strict LMIs problems, they cannot be solved directly by
the LMI Matlab Toolbox. According to Lemma 1 in [17],
Lemma 1 in [9], and Remark 3 in [18], if matrix 𝐸 has the
decomposition as
Suppose that we choose the average state of all node states
as synchronized state; that is, 𝑠(𝑑) = (1/𝑁) ∑𝑁
π‘˜=1 π‘₯π‘˜ (𝑑). We
have similar results. Before giving these results, we need some
assumptions as follows:
Assumption 2σΈ€  . Assume that there exist nonnegative constants 𝐿 𝑖𝑗 such that
σ΅„©
σ΅„©
σ΅„©σ΅„©
σ΅„©
󡄩󡄩𝑓 (π‘₯𝑖 (𝑑) , 𝑑) − 𝑓 (π‘₯𝑗 (𝑑) , 𝑑)σ΅„©σ΅„©σ΅„© ≤ 𝐿 𝑖𝑗 σ΅„©σ΅„©σ΅„©π‘₯𝑖 (𝑑) − π‘₯𝑗 (𝑑)σ΅„©σ΅„©σ΅„© ,
σ΅„©
σ΅„©
σ΅„©
σ΅„©
(36)
𝑖, 𝑗 = 1, 2, . . . , 𝑁.
Assumption 3σΈ€  . There exist matrices 𝑃𝑖 such that
𝐸𝑇 𝑃𝑖 = 𝑃𝑖𝑇 𝐸 ≥ 0,
𝑖 = 1, 2, . . . , 𝑁,
𝐴𝑇 𝑃1 + 𝑃1𝑇 𝐴 < 0,
𝑇
(𝐴 + π‘πœ† 𝑖 Γ) 𝑃𝑖 + 𝑃𝑖𝑇 (𝐴 + π‘πœ† 𝑖 Γ) ≤ −πœπ‘– 𝐼,
𝑖 = 2, . . . , 𝑁,
where πœπ‘– > (4𝐿/𝑁)(𝑁 − 1) β€– 𝑃𝑖 β€–, 𝐿 = ∑𝑁
𝑖=1 𝐿 𝑖 , and 𝐿 𝑖 =
𝑁
∑π‘˜=1,π‘˜ =ΜΈ 𝑖 𝐿 π‘–π‘˜ .
Theorem 13. Suppose that Assumptions 3, 2σΈ€  , and 3σΈ€  hold. By
the controllers (17), the singular hybrid coupled network (1) can
be synchronized to the average state of all node states in the
finite time in the sense of Definition 2.
Corollary 14. Suppose that Assumptions 3 and 2σΈ€  hold, and
matrix 𝐸 has the decomposition as (34) in Remark 11. By the
controllers (17), if there exist matrices 𝑇𝑖 ∈ Rπ‘Ÿ×π‘Ÿ , 𝑇𝑖 ≥ 0, and
𝑆𝑖 ∈ R(𝑛−π‘Ÿ)×π‘Ÿ , 𝑖 = 1, 2, . . . , 𝑁, such that
𝑇
𝐴𝑇 (π‘ˆ1 𝑇1 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆1 ) + (π‘ˆ1 𝑇1 π‘ˆ1𝑇𝐸 + π‘ˆ2 𝑆1 ) 𝐴 < 0,
𝑇
𝐼 0 Π0
) 𝑉𝑇 ,
𝐸 = π‘ˆ( π‘Ÿ )( π‘Ÿ
0 0
0 𝐼𝑛−π‘Ÿ
(34)
where π‘ˆ = (π‘ˆ1 , π‘ˆ2 ), 𝑉 = (𝑉1 , 𝑉2 ), and Ξπ‘Ÿ = diag{󰜚1 , . . . , σ°œšπ‘Ÿ }
with σ°œšπ‘– > 0 for 𝑖 = 1, 2, . . . , π‘Ÿ, then Assumption 5 can be
transformed into a strict LMIs problem.
Corollary 12. Suppose that Assumptions 3 and 4 hold, and
matrix 𝐸 has the decomposition as (34) in Remark 11. By the
controllers (17), the singular hybrid coupled network (1) can be
synchronized in the finite time in the sense of Definition 2, if
there exist matrices 𝑇𝑖 ∈ Rπ‘Ÿ×π‘Ÿ , 𝑇𝑖 ≥ 0, and 𝑆𝑖 ∈ R(𝑛−π‘Ÿ)×π‘Ÿ ,
𝑖 = 1, 2, . . . , 𝑁, such that
𝑇
𝐴𝑇 (π‘ˆ1 𝑇1 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆1 ) + (π‘ˆ1 𝑇1 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆1 ) 𝐴 < 0,
𝑇
(𝐴 + π‘πœ† 𝑖 Γ) (π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆𝑖 )
(35)
(37)
(𝐴 + π‘πœ† 𝑖 Γ) (π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆𝑖 )
(38)
𝑇
+ (π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆𝑖 ) (𝐴 + π‘πœ† 𝑖 Γ) ≤ −πœ‚π‘– 𝐼,
where πœ‚π‘– > (4𝐿/𝑁)(𝑁 − 1) β€– 𝑃𝑖 β€–, 𝑃𝑖 = (π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆𝑖 ),
𝑁
𝑖 = 2, . . . , 𝑁, 𝐿 = ∑𝑁
𝑖=1 𝐿 𝑖 , and 𝐿 𝑖 = ∑π‘˜=1,π‘˜ =ΜΈ 𝑖 𝐿 π‘–π‘˜ , the singular
hybrid coupled network (1) can be synchronized to the average
state of all node states in the finite time.
Remark 15. In this paper, we study finite-time synchronization of the singular hybrid coupled networks when the singular systems studied in this paper are assumed to be regular
and impulse-free. However, it may be more complicated when
we do not assume in advance that the systems are regular and
impulse free. Synchronization or finite-time synchronization
of singular coupled systems is worth discussing without
the assumption that the considered systems are regular and
impulsive free.
𝑇
+ (π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸 + π‘ˆ2 𝑆𝑖 ) (𝐴 + π‘πœ† 𝑖 Γ) ≤ −πœ‚π‘– 𝐼,
where πœ‚π‘– > 2𝐿(𝑁 − 1) β€– 𝑃𝑖 β€–, 𝑃𝑖 =
2, . . . , 𝑁, and 𝐿 = ∑𝑁
𝑖=1 𝐿 𝑖 .
(π‘ˆ1 𝑇𝑖 π‘ˆ1𝑇 𝐸
+ π‘ˆ2 𝑆𝑖 ), 𝑖 =
4. An Illustrative Example
In this section, a numerical example will be given to verify the
theoretical results obtained earlier.
6
Journal of Applied Mathematics
2.5
Example 16. Consider the following singular hybrid coupled
network which is similar to one given in [18]:
2
6
𝐸π‘₯𝑖̇ (𝑑) = 𝐴π‘₯𝑖 (𝑑) + 𝑓 (π‘₯𝑖 (𝑑) , 𝑑) + 𝑐 ∑ 𝑏𝑖𝑗 Γπ‘₯𝑗 (𝑑) + 𝑒𝑖 ,
𝑗=1
1.5
(39)
1
where π‘₯𝑖 (𝑑) = (π‘₯𝑖1 (𝑑), π‘₯𝑖2 (𝑑))𝑇 , 𝑓(π‘₯𝑖 (𝑑), 𝑑) = ((1/
15) tanh(π‘₯𝑖1 (𝑑)), tanh(π‘₯𝑖2 (𝑑)))𝑇 , 𝑠(𝑑) = (0, 0)𝑇 , 𝐿 𝑖 = 1/15,
𝐿 = 2/5, 𝑐 = 1, and
8 0
𝐸=(
),
0 0
−10 1
𝐴=(
),
1 −10
−5
1
1
𝐡=(
1
1
(1
1
−4
1
1
1
0
1
1
−4
1
0
1
1
1
1
−4
1
0
1
1
0
1
−4
1
𝑒𝑖1 (𝑑)
𝑖 = 1, 2, . . . , 6,
0
−0.5
1 0
Γ=(
),
0 1
1
0
1)
.
0
1
−3)
0.5
−1
−1.5
0
2
4
6
8
10
𝑑
Figure 1: Error variable 𝑒𝑖1 (𝑑) (𝑖 = 1, 2, . . . , 6) of system (39) with
π‘˜ = 1.
(40)
Since 𝐡 is symmetric matrix and its six eigenvalues are πœ† 1 =
0, πœ† 2 = −3, πœ† 3 = −4, πœ† 4 = −5, πœ† 5 = −6,and πœ† 6 = −6,
there exists a unitary matrix
0.25
0.2
π‘Š = (π‘Š1 , . . . , π‘Š6 )
such that 𝐡 = π‘ŠΛπ‘Šπ‘‡ and Λ = diag(0, −3, −4, −5, −6, −6).
Choose
1
0
1
8
1
𝑀𝑖 = ( 10 − πœ† 𝑖 ) ,
),
𝑄𝑖 = (
1
1
0
1
8 (10 − πœ† 𝑖 ) πœ† 𝑖 − 10
1 0
𝑃𝑖 = (
),
0 1
(42)
πœ‚π‘– > 4, 𝑖 = 1, 2, . . . , 6, and 𝛽 = 1/2 satisfying Assumptions
3, 4, and 5. Under the controllers 𝑒𝑖 defined in Theorem 9,
the singular hybrid system (39) can be synchronized in the
finite time 𝑑∗ = 7.1858 according to Theorem 9 if π‘˜ = 1. If the
controller gain π‘˜ = 5, 𝑑∗ = 1.4372. Corresponding simulation
results are shown in Figures 1 and 2 with initial conditions
1 3 2 0.7 2.5 0.3 ).
𝑒(0) = ( 0.5
−1 0.8 −2 1.5 −0.5
0.15
0.1
𝑒𝑖2 (𝑑)
1
2
1
0
0
0 −
−
−
√6
√6 √6
1
1
1
1
(−
0 −
0 )
)
( √
√
√
√
6
6
2
)
( 6
)
(
1 )
1
1
( 1
) (41)
(−
0 −
0 −
( √6
√2
√6 √6 )
)
(
=(
)
1
1
1
(− 1
0
0 )
)
( √
√2 √6
)
( 6 √6
)
(
1 )
1
1
( 1
)
(−
0 −
0
√6
√2
√6 √6
1
2
1
−
−
0
0
0
√
√
√
)
( 6
6
6
0.05
0
−0.05
−1
0
2
4
6
8
10
𝑑
Figure 2: Error variable 𝑒𝑖2 (𝑑) (𝑖 = 1, 2, . . . , 6) of system (39) with
π‘˜ = 1.
5. Conclusions
In this paper, we discuss finite-time synchronization of the
singular hybrid coupled networks with the assumption that
the considered singular systems are regular and impulsivefree. Some sufficient conditions are derived to ensure finitetime synchronization of the singular hybrid coupled networks under a state feedback controller by finite-time stability
theory. A numerical example is finally exploited to show the
effectiveness of the obtained results. It will be an interesting
topic for the future researches to extend new methods to
study synchronization, robust control, pinning control, and
finite-time synchronization of singular hybrid coupled networks without the assumption that the considered singular
systems are regular and impulsive-free.
Journal of Applied Mathematics
Acknowledgments
This work was jointly supported by the National Natural
Science Foundation of China under Grant nos. 61272530
and 11072059 and the Jiangsu Provincial Natural Science
Foundation of China under Grant no. BK2012741.
References
[1] F. L. Lewis, “A survey of linear singular systems,” Circuits,
Systems, and Signal Processing, vol. 5, no. 1, pp. 3–36, 1986.
[2] S. Xu, P. Van Dooren, R. SΜ§tefan, and J. Lam, “Robust stability and
stabilization for singular systems with state delay and parameter
uncertainty,” IEEE Transactions on Automatic Control, vol. 47,
no. 7, pp. 1122–1128, 2002.
[3] G. Lu and D. W. C. Ho, “Generalized quadratic stability for
continuous-time singular systems with nonlinear perturbation,”
IEEE Transactions on Automatic Control, vol. 51, no. 5, pp. 818–
823, 2006.
[4] G. Grammel, “Robustness of exponential stability to singular
perturbations and delays,” Systems & Control Letters, vol. 57, no.
6, pp. 505–510, 2008.
[5] D. M. Stipanović and D. D. Šiljak, “Robust stability and stabilization of discrete-time non-linear systems: the LMI approach,”
International Journal of Control, vol. 74, no. 9, pp. 873–879, 2001.
[6] E. Uezato and M. Ikeda, “Strict LMI conditions for stability,
robust stabilization, and 𝐻∞ control of descriptor systems,”
in Proceedings of the 38th IEEE Conference on Decision and
Control, pp. 4092–4097, Phoenix, Ariz, USA, 1999.
[7] P. Wang and J. Zhang, “Stability of solutions for nonlinear
singular systems with delay,” Applied Mathematics Letters, vol.
25, no. 10, pp. 1291–1295, 2012.
[8] Y. Zhang, C. Liu, and X. Mu, “Robust finite-time stabilization
of uncertain singular Markovian jump systems,” Applied Mathematical Modelling, vol. 36, no. 10, pp. 5109–5121, 2012.
[9] L. Q. Zhang, B. Huang, and J. Lam, “LMI synthesis of 𝐻2
and mixed 𝐻2 /𝐻∞ controllers for singular systems,” IEEE
Transactions on Circuits and Systems II, vol. 50, pp. 615–626,
2003.
[10] I. Masubuchi, Y. Kamitane, A. Ohara, and N. Suda, “𝐻∞
control for descriptor systems: a matrix inequalities approach,”
Automatica, vol. 33, no. 4, pp. 669–673, 1997.
[11] S. Xu and J. Lam, Robust Control and Filtering of Singular
Systems, vol. 332 of Lecture Notes in Control and Information
Sciences, Springer, Berlin, Germany, 2006.
[12] E. Fridman, “𝐻∞ -control of linear state-delay descriptor systems: an LMI approach,” Linear Algebra and Its Applications, vol.
15, pp. 271–302, 2002.
[13] Y. Xia, J. Zhang, and E.-K. Boukas, “Control of discrete singular
hybrid systems,” Automatica, vol. 44, no. 10, pp. 2635–2641,
2008.
[14] S. Xu and C. Yang, “𝐻∞ state feedback control for discrete
singular systems,” IEEE Transactions on Automatic Control, vol.
45, no. 7, pp. 1405–1409, 2000.
[15] M. S. Mahmoud and N. B. Almutairi, “Stability and implementable 𝐻∞ filters for singular systems with nonlinear perturbations,” Nonlinear Dynamics, vol. 57, no. 3, pp. 401–410, 2009.
[16] Z. G. Feng and J. Lam, “Robust reliable dissipative filtering for
discrete delay singular systems,” Signal Processing, vol. 92, pp.
3010–3025, 2012.
7
[17] W. J. Xiong, D. W. C. Ho, and J. D. Cao, “Synchronization
analysis of singular hybrid coupled networks,” Physics Letters A,
vol. 372, pp. 6633–6637, 2008.
[18] J. F. Zeng and J. D. Cao, “Synchronisation in singgular hybrid
complex networks with delayed coupling,” International Journal
of Systems, Control and Communications, vol. 3, pp. 144–157,
2011.
[19] J. H. Koo, D. H. Ji, and S. C. Won, “Synchronization of singular complex dynamical networks with time-varying delays,”
Applied Mathematics and Computation, vol. 217, no. 8, pp. 3916–
3923, 2010.
[20] H. J. Li, Z. J. Ning, Y. H. Yin, and Y. Tang, “Synchronization and
state estimation for singular complex dynamical networks with
time-varying delays,” Communications in Nonlinear Science and
Numerical Simulation, vol. 18, pp. 194–208, 2013.
[21] S. Li, W. Tang, and J. Zhang, “Robust control for synchronization of singular complex delayed networks with stochastic
switched coupling,” International Journal of Computer Mathematics, vol. 89, no. 10, pp. 1332–1344, 2012.
[22] J. Xu and J. Sun, “Finite-time stability of linear time-varying
singular impulsive systems,” IET Control Theory & Applications,
vol. 4, no. 10, pp. 2239–2244, 2010.
[23] X. Huang, W. Lin, and B. Yang, “Global finite-time stabilization
of a class of uncertain nonlinear systems,” Automatica, vol. 41,
no. 5, pp. 881–888, 2005.
[24] L. Wang, S. Sun, and C. Xia, “Finite-time stability of multi-agent
system in disturbed environment,” Nonlinear Dynamics, vol. 67,
no. 3, pp. 2009–2016, 2012.
[25] V. T. Haimo, “Finite time controllers,” SIAM Journal on Control
and Optimization, vol. 24, no. 4, pp. 760–770, 1986.
[26] S. P. Bhat and D. S. Bernstein, “Finite-time stability of continuous autonomous systems,” SIAM Journal on Control and
Optimization, vol. 38, no. 3, pp. 751–766, 2000.
[27] Y. Chen and J. H. Lü, “Finite time synchronization of complex
dynamical networks,” Journal of Systems Science and Mathematical Sciences, vol. 29, no. 10, pp. 1419–1430, 2009.
[28] H. Wang, Z. Han, Q. Xie, and W. Zhang, “Finite-time chaos
control of unified chaotic systems with uncertain parameters,”
Nonlinear Dynamics, vol. 55, no. 4, pp. 323–328, 2009.
[29] Y. Z. Sun, W. Li, and D. H. Zhao, “Finite-time stochastic outer
synchronization between two complex dynamical networks
with different topologies,” Chaos, vol. 22, no. 2, Article ID
023152, 2012.
[30] N. Cai, W. Li, and Y. Jing, “Finite-time generalized synchronization of chaotic systems with different order,” Nonlinear
Dynamics, vol. 64, no. 4, pp. 385–393, 2011.
[31] X. Yang and J. Cao, “Finite-time stochastic synchronization of
complex networks,” Applied Mathematical Modelling, vol. 34,
no. 11, pp. 3631–3641, 2010.
[32] S. Li and Y.-P. Tian, “Finite time synchronization of chaotic
systems,” Chaos, Solitons and Fractals, vol. 15, no. 2, pp. 303–310,
2003.
[33] W. L. Yang, X. D. Xia, Y. C. Dong, and S. W. Zheng, “Finite
time synchronization between two different chaotic systems
with uncertain parameters,” Computer & Information Science,
vol. 3, pp. 174–179, 2010.
[34] L. Wang and F. Xiao, “Finite-time consensus problems for
networks of dynamic agents,” IEEE Transactions on Automatic
Control, vol. 55, no. 4, pp. 950–955, 2010.
[35] S. Yang, J. Cao, and J. Lu, “A new protocol for finite-time
consensus of detail-balanced multi-agent networks,” Chaos, vol.
22, Article ID 043134, 2012.
8
[36] L. Wang, Z. Chen, Z. Liu, and Z. Yuan, “Finite time agreement
protocol design of multi-agent systems with communication
delays,” Asian Journal of Control, vol. 11, no. 3, pp. 281–286, 2009.
[37] Q. Hui, W. M. Haddad, and S. P. Bhat, “Finite-time semistability
and consensus for nonlinear dynamical networks,” IEEE Transactions on Automatic Control, vol. 53, no. 8, pp. 1887–1900, 2008.
[38] Y. Shen and X. Xia, “Semi-global finite-time observers for
nonlinear systems,” Automatica, vol. 44, no. 12, pp. 3152–3156,
2008.
Journal of Applied Mathematics
Advances in
Operations Research
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Advances in
Decision Sciences
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Mathematical Problems
in Engineering
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Journal of
Algebra
Hindawi Publishing Corporation
http://www.hindawi.com
Probability and Statistics
Volume 2014
The Scientific
World Journal
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International Journal of
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Submit your manuscripts at
http://www.hindawi.com
International Journal of
Advances in
Combinatorics
Hindawi Publishing Corporation
http://www.hindawi.com
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Journal of
Complex Analysis
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International
Journal of
Mathematics and
Mathematical
Sciences
Journal of
Hindawi Publishing Corporation
http://www.hindawi.com
Stochastic Analysis
Abstract and
Applied Analysis
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
International Journal of
Mathematics
Volume 2014
Volume 2014
Discrete Dynamics in
Nature and Society
Volume 2014
Volume 2014
Journal of
Journal of
Discrete Mathematics
Journal of
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Applied Mathematics
Journal of
Function Spaces
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Optimization
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Download