Back
 AM  Vol.11 No.10 , October 2020
Finite-Time Synchronization for Heterogeneous Complex Networks with Time-Varying Delays
Abstract: This paper studies the problem of finite-time synchronization for a class of heterogeneous complex networks which not only have node time-varying delays and coupled time-varying delays but also contain uncertain disturbance. An appropriate controller is designed such that this type of network can be synchronized within a finite time. By constructing a proper Lyapunov function and using the finite-time stability theory, the sufficient conditions for the network to achieve finite-time synchronization are given and the finite time is estimated. Finally, the conclusions obtained are extended to the case of homogeneous complex networks with time-varying delays and uncertain disturbance.

1. Introduction

In the past few decades, complex networks (CNs) have received increasing attention due to their applications in various fields including food webs, communication networks, the Internet and so on. Much effort has been devoted to the control and synchronization of CNs, since it can describe many phenomena in nature and human society, and has many potential applications [1] [2] [3]. So far, some fruitful results about the synchronization of CNs have been obtained [4] [5] [6] [7]. The research on synchronization and synchronization control of CNs is very meaningful. In order to achieve system synchronization, many methods such as impulse control [8] [9] [10], adaptive control [11] [12] and their combination [13] [14] are widely used in chaotic systems. Due to noise, limited signal transmission and other reasons, time delays are common in nature and they can also change with time. The time-varying delays in complex networks usually include node time delays and coupling time delays [15] [16] [17].

The complex dynamic network model studied in [18] has node time delay and coupling time delay, but it studies the asymptotic synchronization of complex dynamic network, which means that the complex network achieves synchronization in infinite time. In practical applications, the synchronization of complex dynamic networks usually needs to be achieved within a limited time. Therefore, in recent years, the finite-time synchronization of complex dynamic networks has been paid attention to by many scholars, and some research results have been obtained [19] - [24]. In [24] the finite-time synchronization of complex dynamic networks with time delay is studied. The nodes of the complex networks studied above all have the same dynamic system, but in the real world, there are differences between the network nodes, and the dynamic systems of the network nodes are not exactly the same, that is, the expression of the state function for different nodes is different. The synchronization control of heterogeneous complex network has also attracted the attention of scholars [25] [26] [27]. Reference [28] studied the finite-time synchronization problems of heterogeneous complex networks, but did not discuss the situation of nodes with time delay and coupling time delay.

According to the points discussed above, this paper aims to further investigate finite-time synchronization of heterogeneous complex networks with time-varying delays and uncertain disturbance. Based on the finite-time stability theory, by designing an appropriate controller and constructing proper Lyapunov function this kind of node heterogeneous time-delayed complex networks can achieve finite-time synchronization. And we can obtain the sufficient conditions for the finite-time synchronization. Then, the results obtained are extended to the case of homogeneous complex networks with time-varying delays and uncertain disturbance.

The remainder of this paper is organized as follows. Section 2 presents the model and necessary preliminaries. In Section 3 the main results are given. Section 4 is the conclusions.

2. Model and Preliminaries

Consider a heterogeneous complex network with time-varying delay and linearly coupled by N different nodes, the state equation of the i-th node ( i = 1 , 2 , , N ) is

x ˙ i ( t ) = f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) + p i ( t , x i ( t ) ) + c j = 1 N a i j G x j ( t τ 2 ( t ) ) (1)

x i ( t ) = ( x i 1 ( t ) , x i 2 ( t ) , , x i n ( t ) ) T R n is the state variable of the i-th node at time t, f ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) : R + × R n × R n R n is the smooth vector function of the i-th dynamic system; p i ( t , x i ( t ) ) : R + × R n R n is the uncertain disturbance term of the i-th dynamic system and it is a bounded function; 0 τ 1 ( t ) τ 1 , 0 τ 2 ( t ) τ 2 are respectively node time-varying delay and coupling time delay, where τ 1 , τ 2 are known constants; c R + is the network coupling strength; external coupling matrix A = ( a i j ) R N × N represents the external coupling constant matrix between nodes, where the matrix A does not need to be a symmetric matrix, if there is a connection between node i and node j, then a i j > 0 , otherwise a i j = 0 ( i j ) , and the diagonal elements a i i = j = 1 , j i N a i j , i = 1 , 2 , , N ; G = d i a g ( δ 1 , δ 2 , , δ n ) R n × n is an internal coupling matrix and δ i 0 , ( i = 1 , 2 , , n ) , which represents the internal topology of the network.

Definition 1. The synchronous solution of the heterogeneous complex network (1) can be described by

x ˙ 0 ( t ) = f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) + p 0 ( t , x 0 ( t ) ) (2)

It can be a balance point, periodic trajectory or chaotic trajectory.

Definition 2. The node error of heterogeneous complex network (1) is

e i ( t ) = x i ( t ) x 0 ( t ) , i = 1 , 2 , , N (3)

The finite-time synchronization problem of the heterogeneous complex network (1) can be defined as follows:

If there is a time t > 0 such that

lim t t e i ( t ) = 0 and e i ( t ) 0 for t > t , i = 1 , 2 , , N ,

where t is called the settling time, then the complex network is synchronized with the synchronization solution x 0 ( t ) in a finite time.

In order to complete the finite-time synchronization of the heterogeneous complex network (1), the controller u i ( t ) R n needs to be applied to the nodes of the complex network (1). The design is as follows:

u i ( t ) = d i e i ( t ) η ( t ) S I G N ( e i ( t ) ) k [ s i g n ( e i ( t ) ) | e i ( t ) | β + ( k 1 t τ 1 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 + ( k 2 t τ 2 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 ] (4)

where s i g n ( ) represents a symbolic function, d i > 0 , k 1 > 0 , k 2 > 0 are undetermined constants, k is a given positive constant, β R and satisfies 0 β < 1 .

In Equation (4),

S I G N ( e i ( t ) ) = [ s i g n ( e i 1 ( t ) ) , s i g n ( e i 2 ( t ) ) , , s i g n ( e i n ( t ) ) ] T (5)

s i g n ( e i ( t ) ) = d i a g [ s i g n ( e i 1 ( t ) ) , s i g n ( e i 2 ( t ) ) , , s i g n ( e i n ( t ) ) ] (6)

| e i ( t ) | β = [ | e i 1 ( t ) | β , | e i 2 ( t ) | β , , | e i n ( t ) | β ] T (7)

So the complex network (1) with controller u i ( t ) can be expressed as:

x ˙ i ( t ) = f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) + p i ( t , x i ( t ) ) + c j = 1 N a i j G x j ( t τ 2 ( t ) ) + u i ( t ) (8)

From Equation (2), Equation (3) and Equation (8) the network error dynamic equation of the system can be derived as

e ˙ i ( t ) = f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) + p i ( t , x i ( t ) ) p 0 ( t , x 0 ( t ) ) + c j = 1 N a i j G e j ( t τ 2 ( t ) ) + u i ( t ) = F i ( t , e i ( t ) , e i ( t τ 1 ( t ) ) ) + P i ( t , e i ( t ) ) + c j = 1 N a i j G e j ( t τ 2 ( t ) ) + u i ( t ) (9)

The assumptions and lemmas needed to prove the finite-time synchronization of the heterogeneous complex network (1) are given below.

Assumption 1. [29] For any x ( t ) , y ( t ) R n , there are positive constants L 1 , L 2 , satisfying the inequality

( x ( t ) y ( t ) ) T [ f ( t , x ( t ) , x ( t τ ( t ) ) ) f ( t , y ( t ) , y ( t τ ( t ) ) ) ] L 1 [ x ( t ) y ( t ) ] T [ x ( t ) y ( t ) ] + L 2 [ x ( t τ ( t ) ) y ( t τ ( t ) ) ] T [ x ( t τ ( t ) ) y ( t τ ( t ) ) ]

Assumption 2. 0 τ ˙ 1 ( t ) h 1 < 1 , 0 τ ˙ 2 ( t ) h 2 < 1 where h i ( i = 1 , 2 ) are known constants.

Lemma 1. [30] For any two vectors x , y R n , the following inequality holds

2 x T y x T x + y T y .

Assumption 3. [31] There is a time-varying bounded function μ ( t ) > 0 , such that the following inequality holds

f i ( t , x ( t ) ) f 0 ( t , x ( t ) ) < μ ( t ) , i = 1 , 2 , , N .

Assumption 4. There exists a positive constant p max for the uncertain disturbance term p i ( t , x i ( t ) ) , i = 0 , 1 , 2 , , N , such that p i ( t , x i ( t ) ) p max .

Lemma 2. [32] For a i R , i = 1 , 2 , , n , if p , q R , 0 < p 1 , 0 < q < 2 , then we have

| a 1 | q + | a 2 | q + + | a n | q ( | a 1 | 2 + | a 2 | 2 + + | a n | 2 ) q 2

( | a 1 | + | a 2 | + + | a n | ) p | a 1 | p + | a 2 | p + + | a n | p .

Lemma 3. [33] Assume that a continuous, positive-definite function V ( t ) satisfies the following differential inequality:

d V ( t ) d t ε V α ( t ) , t 0 , V ( 0 ) 0 ,

where α , ε are positive constants and 0 < α < 1 , then

{ V 1 α ( t ) V 1 α ( 0 ) ε ( 1 α ) t , 0 < t < t V ( t ) 0 , t > t = V 1 α ( 0 ) ε ( 1 α )

3. Main Results

In this section, by using Lyapunov function and finite-time stability theory, the authors focus on investigating finite-time synchronization of the heterogeneous complex networks with time-varying delay and uncertain disturbance. The main results are given by the following theorem:

Theorem 1. If there are positive constants d i ( i = 1 , 2 , , N ) , k 1 , k 2 satisfy the following conditions

( L 1 + k 1 2 + k 2 2 ) I ( D I n ) + c 2 B B T 0 (10)

L 2 k 1 2 ( 1 h 1 ) 0 (11)

c 2 k 2 2 ( 1 h 2 ) 0 (12)

2 p max + μ ( t ) η ( t ) 0 (13)

where D = d i a g ( d 1 , d 2 , , d N ) > 0 , A S = A + A T 2 , B = A S G , then under the premise of satisfying Assumptions 1 - 4, the controlled network (8) of the nodes applying the controller (4) can be synchronized in finite time. The settling time is estimated as t = V 1 β 2 ( 0 ) k 2 β 1 2 ( 1 β ) .

Proof: Construct Lyapunov function,

V ( t ) = 1 2 i = 1 N e i T ( t ) e i ( t ) + k 1 2 i = 1 N t τ 1 ( t ) t e i T ( s ) e i ( s ) d s + k 2 2 i = 1 N t τ 2 ( t ) t e i T ( s ) e i ( s ) d s = V 1 ( t ) + V 2 ( t ) + V 3 ( t ) (14)

Take the derivative of V ( t ) along the error system (9),

V ˙ ( t ) = V ˙ 1 ( t ) + V ˙ 2 ( t ) + V ˙ 3 ( t ) (15)

The derivative of V 1 ( t ) can be calculated as

V ˙ 1 ( t ) = i = 1 N e i T ( t ) [ F i ( t , e i ( t ) , e i ( t τ 1 ( t ) ) ) + P i ( t , e i ( t ) ) + c j = 1 N a i j G e j ( t τ 2 ( t ) ) + u i ( t ) ] = i = 1 N e i T ( t ) F i ( t , e i ( t ) , e i ( t τ 1 ( t ) ) ) + i = 1 N e i T ( t ) P i ( t , e i ( t ) ) + c i = 1 N e i T ( t ) j = 1 N a i j G e j ( t τ 2 ( t ) ) + i = 1 N e i T ( t ) u i ( t ) = W 1 + W 2 + W 3 + W 4 (16)

In Equation (16),

W 1 = i = 1 N e i T ( t ) F i ( t , e i ( t ) , e i ( t τ 1 ( t ) ) ) , W 2 = i = 1 N e i T ( t ) P i ( t , e i ( t ) ) , W 3 = c i = 1 N e i T ( t ) j = 1 N a i j G e j ( t τ 2 ( t ) ) , W 4 = i = 1 N e i T ( t ) u i ( t )

W 1 can be rewritten as

W 1 = i = 1 N e i T ( t ) [ f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) ] = i = 1 N e i T ( t ) [ f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) f i ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) + f i ( t x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) ] = W 11 + W 12

where

W 11 = i = 1 N e i T ( t ) [ f i ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) f i ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) ] W 12 = i = 1 N e i T ( t ) [ f i ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) ]

Let e ( t ) = [ e 1 T ( t ) , e 2 T ( t ) , , e N T ( t ) ] T and using Assumption 1, we have

W 11 i = 1 N [ L 1 e i T ( t ) e i ( t ) + L 2 e i T ( t τ 1 ( t ) ) e i ( t τ 1 ( t ) ) ] = L 1 e T ( t ) e ( t ) + L 2 e T ( t τ 1 ( t ) ) e ( t τ 1 ( t ) ) (17)

Using Assumption 3 and the formula e i ( t ) 2 = ( j = 1 n | e i j ( t ) | 2 ) 1 2 , we obtain

W 12 i = 1 N e i ( t ) 2 f i ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) 2 μ ( t ) i = 1 N e i ( t ) 2 (18)

By using Assumption 4, we can get

W 2 = i = 1 N e i T ( t ) [ p i ( t , x i ( t ) ) p 0 ( t , x 0 ( t ) ) ] i = 1 N e i ( t ) 2 p i ( t , x i ( t ) ) p 0 ( t , x 0 ( t ) ) 2 i = 1 N e i ( t ) 2 ( p i ( t , x i ( t ) ) 2 + p 0 ( t , x 0 ( t ) ) 2 ) 2 p max i = 1 N e i ( t ) 2 (19)

Let A S = A + A T 2 , and note that G is a diagonal matrix, by utilizing the quality of the Kronecker product of matrices,

W 3 = c ( t ) i = 1 N e i T ( t ) j = 1 N a i j G e j ( t τ 2 ( t ) ) c e T ( t ) ( A G ) e ( t τ 2 ( t ) ) = c e T ( t ) ( A G + ( A G ) T 2 ) e ( t τ 2 ( t ) ) = c e T ( t ) ( A S G ) e ( t τ 2 ( t ) ) (20)

Let B be defined by B = A S G , it can be obtained that

W 3 c e T ( t ) B e ( t τ 2 ( t ) ) (21)

From Equation (4), namely the definition of u i ( t ) , W 4 can be represented as follows:

W 4 = i = 1 N e i T ( t ) { d i e i ( t ) η ( t ) S I G N ( e i ( t ) ) k [ s i g n ( e i ( t ) ) | e i ( t ) | β + ( k 1 t τ 1 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 + ( k 2 t τ 2 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 ] } = W 41 + W 42 + W 43 (22)

Define D = d i a g ( d 1 , d 2 , , d N ) > 0 , and note that

i = 1 N e i T ( t ) S I G N ( e i ( t ) ) = i = 1 N j = 1 n | e i j ( t ) | ,

we have from Equation (22),

W 41 = i = 1 N e i T ( t ) [ d i e i ( t ) η ( t ) S I G N ( e i ( t ) ) ] = e T ( t ) ( D I n ) e ( t ) η ( t ) i = 1 N e i T ( t ) S I G N ( e i ( t ) ) e T ( t ) ( D I n ) e ( t ) η ( t ) i = 1 N e i ( t ) 2 (23)

By using Lemma 2, we have ( i = 1 N j = 1 n | e i j ( t ) | β + 1 ) 1 β + 1 ( i = 1 N j = 1 n | e i j ( t ) | 2 ) 1 2 , yields

i = 1 N j = 1 n | e i j ( t ) | β + 1 ( i = 1 N j = 1 n | e i j ( t ) | 2 ) β + 1 2 (24)

Combining (24) and setting | e i ( t ) | = [ | e i 1 ( t ) | , | e i 2 ( t ) | , , | e i n ( t ) | ] T , it can be obtained that

W 42 = k i = 1 N e i T ( t ) s i g n ( e i ( t ) ) | e i ( t ) | β = k i = 1 N | e i ( t ) | T | e i ( t ) | β = k i = 1 N j = 1 n | e i j ( t ) | β + 1 k ( i = 1 N j = 1 n | e i j ( t ) | 2 ) β + 1 2 = k ( i = 1 N e i T ( t ) e i ( t ) ) β + 1 2 (25)

W 43 = k i = 1 N e i T ( t ) [ ( k 1 t τ 1 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 + ( k 2 t τ 2 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 e i ( t ) e i ( t ) 2 ] = k i = 1 N ( k 1 t τ 1 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 k i = 1 N ( k 2 t τ 2 ( t ) t e i T ( s ) e i ( s ) d s ) 1 + β 2 (26)

From (14), (25), (26) and Lemma 2, one has

W 42 + W 43 k [ i = 1 N e i T ( t ) e i ( t ) + k 1 i = 1 N t τ 1 ( t ) t e i T ( s ) e i ( s ) d s + k 2 i = 1 N t τ 2 ( t ) t e i T ( s ) e i ( s ) d s ] 1 + β 2 = k ( 2 V ) 1 + β 2 = k 2 1 + β 2 V 1 + β 2 (27)

Thus, substituting (17), (18), (19), (21), (23), (27) into (16), the following inequality holds:

V ˙ 1 ( t ) L 1 e T ( t ) e ( t ) + L 2 e T ( t τ 1 ( t ) ) e ( t τ 1 ( t ) ) + μ ( t ) i = 1 N e i ( t ) 2 + 2 p max i = 1 N e i ( t ) 2 + c e T ( t ) B e ( t τ 2 ( t ) ) e T ( t ) ( D I n ) e ( t ) η ( t ) i = 1 N e i ( t ) 2 k 2 1 + β 2 V 1 + β 2 (28)

From (14) and e ( t ) = [ e 1 T ( t ) , e 2 T ( t ) , , e N T ( t ) ] T , V ˙ 2 , V ˙ 3 can be derived as follows:

V ˙ 2 = k 1 2 i = 1 N e i T ( t ) e i ( t ) k 1 2 ( 1 τ ˙ 1 ( t ) ) i = 1 N e i T ( t τ 1 ( t ) ) e i ( t τ 1 ( t ) ) = k 1 2 e T ( t ) e ( t ) k 1 2 ( 1 τ ˙ 1 ( t ) ) e T ( t τ 1 ( t ) ) e ( t τ 1 ( t ) ) (29)

V ˙ 3 = k 2 2 i = 1 N e i T ( t ) e i ( t ) k 2 2 ( 1 τ ˙ 2 ( t ) ) i = 1 N e i T ( t τ 2 ( t ) ) e i ( t τ 2 ( t ) ) = k 2 2 e T ( t ) e ( t ) k 2 2 ( 1 τ ˙ 2 ( t ) ) e T ( t τ 2 ( t ) ) e ( t τ 2 ( t ) ) (30)

By using Assumption 2, (28), (29), (30) and (15), we have

V ˙ ( t ) e T ( t ) [ ( L 1 + k 1 2 + k 2 2 ) I ( D I n ) ] e ( t ) + ( L 2 k 1 2 ( 1 h 1 ) ) e T ( t τ 1 ( t ) ) e ( t τ 1 ( t ) ) + ( 2 p max + μ ( t ) η ( t ) ) i = 1 N e i ( t ) 2 + c e T ( t ) B e ( t τ 2 ( t ) ) k 2 1 + β 2 V 1 + β 2 k 2 2 ( 1 h 2 ) e T ( t τ 2 ( t ) ) e ( t τ 2 ( t ) ) (31)

Then by utilizing Lemma 1, it follows from (31)

c e T ( t ) B e ( t τ 2 ( t ) ) c 2 e T ( t ) B B T e ( t ) + c 2 e T ( t τ 2 ( t ) ) e ( t τ 2 ( t ) ) (32)

Substituting (32) into (31) and utilizing the conditions (10), (11), (12), (13) in Theorem 1 yields

V ˙ ( t ) e T ( t ) [ ( L 1 + k 1 2 + k 2 2 ) I ( D I n ) + c 2 B B T ] e ( t ) + [ L 2 k 1 2 ( 1 h 1 ) ] e T ( t τ 1 ( t ) ) e ( t τ 1 ( t ) ) + ( 2 p max + μ ( t ) η ( t ) ) i = 1 N e i ( t ) 2 + [ c 2 k 2 2 ( 1 h 2 ) ] e T ( t τ 2 ( t ) ) e ( t τ 2 ( t ) ) k 2 1 + β 2 V 1 + β 2 k 2 1 + β 2 V 1 + β 2 .

It is derived from Lemma 3 that, V ( t ) 0 for t > t = V 1 β 2 ( 0 ) k 2 β 1 2 ( 1 β ) .

Therefore, lim t t e i ( t ) = 0 and e i ( t ) 0 for t > t , i = 1 , 2 , , N .

This completes the proof.

Finally, the conclusions obtained are extended to the case of homogeneous complex networks with the same node dynamic system.

When the nodes of the complex network have the same dynamic system where f 1 = f 2 = = f N = f , the complex network (8) will be homogeneous complex network as follows:

x ˙ i ( t ) = f ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) + p i ( t , x i ( t ) ) + c j = 1 N a i j G x j ( t τ 2 ( t ) ) + u i ( t ) (33)

The synchronous solution can be described by

x ˙ 0 ( t ) = f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) + p 0 ( t , x 0 ( t ) ) (34)

Controllers in Theorem 1 are added to each node, we have error system

e ˙ i ( t ) = f ( t , x i ( t ) , x i ( t τ 1 ( t ) ) ) f 0 ( t , x 0 ( t ) , x 0 ( t τ 1 ( t ) ) ) + p i ( t , x i ( t ) ) p 0 ( t , x 0 ( t ) ) + c j = 1 N a i j G e j ( t τ 2 ( t ) ) + u i ( t ) = F ( t , e i ( t ) , e i ( t τ 1 ( t ) ) ) + P i ( t , e i ( t ) ) + c j = 1 N a i j G e j ( t τ 2 ( t ) ) + u i ( t ) (35)

Based on Theorem 1, we can get the sufficient conditions of network (33) to achieve synchronization in finite time.

Corollary 1: If there are positive constants d i ( i = 1 , 2 , , N ) , k 1 , k 2 satisfy the following conditions

( L 1 + k 1 2 + k 2 2 ) I ( D I n ) + c 2 B B T 0

L 2 k 1 2 ( 1 h 1 ) 0

c 2 k 2 2 ( 1 h 2 ) 0

2 p max η ( t ) 0

where D = d i a g ( d 1 , d 2 , , d N ) > 0 , A S = A + A T 2 , B = A S G , then under the premise of satisfying assumptions 1 - 4, the controlled network (33) of the node applying the controller (4) can be synchronized in finite time. The settling time is estimated as t = V 1 β 2 ( 0 ) k 2 β 1 2 ( 1 β ) .

The proof of Corollary 1 is similar to the proof of Theorem 1.

4. Conclusion

In this paper, the finite-time synchronization problem of a class of heterogeneous complex networks with node time-varying delays and coupled time-varying delays and uncertain disturbance is considered. By designing an appropriate controller and using Lyapunov function and the finite-time stability theory, the sufficient conditions formulated by a set of inequalities are derived to guarantee that all the node systems achieve synchronization with the synchronous solution in a finite settling time. Specially, the above conclusions can be applied to the case of homogeneous complex networks with time-varying delays and uncertain disturbance.

Acknowledgements

The authors would like to thank the editors and the reviewers for their valuable comments and suggestions. This work was supported by the Fujian Provincial Young and Middle-aged Teacher Education Research Project (JT180871).

Cite this paper: Ma, Y. and Tai, Y. (2020) Finite-Time Synchronization for Heterogeneous Complex Networks with Time-Varying Delays. Applied Mathematics, 11, 1000-1012. doi: 10.4236/am.2020.1110066.
References

[1]   Ott, E. (2002) Chaos in Dynamical Systems. 2nd Edition, Cambridge University Press, Cambridge.
https://doi.org/10.1017/CBO9780511803260

[2]   Khan, A. and Shahzad, M. (2013) Synchronization of Circular Restricted Three Body Problem with Lorenz Hyper Chaotic System Using a Robust Adaptive Sliding Mode Controller. Complexity, 18, 58-64.
https://doi.org/10.1002/cplx.21459

[3]   Zhou, J., Lv, J.A. and Lu, J.H. (2008) Pining Adaptive Synchronization of a General Complex Dynamical Network. Automatica, 44, 996-1003.
https://doi.org/10.1016/j.automatica.2007.08.016

[4]   Lv, J.H., Leung, H. and Chen, G. (2004) Complex Dynamical Networks: Modelling, Synchronization and Control. Dynamics of Continuous Discrete and Impulsive, 11, 70-77.

[5]   Li, X., Wang, X.F. and Chen, G.R. (2004) Pinning a Complex Dynamical Network to Its Equilibrium. IEEE Transactions on Circuits Systems I: Regular Papers, 51, 2074-2087.
https://doi.org/10.1109/TCSI.2004.835655

[6]   Yu, W.W., Chen, G.R. and Lv, J.H. (2009) On Pinning Synchronization of Complex Dynamical Networks. Automatica, 45, 429-435.
https://doi.org/10.1016/j.automatica.2008.07.016

[7]   Lv, J.H., Yu, X.H. and Chen, G.R. (2004) Chaos Synchronization of General Complex Dynamical Networks. Physica A: Statistical Mechanics and Its Applications, 334, 281-302.
https://doi.org/10.1016/j.physa.2003.10.052

[8]   Liu, B., Liu, X.Z., Chen, G.R. and Wang, H.Y. (2005) Robust Impulsive Synchronization of Un-certain Dynamical Networks. IEEE Transactions on Circuits Systems. I: Regular Papers, 52, 1431-1441.
https://doi.org/10.1109/TCSI.2005.851708

[9]   Jiang, H.B. and Bi, Q.S. (2010) Impulsive Synchronization of Networked Nonlinear Dynamical Systems. Physical Review Letters, 374, 2723-2729.
https://doi.org/10.1016/j.physleta.2010.04.063

[10]   Yang, X.S. and Yang, Z.C. (2014) Synchronization of TS Fuzzy Complex Dynamical Networks with Time-Varying Impulsive Delays and Stochastic Effects. Fuzzy Sets and Systems, 235, 25-43.
https://doi.org/10.1016/j.fss.2013.06.008

[11]   Yang, L.X. and Jiang, J. (2014) Adaptive Synchronization of Drive-Response Fractional-Order Complex Dynamical Networks with Uncertain Parameters. Communications in Nonlinear Science and Numerical Simulation, 19, 1496-1506.
https://doi.org/10.1016/j.cnsns.2013.09.021

[12]   Liu, H., Chen, J., Lu, J.A. and Cao, M. (2010) Generalized Synchronization in Complex Dynamical Networks via Adaptive Couplings. Physica A: Statistical Mechanics and Its Applications, 389, 1759-1770.
https://doi.org/10.1016/j.physa.2009.12.035

[13]   Li, K. and Lai, C.H. (2008) Adaptive-impulsive Synchronization of Uncertain Complex Dynamical Networks. Physics Letters A, 372, 1601-1606.
https://doi.org/10.1016/j.physleta.2007.10.020

[14]   Yang, X.S. and Cao, J.D. (2014) Hybrid Adaptive and Impulsive Synchronization of uncertain Complex Networks with Delays and General Uncertain Perturbations. Applied Mathematics and Computation, 227, 480-493.
https://doi.org/10.1016/j.amc.2013.11.025

[15]   Li, N. and Cao, J.D. (2016) Passivity and Robust Synchronization of Switched Interval Coupled Neural Networks with Time Delay. International Journal of Systems Science, 47, 2827-2836.
https://doi.org/10.1080/00207721.2015.1029570

[16]   Li, S.Q., Peng, X.Y., Tang, Y. and Shi, Y.J. (2018) Finite-time Synchronization of Time-Delayed Neural Networks with Unknown Parameters via Adaptive Control. Neurocomputing, 308, 65-74.
https://doi.org/10.1016/j.neucom.2018.04.053

[17]   Zhang, J. and Gao, Y.B. (2017) Synchronization of Coupled Neural Networks with Time-Varying Delay. Neurocomputing, 219, 154-162.
https://doi.org/10.1016/j.neucom.2016.09.004

[18]   Wu, W., Zhou, W.J. and Chen, T.P. (2009) Cluster Synchronization of Linearly Coupled Complex Networks under Pinning Control. IEEE Transactions on Circuits and Systems I: Regular Papers, 56, 829-839.
https://doi.org/10.1109/TCSI.2008.2003373

[19]   Chen, L., Wu, L. and Zhu, S. (2008) Synchronization in Complex Networks by Time-Varying Couplings. European Physical Journal D, 48, 405-409.
https://doi.org/10.1140/epjd/e2008-00113-4

[20]   Huang, L.H., Wang, Z.Y., Wang, Y.N. and Zuo, Y. (2009) Synchronization Analysis of Delayed Complex Networks via Adaptive Time-Varying Coupling Strengths. Physics Letters A, 373, 3952-3958.
https://doi.org/10.1016/j.physleta.2009.08.063

[21]   Liu, X. and Chen, T. (2018) Finite-Time and Fixed-Time Cluster Synchronization with or without Pinning Control. IEEE Transactions on Cybernetics, 48, 240-252.
https://doi.org/10.1109/TCYB.2016.2630703

[22]   Liu, X.Y., Ho, D.W.C., Song, Q., et al. (2019) Finite/Fixed-Time Pinning Synchronization of Complex Networks with Stochastic Disturbances. IEEE Transactions on Cybernetics, 49, 2398-2403.
https://doi.org/10.1109/TCYB.2018.2821119

[23]   Zhang, W.L., Yang, X.S., Xu, C., et al. (2018) Finite-time Synchronization of Discontinuous Neural Networks with Delays and Mismatched Parameters. IEEE Transactions on Neural Networks and Learning Systems, 29, 3761-3771.
https://doi.org/10.1109/TNNLS.2017.2740431

[24]   Feng, J.W., Li, N., Zhao, Y., Xu, C. and Wang, J.Y. (2017) Finite-time Synchronization Analysis for General Complex Dynamical Networks with Hybrid Couplings and Time-Varying Delays. Nonlinear Dynamics, 88, 2723-2733.
https://doi.org/10.1007/s11071-017-3405-5

[25]   Wu, X.J. and Lu, H.T. (2012) Projective Lag Synchronization of the General Complex Dynamical Networks with Distinct Nodes. Communications in Nonlinear Science and Numerical Simulation, 17, 4417-4429.
https://doi.org/10.1016/j.cnsns.2012.03.019

[26]   Xiang, J. and Chen, G.R. (2007) On the V-Stability of Complex Dynamical Networks. Automatica, 43, 1049-1057.
https://doi.org/10.1016/j.automatica.2006.11.014

[27]   Wang, Y.L. and Cao, J.D. (2013) Cluster Synchronization in Nonlinearly Coupled Delayed Networks of Non-identical Dynamic Systems. Nonlinear Analysis: Real World Applications, 14, 842-851.
https://doi.org/10.1016/j.nonrwa.2012.08.005

[28]   Li, Q.B. (2018) Synchronization Analysis and Control of Several Complex Dynamical Networks. Ph.D. Thesis, University of Science and Technology Beijing, Beijing.

[29]   Cai, S.M., He, Q.B., Hao, J.J. and Liu, Z.R. (2010) Exponential Synchronization of Complex Networks with Nonidentical Time-Delayed Dynamical Nodes. Physics Letters A, 374, 2539-2550.
https://doi.org/10.1016/j.physleta.2010.04.023

[30]   Liu, H., Lu, J.A. and Lu, J.H. (2009) Structure Identification of Uncertain General Complex Dynamical Networks with Time Delay. Automatica, 45, 1799-1807.
https://doi.org/10.1016/j.automatica.2009.03.022

[31]   Wang, L., Chen, S.Y. and Wang, Q.G. (2015) Eigenvalue Based Approach to Bounded Synchronization of Asymmetrically Coupled Networks. Communications in Nonlinear Science and Numerical Simulation, 22, 769-779.
https://doi.org/10.1016/j.cnsns.2014.08.022

[32]   Qian, C.J. and Li, J. (2005) Global Finite-Time Stabilization by Output Feedback for Planar Systems without Observable Linearization. IEEE Transactions on Automatic Control, 50, 885-890.
https://doi.org/10.1109/TAC.2005.849253

[33]   Bhat, S.P. and Bernstein, D.S. (2000) Finite-time Stability of Continuous Autonomous Systems. SIAM Journal on Control and Optimization, 38, 751-766.
https://doi.org/10.1137/S0363012997321358

 
 
Top