Next Article in Journal
Fractional Control of a Class of Underdamped Fractional Systems with Time Delay—Application to a Teleoperated Robot with a Flexible Link
Next Article in Special Issue
Existence of Mild Solution of the Hilfer Fractional Differential Equations with Infinite Delay on an Infinite Interval
Previous Article in Journal
Existence and Stability Results for Piecewise Caputo–Fabrizio Fractional Differential Equations with Mixed Delays
Previous Article in Special Issue
The Analytical Fractional Solutions for Coupled Fokas System in Fiber Optics Using Different Methods
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adaptive Control for Finite-Time Cluster Synchronization of Fractional-Order Fully Complex-Valued Dynamical Networks

1
Shijiazhuang Campus, Army Engineering University of PLA, Shijiazhuang 050003, China
2
PLA Unit 32382, Beijing 100070, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(9), 645; https://doi.org/10.3390/fractalfract7090645
Submission received: 25 July 2023 / Revised: 11 August 2023 / Accepted: 20 August 2023 / Published: 24 August 2023

Abstract

:
This paper aims to address finite-time cluster synchronization (FTCS) issues for fractional-order fully complex-valued dynamical networks (FFCVDNs) with time delay. To compensate for the limited application of one controller, the delay-dependent and delay-independent adaptive controllers with regard to quadratic and absolute-valued norms are developed, respectively. Based on the finite-time stability theorem and auxiliary inequality techniques, detailed Lyapunov analysis is provided to ensure that FFCVDNs can achieve FTCS, and the settling times (STs) are estimated on the basis of system and control parameters characterized by system models to decrease the conservativeness of the existing results. Finally, simulation examples are provided to verify the correctness of theoretical analysis.

1. Introduction

Recently, a strong upsurge in investigations of cluster synchronization issues of dynamical networks (DNs) have been witnessed because this technique is able to describe some very relevant complex natural and social phenomena in multiple fields, such as engineering control, communication engineering, communication engineering, etc. Its core idea is that, based on the different characteristics and functions of nodes, the nodes can be classified into distinct clusters to satisfy the distinct synchronization behaviors in the different clusters [1,2,3,4,5,6]. It is worth noting that, in application, achieving synchronization within a finite time can better meet practical needs [7]. Therefore, some admirable achievements with respect to FTCS for DNs have been obtained [8,9,10,11,12,13].
However, the network models in the above-mentioned literature [8,9,10,11,12,13] focus on the integer order case and the real state space. Note that the fractional order network systems can characterize the quality of memory and heredity of nodes [14,15,16]. This inspires us to explore the dynamical behaviors of fractional-order complex-valued dynamical networks (FCVDNs) [17,18,19,20,21,22]. To date, several noticeable results in FTCS of complex DNs have been acquired. For example, by utilizing the separation method to convert complex-valued networks into two real-valued, synchronization problems for fractional-order complex-valued neural networks were studied [23,24]. It should be pointed out that the separation method may increase the complexity of theoretical analysis and calculation. To overcome this drawback, some norms about the sign function of complex numbers were introduced to address the synchronization issue of FCVDNs [25,26].
Furthermore, time delay is utilized to describe the dependence of the current state change rate on past states, a technique that is employed widely in communication networks, power systems, drug circulation systems, and so on. The existence of the time delay can increase the difficulty of analyzing system dynamic behaviors and reduce system stability [27,28]. In recent important works, the authors only considered no delay, a single time delay, or a single coupling delay [25,26,29,30], which differs from dynamical systems in the actual world. Hence, the question of how to eliminate the impact of both time and coupling delays to achieve the cluster synchronization of FFCVDNs is a valuable and challenging issue. On the other hand, due to the complexities of nodes’ dynamics and topological structures, complex dynamical networks are not always able to synchronize by themselves. Therefore, different effective control approaches such as state feedback control [8,9] and adaptive control [10,11] have been applied to achieve finite-time cluster synchronization. As a feasible and effective control strategy, adaptive control has fascinated a considerable number of scholars in recent years, since it can automatically adjust the control parameters based on the operating environment changes to achieve optimal control. Therefore, it is necessary to design an adaptive control strategy to solve the FTCS. Regretfully, to the best of our knowledge, few results for the FTCS of FFCVDNs with time delay under the adaptive control scheme have been published.
Motivated by the above discussion, this paper focuses on the FTCS issue of FFCVDNs with internal delay as well as non-delayed and delayed couplings. The main contributions of this paper can be summarized as follows: (1) A general fractional order complex network model is investigated, where the state space is extended to the complex number field. In the meantime, the internal delay and couplings delay are introduced to describe the complex dynamic behaviors of nodes. (2) A non-separation approach is adopted to simplify the design of the adaptive control strategy and decrease the computational costs. (3) The delay-dependent and delay-independent adaptive control schemes are utilized to realize the FTCS; less conservative results are obtained compared with the existing works.
The content of this paper is listed as follows: in Section 2, preliminaries and a model are offered; in Section 3, the delay-dependent and delay-independent adaptive controllers are utilized to realize FTCS for the delayed FFCVDNs, respectively; in Section 4, some numerical simulation examples are provided; Section 5 concludes this study.
Notations. In this study, R , R + , C , C n , and C m × n denote the real field, positive real field, complex field, n-dimensional complex space, and m × n -dimensional complex matrices, respectively. For any K = D + i Q C , K ¯ = D i Q , | K | 1 = | D | + | Q | , | K | 2 = K ¯ K , [ K ] = sign ( Re ( K ) ) + i sign ( Im ( K ) ) , i = 1 . For any K = ( K 1 , K 2 , , K n ) C n , K = Re ( K ) + i Im ( K ) , K 1 = Re ( K ) 1 + i Im ( K ) 1 , K 2 = K H K . [ K ] = sign ( Re ( K 1 ) ) + i sign ( Im ( K 1 ) ) , , sign ( Re ( K n ) ) + i sign ( Im ( K n ) T represents the signum function vector of K . K H denotes conjugate transposition. Δ ( k ) = 1 , 2 , . . . , k . I N = ( 1 , 1 , . . . , 1 ) N T . d i a g ( l 1 1 , l 2 , . . . l n ) , E N and C n ( [ t 0 , + ) denote an n × n diagonal matrix, the n-dimensional identity matrix, and the set of all continuous n-differential functions from [ t 0 , + ) into C , respectively. Γ ( · ) is the gamma function.

2. Preliminaries and Modeling

Definition 1 
([31,32]). The fractional integral of order 0 < α < 1 for f ( t ) : [ t 0 , + ) C is defined by:
t 0 I t α = 1 Γ ( α ) t 0 t ( t s ) α 1 f ( s ) d s .
Definition 2 
([31,32]). For f C n ( [ t 0 , + ) , C ), the Caputo fractional-order derivative α-order is defined as:
t 0 C D t α f ( t ) = 1 Γ ( 1 α ) t 0 t f ( s ) ( t s ) α d s , 0 < α < 1 .
In this work, we consider the delayed FFCVDNs composed of r communities and N nodes; the dynamic equation of the i-th ( i Δ ( N ) ) model is described by:
t 0 C D t α x i ( t ) = f ς i ( x i ( t ) , x i ( t π 1 ) ) + c 1 k = 1 r j C k a i j G 1 x j ( t ) + c 2 k = 1 r j C k b i j G 2 x j ( t π 2 ) ,
where x i ( t ) = ( x i 1 ( t ) , x i 2 ( t ) , , x i n ( t ) ) T C n ; C k represents a set of nodes belonging to the kth cluster; ς i : Δ ( N ) Δ ( r ) satisfies that if i C k , then ς i = k ; f ς i : C n × C n C n is a nonlinear function; c 1 , c 2 C represent the coupling strength; π 1 and π 2 denote the internal delay and the coupling delay, respectively; G l = diag ( δ 1 ( l ) , δ 2 ( l ) , , δ n ( l ) ) C n × n ( l = 1 , 2 ) is the inner matrix; and A = ( a i j ) N × N and B = ( b i j ) N × N denote the topological structure of the FFCVDNs without and with delay, respectively, satisfying the following rules. If nodes i and j exist a connection, then a i j , b i j 0 C , a i i = j = 1 , j i N a i j , b i i = j = 1 , j i N b i j ; otherwise, a i j = b i j = 0 ( i j ) .
Suppose N nodes are divided into r nonempty communities indicated by Δ ( N ) = v = 1 r C k , where C 1 = { 1 , , q 1 } , C 2 = { q 1 + 1 , , q 2 } , ⋯, C r = { q r 1 + 1 , , N } . Then, A and B can be respectively expressed as:
A = A 11 A 12 A 1 r A 21 A 22 A 2 r A r 1 A r 2 A r r , B = B 11 B 12 B 1 r B 21 B 22 B 2 r B r 1 B r 2 B r r .
Assumption 1. 
Matrices A p m and B p m satisfy zero row sum matrices p , m = 1 , 2 , , r .
Remark 1. 
According to Assumption 1, there exists a cooperative relationship between nodes in the same community, while there exists a cooperative or competitive relationship between nodes in different communities.
The isolated system is described by:
t 0 C D t α s ς i ( t ) = f ς i ( s ς i ( t ) , s ς i ( t π ) )
and satisfies s ς i ( t ) s ς j   ( ς i ς j ) .
Definition 3. 
To achieve the FTCS goal of (1) and (2), define e i ( t ) = x i ( t ) s ς i ( t ) as the error variables, e ( t 0 ) = x i ( 0 ) s ς i ( 0 ) . Under the controller u i ( t ) , (1) and (2) are said to realize FTCS if there exists an ST function T ( e ( t 0 ) ) such that lim t T ( e ( t 0 ) ) e i ( t ) = 0 , and e i ( t ) 0 for t > T ( e ( t 0 ) ) .
From Assumption 1, we infer that j C k a i j G 1 s k ( t ) = 0 and j C k b i j G 2 s k ( t π 2 ) = 0 . Further, the error system can be expressed as:
t 0 C D t α e i ( t ) = F ς i ( e i ( t ) , e i ( t π 1 ) ) + c 1 k = 1 r j C k a i j G 1 e j ( t ) + c 2 k = 1 r j C k b i j G 2 e j ( t π 2 ) + u i ( t ) ,
where u i ( t ) is the control law, and F ς i ( e i ( t ) , e i ( t π 1 ) ) = f ς i ( x i ( t ) , x i ( t π 1 ) ) f ς i ( s ς i ( t ) , s ς i ( t π 1 ) ) .
Assumption 2. 
For x ( t ) , y ( t ) C n , t 0 , there exist constants ϑ k ( p ) > 0 , ζ k ( p ) > 0 ( p = 1 , 2 ) such that:
f ^ k ( x ( t ) , x ( t π 1 ) ) f ^ k ( y ( t ) , y ( t π 1 ) ) p ϑ k ( p ) x ( t ) y ( t ) p + ζ k ( p ) x ( t π 1 ) y ( t π 1 ) p .
Remark 2. 
It is not difficult to verify that many chaotic dynamical systems satisfy Assumption 2, such as the Lorenz system, the Chua system, delayed DNs, etc. [33,34,35].
Lemma 1 
([36]). Let f ( t ) be a continuously differentiable function; then:
t 0 C D t α f 2 ( t ) 2 f ( t ) t 0 C D t α f ( t ) , t [ t 0 , ) , α ( 0 , 1 ) .
Lemma 2 
([25,37]). Let ( t ) C n be differentiable; then:
t 0 C D t α H ( t ) ( t ) H ( t ) t 0 C D t α ( t ) + t 0 C D t α H ( t ) ( t ) , α ( 0 , 1 ) , t t 0 .
Lemma 3 
([25,30]). Let α ( 0 , 1 ) , ( ) , ( t ) C n and C ; then:
( a ) t 0 C D t α H ( ) [ ( t ) ] + [ ( t ) ] H ( t ) [ ( t ) ] H t 0 C D t α ( t ) + t 0 C D t α H ( ) [ ( t ) ] ( b ) H ( ) [ ( t ) ] + [ ( t ) ] H ( t ) = 2 ( t ) 1 2 ( t ) 2 . ( c ) H ( ) [ ( t ) ] + [ ( t ) ] H ( ) 2 ( ) 1 . ( d ) + ¯ = 2 Re ( ) | | 2 | | 1 .
Lemma 4 
([25]). If there is a Λ > 0 that satisfies:
t 0 C D t α V ( t ) Λ , V ( t ) R + ,
then for all t T * , lim t T * V ( t ) = 0 and V ( t ) 0 , where:
T * = t 0 + V ( t 0 ) Γ ( α + 1 ) Λ 1 α .

3. Main Results

The FTCS issue for the considered FFCVDNs is addressed by designing delay-dependent and delay-independent adaptive controllers, respectively, in this section.

3.1. Delay-Dependent Adaptive Control

Theorem 1. 
Suppose that Assumptions 1–2 hold. Considering systems (1) and (2), the controller is designed as:
u i ( t ) = d i ( t ) e i ( t ) Λ [ e i ( t ) ] e i ( t ) 1 1 2 p = 1 2 ε i ( p ) e i ( t π p ) , e i ( t ) 0 , 0 , e i ( t ) = 0 ,
where the feedback strength d i ( t ) is adapted based on the following updated law:
t 0 C D t α d i ( t ) = ϱ i e i H ( t ) e i ( t ) ,
and ϱ i , Λ , θ ˇ i ( 1 ) , θ ˇ i ( 2 ) > 0 , satisfying:
ζ ( 2 ) Θ ( 1 ) 0 , c 2 δ l ( 2 ) B Θ ( 2 ) 0 , c 2 ¯ δ l ( 2 ) ¯ B H Θ ( 2 ) 0 ,
where l = Δ ( n ) , ζ ( 2 ) = diag ( ζ 1 ( 2 ) , , ζ 1 ( 2 ) 1 , , q 1 , ζ 2 ( 2 ) , , ζ 2 ( 2 ) q 1 + 1 , , q 2 , ζ r ( 2 ) , , ζ r ( 2 ) q r 1 + 1 , , N ) , Θ ( 1 ) = diag ( θ ˇ 1 ( 1 ) , θ ˇ 2 ( 1 ) , , θ ˇ N ( 1 ) ) , Θ ( 2 ) = diag ( θ ˇ 1 ( 2 ) , θ ˇ 2 ( 2 ) , , θ ˇ N ( 2 ) ) ; then, the FFCVDNs (1) and (2) can realize FTCS via controllers (6) and (7). Additionally, the ST is estimated as:
T T 1 = t 0 + V 1 ( t 0 ) Γ ( α + 1 ) Λ 1 α ,
where V 1 ( t 0 ) = 1 2 i = 1 N e i H ( t 0 ) e i ( t 0 ) + 1 ϱ i ( d ^ i ( t 0 ) d i ) 2 , e i ( t 0 ) and d ^ i ( t 0 ) are the initial values of e i ( t ) and d i ( t ) , respectively. d i is a positive constant such that 2 ϑ ( 2 ) + c 1 δ l ( 1 ) A + c 1 ¯ δ l ( 1 ) ¯ A H 2 D 0 , ϑ ( 2 ) = diag ( ϑ 1 ( 2 ) , , ϑ 1 ( 2 ) 1 , , q 1 , ϑ 2 ( 2 ) , , ϑ 2 ( 2 ) q 1 + 1 , , q 2 , ϑ r ( 2 ) , , ϑ r ( 2 ) q r 1 + 1 , , N ) , D = diag ( d 1 , d 2 , , d N ) .
Proof. 
Construct the Lyapunov function:
V 1 ( e ( t ) ) = 1 2 i = 1 N 1 ϱ i ( d i ( t ) d i ) 2 + e i H ( t ) e i ( t ) .
By employing Lemmas 1 and 2, the derivative of V 1 ( t ) and the solution of (3) are computed as:
t 0 C D t α V 1 ( e ( t ) ) 1 2 i = 1 N e i H ( t ) F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) e i ( t ) + 1 2 i = 1 N k = 1 r j C k e i H ( t ) c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H e i ( t ) + 1 2 i = 1 N k = 1 r j C k e i H ( t ) c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H e i ( t ) i = 1 N d i ( t ) e i H ( t ) e i ( t ) 1 2 p = 1 2 i = 1 N θ ˇ i ( p ) ( e i H ( t ) e i ( t π p ) + e i H ( t π p ) e i ( t ) ) + i = 1 N ( d i ( t ) d i ) e i H ( t ) e i ( t ) Λ i = 1 , e i ( t ) 0 N e i H ( t ) [ e i ( t ) ] + [ e i ( t ) ] H e i ( t ) e i ( t ) 1 .
Based on Assumption 1 and Lemma 3, this yields that:
1 2 i = 1 N e i H ( t ) F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) e i ( t ) l = 1 n e l H ( t ) ϑ ( 2 ) e l ( t ) + 1 2 l = 1 n e l H ( t ) ζ ( 2 ) e l ( t π 1 ) + e l H ( t π 1 ) ζ ( 2 ) e l ( t ) .
By using Lemma 3 again, we derive:
1 2 i = 1 N k = 1 r j C k e i H ( t ) c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H e i ( t ) = 1 2 l = 1 n e l H ( t ) c 1 δ l ( 1 ) A + c 1 ¯ δ l ( 1 ) ¯ A H e l ( t ) ,
and
1 2 i = 1 N k = 1 r j C k e i H ( t ) c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H e i ( t ) = 1 2 l = 1 n e l H ( t ) c 2 δ l ( 2 ) B e l ( t π 2 ) + e l H ( t π 2 ) c 2 ¯ δ l ( 2 ) ¯ B H e l ( t ) .
For i Δ ( N ) , there is at least an index i, making e i ( t ) 0 for any t t 0 . Correspondingly, we can obtain:
Λ i = 1 , e i ( t ) 0 N e i H ( t ) [ e i ( t ) ] + [ e i ( t ) ] H e i ( t ) e i ( t ) 1 Λ .
Substituting (12)–(16) into (11) gives:
t 0 C D t α V 1 ( t ) l = 1 n e l H ( t ) c 2 δ l ( 2 ) B Θ ( 2 ) e l ( t π 2 ) + l = 1 n e l H ( t ) ( ζ ( 2 ) Θ ( 1 ) ) e l ( t π 1 ) + 1 2 l = 1 n e l H ( t ) 2 D + 2 ϑ ( 2 ) + c 1 δ l ( 1 ) A + c 1 ¯ δ l ( 1 ) ¯ A H e l ( t ) Λ Λ .
On the basis of Lemma 4, the FFCVDNs (1) and (2) under controllers (6) and (7) can achieve FTCS within T 1 . This completes the proof. □
Theorem 2. 
Suppose that Assumptions 1 and 2 hold. Considering systems (1) and (2), the controller is designed as:
u i ( t ) = d i ( t ) e i ( t ) Λ [ e i ( t ) ] 1 2 p = 1 2 θ ˇ i ( p ) [ e i ( t ) ] e i H ( t π p ) [ e i ( t π p ) ] ,
where the feedback strength d i ( t ) is adapted given the updated law mentioned below:
t 0 C D t α d i ( t ) = 1 2 ϱ i [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] ,
and ϱ i , Λ , θ ˇ i ( 1 ) , θ ˇ i ( 2 ) > 0 , i = 1 , 2 , , N satisfying:
ζ ( 1 ) Θ ( 1 ) 0 , Ψ ( l ) Θ ( 2 ) 0 ,
for l = Δ ( n ) , where ζ ( 1 ) = diag ( ζ 1 ( 1 ) , , ζ 1 ( 1 ) 1 , , q 1 , ζ 2 ( 1 ) , , ζ 2 ( 1 ) q 1 + 1 , , q 2 , ζ r ( 1 ) , , ζ r ( 1 ) q r 1 + 1 , , N ) , Θ ( p ) = diag ( θ ˇ 1 ( p ) , θ ˇ 2 ( p ) , , θ ˇ N ( p ) ) , ( p = 1 , 2 ) , Ψ ( l ) = ( Ψ i j ( l ) ) N × N and Ψ i j ( l ) = | Re ( c 2 b i j δ l ( 2 ) ) | + | Im ( c 2 b i j δ l ( 2 ) ) | ; then, the FFCVDNs (1) can achieve FNTS under controllers (17) and (18). Moreover, the ST is estimated by:
T T 2 = t 0 + V 2 ( t 0 ) Γ ( α + 1 ) Λ 1 α ,
where V 2 ( t 0 ) = 1 2 i = 1 N ( e i ( t 0 ) 1 + 1 ϱ i ( d ^ i ( t 0 ) d i ) 2 ) . d i > 0 satisfies ϑ ( 1 ) + Υ ( l ) D 0 , ϑ ( 1 ) = diag ( ϑ 1 ( 1 ) , , ϑ 1 ( 1 ) 1 , , q 1 , ϑ 2 ( 1 ) , , ϑ 2 ( 1 ) q 1 + 1 , , q 2 , ϑ r ( 1 ) , , ϑ r ( 1 ) q r 1 + 1 , , N ) , D = diag ( d 1 , d 2 , , d N ) , Υ ( l ) = ( τ i j ( l ) ) N × N and
τ i j ( l ) = Re ( c 1 a i i δ l ( 1 ) ) + | Im ( c 1 a i i δ l ( 1 ) ) | , i = j , | c 1 a i j δ l ( 1 ) | 1 , i j .
Proof. 
Consider the Lyapunov function:
V 2 ( t ) = 1 2 i = 1 N 1 ϱ i ( d i ( t ) d i ) 2 + e i H ( t ) [ e i ( t ) ] + [ e i ( t ) ] H e i ( t ) .
By employing Lemmas 1 and 3, the derivative of V 2 ( t ) for the solution of (3) is computed as:
t 0 C D t α V 2 ( t ) 1 2 i = 1 N [ e i ( t ) ] H F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) [ e i ( t ) ] + 1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H [ e i ( t ) ] + 1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H [ e i ( t ) ] 1 2 i = 1 N d i ( t ) [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] Λ i = 1 N [ e i ( t ) ] H [ e i ( t ) ] 1 2 r = 1 2 i = 1 N θ ˇ i ( r ) [ e i ( t π r ) ] H e i ( t π r ) + e i H ( t π r ) [ e i ( t π r ) ] + 1 2 i = 1 N ( d i ( t ) d i ) [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] .
In the light of Assumption 1 and Lemma 3, one obtains:
1 2 i = 1 N [ e i ( t ) ] H F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) [ e i ( t ) ] i = 1 N F ς i ( e i ( t ) , e i ( t π 1 ) ) 1 = l = 1 n I N T ϑ ( 1 ) e l ( t ) ˜ + l = 1 n I N T ζ ( 1 ) e l ( t π 1 ) ˜ ,
where e l ( t ) ˜ = | e 1 l ( t ) | 1 , | e 2 l ( t ) | 1 , , | e N l ( t ) | 1 T and e l ( t π 1 ) ˜ = | e 1 l ( t π 1 ) | 1 , | e 2 l ( t π 1 ) | 1 , , | e N l ( t π 1 ) | 1 T .
Furthermore, from Lemma 3, it holds that: that
1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H [ e i ( t ) ] = l = 1 n I N T Υ ( l ) e l ( t ) ˜ ,
and
1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H [ e i ( t ) ] = l = 1 n I N T Ψ ( l ) e l ( t π 2 ) ˜ .
Additionally, it is not difficult to find:
Λ i = 1 N [ e i ( t ) ] H [ e i ( t ) ] = Λ i = 1 N l = 1 n sign ( Re ( e i l ( t ) ) ) 2 + sign ( Im ( e i l ( t ) ) ) 2 .
There is at least a pair of ( i , l ) for i Δ ( N ) and l Δ ( n ) , such that e i l ( t ) 0 for any t t 0 . Therefore, we obtain:
Λ i = 1 N [ e i ( t ) ] H [ e i ( t ) ] Λ .
On grounds of Lemma 3, we have:
1 2 i = 1 N d i [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] = l = 1 n I N T D e l ( t ) ˜ ,
and
1 2 p = 1 2 i = 1 N ε i ( p ) [ e i ( t π p ) ] H e i ( t π p ) + e i H ( t π p ) [ e i ( t π p ) ] = p = 1 2 l = 1 n I N T Θ ( p ) e l ( t π p ) ˜ .
Substituting (23)–(25) and (27)–(28) into (22) gives:
t 0 C D t α V 2 ( t ) l = 1 n I N T ϑ ( 1 ) + Υ ( l ) D e l ( t ) ˜ + l = 1 n I N T ζ ( 1 ) Θ ( 1 ) e l ( t π 1 ) ˜ + l = 1 n I N T Ψ ( l ) Θ ( 2 ) e l ( t π 2 ) ˜ Λ Λ .
Similarly, based on Lemma 4, the FFCVDNs (1) under controllers (17) and (18) can achieve FTCS within T 2 . This completes the proof. □
Remark 3. 
It follows that e i ( t 0 ) 1 e i ( t 0 ) 2 and that T 1 T 2 for choosing the same Λ, ϱ i , and d i . This indicates that, when assessing the ST under the same conditions, Theorem 1 provides a more accurate result than Theorem 2. In addition, from (9) and (34), it is clear that the ST is connected to the fractional-order α and the control parameter Λ.

3.2. Delay-Independent Adaptive Control

Superficially, the above delay-dependent adaptive controllers (6) and (17) are somewhat complicated and difficult to adopt in practice. Therefore, it is interesting and challenging to design delay-independent adaptive controllers to achieve FTCS of FFCVDNs.
Theorem 3. 
Suppose that Assumptions 1 and 2 hold. The control law is designed as:
u i ( t ) = d i ( t ) e i ( t ) Λ [ e i ( t ) ] e i ( t ) 1 , e i ( t ) 0 , 0 e i ( t ) = 0 ,
where the feedback strength d i ( t ) is adapted given the updated law mentioned below:
t 0 C D t α d i ( t ) = ϱ i e i H ( t ) e i ( t ) ,
and ϱ i , Λ > 0 . If the following conditions are satisfied:
ζ ( 2 ) 2 Θ ( 1 ) 0 , Ψ ( l ) 2 Θ ( 2 ) 0 ,
where θ ˇ i ( 1 ) > 0 , θ ˇ i ( 2 ) > 0 are constants, ζ ( 2 ) = diag ( ζ 1 ( 2 ) , , ζ 1 ( 2 ) 1 , , q 1 , ζ 2 ( 2 ) , , ζ 2 ( 2 ) q 1 + 1 , , q 2 , ζ r ( 2 ) , , ζ r ( 2 ) q r 1 + 1 , , N ) , Θ ( p ) = diag ( ε 1 ( p ) , θ ˇ 2 ( p ) , , θ ˇ N ( p ) ) , ( p = 1 , 2 ) , Ψ ( l ) = ( Ψ i j ( l ) ) N × N and Ψ i j ( l ) = | Re ( c 2 b i j δ l ( 2 ) ) | + | Im ( c 2 b i j δ l ( 2 ) ) | , then the FFCVDNs (1) are said to achieve FNTS under controllers (31) and (32). Further, the ST can be estimated by:
T T 3 = t 0 + V 3 ( t 0 ) Γ ( α + 1 ) Λ 1 α ,
in which V 3 ( t 0 ) = i = 1 N 1 2 e i H ( t 0 ) e i ( t 0 ) + p = 1 2 θ ˇ i ( p ) t 0 π p t 0 e i H ( s ) e i ( s ) d s + 1 2 ϱ i ( d ^ i ( t 0 ) d i ) 2 . d i > 0 such that 2 ϑ ( 2 ) + ζ ( 2 ) + c 1 δ l ( 1 ) A + c 1 ¯ δ l ( 1 ) ¯ A H + 2 Θ ( 1 ) + 2 Θ ( 2 ) + Ψ ( l ) 2 D 0 , ϑ ( 2 ) = diag ( ϑ 1 ( 2 ) , , ϑ 1 ( 2 ) 1 , , q 1 , ϑ 2 ( 2 ) , , ϑ 2 ( 2 ) q 1 + 1 , , q 2 , ϑ r ( 2 ) , , ϑ r ( 2 ) q r 1 + 1 , , N ) , D = diag ( d 1 , d 2 , , d N ) .
Proof. 
Construct the following Lyapunov functional:
V 3 ( e ( t ) ) = i = 1 N 1 2 ϱ i ( d i ( t ) d i ) 2 + p = 1 2 θ ˇ i ( p ) t π p t e i H ( s ) e i ( s ) d s + 1 2 e i H ( t ) e i ( t ) .
By employing Lemmas 1 and 2, the derivative of V 3 ( t ) for the solution of (3) is computed as:
t 0 C D t α V 3 ( e ( t ) ) 1 2 i = 1 N e i H ( t ) F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) e i ( t ) + 1 2 i = 1 N k = 1 r j C k e i H ( t ) c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H e i ( t ) + 1 2 i = 1 N k = 1 r j C k e i H ( t ) c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H e i ( t ) i = 1 N d i ( t ) e i H ( t ) e i ( t ) Λ i = 1 , e i ( t ) 0 N [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] e i ( t ) 1 + i = 1 N ( d i ( t ) d i ) e i H ( t ) e i ( t ) + p = 1 2 i = 1 N θ ˇ i ( p ) e i H ( t ) e i ( t ) p = 1 2 i = 1 N θ ˇ i ( p ) e i H ( t π p ) e i ( t π p ) .
Similar to the derivation of (12) and (14), we have
1 2 i = 1 N e i H ( t ) F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) e i ( t ) l = 1 n e l H ( t ) ϑ ( 2 ) e l ( t ) + 1 2 l = 1 n e l H ( t ) ζ ( 2 ) e l ( t ) + 1 2 l = 1 n e l H ( t π 1 ) ζ ( 2 ) e l ( t π 1 ) ,
and
1 2 i = 1 N k = 1 r j C k e i H ( t ) c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H e i ( t ) 1 2 l = 1 n j = 1 N l = 1 n e i l ( t ) ¯ | Re ( c 2 b i j δ l ( 2 ) ) | + | Im ( c 2 b i j δ l ( 2 ) ) | e i l ( t ) + 1 2 l = 1 n j = 1 N l = 1 n e j l ( t π 2 ) ¯ | Re ( c 2 b i j δ l ( 2 ) ) | + | Im ( c 2 b i j δ l ( 2 ) ) | e j l ( t π 2 ) = 1 2 l = 1 n e l H ( t ) Ψ ( l ) e l ( t ) + 1 2 l = 1 n e l H ( t π 2 ) Ψ ( l ) e l ( t π 2 ) .
Substituting (13), (16), (37), and (38) into (36) gives:
t 0 C D t α V 3 ( t ) 1 2 l = 1 n e l H ( t ) ( 2 ϑ ( 2 ) + ζ ( 2 ) + c 1 δ l ( 1 ) A + c 1 ¯ δ l ( 1 ) ¯ A H + 2 Θ ( 1 ) + 2 Θ ( 2 ) + Ψ ( l ) 2 D ) e l ( t ) Λ + 1 2 l = 1 n e l H ( t π 1 ) ( ζ ( 2 ) 2 Θ ( 1 ) ) e l ( t π 1 ) + 1 2 l = 1 n e l H ( t π 2 ) ( Ψ ( l ) 2 Θ ( 2 ) ) e l ( t π 2 ) Λ .
According to Lemma 4, the FFCVDNs (1) under controllers (31) and (32) can achieve FNTS within the time T 3 . The proof of Theorem 3 is complete. □
Theorem 4. 
Suppose that Assumptions 1 and 2 hold. The control law is designed as:
u i ( t ) = d i ( t ) e i ( t ) Λ [ e i ( t ) ] ,
where the feedback strength d i ( t ) is adapted given the updated law mentioned below:
t 0 C D t α d i ( t ) = 1 2 ϱ i [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] ,
and ϱ i , Λ > 0 . If there exist constants θ ˇ i ( 1 ) > 0 and θ ˇ i ( 2 ) > 0 such that:
ζ ( 1 ) Θ ( 1 ) 0 , Ψ ( l ) Θ ( 2 ) 0 ,
where ζ ( 1 ) = diag ( ζ 1 ( 1 ) , , ζ 1 ( 1 ) 1 , , q 1 , ζ 2 ( 1 ) , , ζ 2 ( 1 ) q 1 + 1 , , q 2 , ζ r ( 1 ) , , ζ r ( 1 ) q r 1 + 1 , , N ) , Θ ( p ) = diag ( θ ˇ 1 ( p ) , θ ˇ 2 ( p ) , , θ ˇ N ( p ) ) , ( p = 1 , 2 ) , Ψ ( l ) = ( ψ i j ( l ) ) N × N and ψ i j ( l ) = | Re ( c 2 b i j δ l ( 2 ) ) | + | Im ( c 2 b i j δ l ( 2 ) ) | , then the FFCVDNs (1) can achieve FTCS under controllers (17) and (18). Moreover, the ST is estimated by:
T T 4 = t 0 + V 4 ( t 0 ) Γ ( α + 1 ) Λ 1 α ,
in which V 4 ( t 0 ) = 1 2 i = 1 N e i ( t 0 ) 1 + 1 ϱ i ( d ^ i ( t 0 ) d i ) 2 + p = 1 2 θ ˇ i ( p ) t 0 π p t 0 e i ( s ) 1 d s . d i > 0 such that ϑ ( 1 ) + Υ ( l ) + Θ ( 1 ) + Θ ( 2 ) D 0 , D = diag ( d 1 , d 2 , , d N ) , ϑ ( 1 ) = diag ( ϑ 1 ( 1 ) , , ϑ 1 ( 1 ) 1 , , q 1 , ϑ 2 ( 1 ) , , ϑ 2 ( 1 ) q 1 + 1 , , q 2 , ϑ r ( 1 ) , , ϑ r ( 1 ) q r 1 + 1 , , N ) , Υ ( l ) = ( τ i j ( l ) ) N × N and
τ i j ( l ) = Re ( c 1 a i i δ l ( 1 ) ) + | Im ( c 1 a i i δ l ( 1 ) ) | , i = j , | c 1 a i j δ l ( 1 ) | 1 , i j .
Proof. 
Construct the following Lyapunov functional:
V 4 ( e ( t ) ) = 1 2 i = 1 N ( 1 ϱ i ( d i ( t ) d i ) 2 + e i H ( t ) [ e i ( t ) ] + [ e i ( t ) ] H e i ( t ) + p = 1 2 ε i ( p ) t π p t e i H ( s ) [ e i ( s ) ] + [ e i ( s ) ] H e i ( s ) d s ) .
By employing Lemmas 1 and 3, the derivative of V 4 ( t ) for the solution of (3) is computed as:
t 0 C D t α V 4 ( t ) 1 2 i = 1 N [ e i ( t ) ] H F ς i ( e i ( t ) , e i ( t π 1 ) ) + F ς i H ( e i ( t ) , e i ( t π 1 ) ) [ e i ( t ) ] + 1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 1 a i j G 1 e j ( t ) + e j H ( t ) c 1 a i j ¯ G 1 H [ e i ( t ) ] + 1 2 i = 1 N k = 1 r j C k [ e i ( t ) ] H c 2 b i j G 2 e j ( t π 2 ) + e j H ( t π 2 ) c 2 b i j ¯ G 2 H [ e i ( t ) ] 1 2 i = 1 N d i ( t ) [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] Λ i = 1 N [ e i ( t ) ] H [ e i ( t ) ] + 1 2 i = 1 N ( d i ( t ) d i ) [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] + 1 2 p = 1 2 i = 1 N θ ˇ i ( p ) [ e i ( t ) ] H e i ( t ) + e i H ( t ) [ e i ( t ) ] 1 2 p = 1 2 i = 1 N θ ˇ i ( p ) [ e i ( t π p ) ] H e i ( t π p ) + e i H ( t π p ) [ e i ( t π p ) ] .
Similar to the proof of Theorem 2, this yields that:
t 0 C D t α V 4 ( t ) l = 1 n I N T ϑ ( 1 ) + Υ ( l ) + Θ ( 1 ) + Θ ( 2 ) D e l ( t ) ˜ Λ + l = 1 n I N T ζ ( 1 ) Θ ( 1 ) e l ( t π 1 ) ˜ + l = 1 n I N T Ψ ( l ) Θ ( 2 ) e l ( t π 2 ) ˜ Λ .
By virtue of Lemma 4, the FFCVDNs (1) under controllers (40) and (41) can achieve FNTS within time T 4 . The proof of Theorem 4 is complete. □
Remark 4. 
The controllers (7) and (18) include the time delays π p , 1 2 p = 1 2 θ ˇ i ( p ) e i ( t π p ) or 1 2 p = 1 2 θ ˇ i ( p ) [ e i ( t ) ] e i H ( t π p ) [ e i ( t π p ) ] . This implies the control inputs are large. However, the conclusions derived from delay-dependent control are more accurate in estimating the ST under the same d i ( t ) , Λ, ϱ i , and initial values. Similarly, in the adaptive update laws (7), (18), (32) and (41), the sufficiently small adaptive gains ϱ i can cause small control inputs, but the estimation for the upper bounds of ST may be quite large. Therefore, there is a trade-off between the control performance and the ST when using the adaptive control technique to handle FNTS of DNs. In selecting the adaptive gains of them, one should consider the real requirements.
Remark 5. 
Time delay widely exists in systems. To achieve FFCVDNs of FTCS, delay-dependent and delay-independent adaptive controllers have been designed in this paper. Delay-independent controllers are often easy to implement and analyze and also have lower control energy transmission. On the contrary, the delay-dependent controller with high control cost will usually achieve better finite-time synchronization. Therefore, in practical applications, different types of controllers can be selected based on task requirements.
Remark 6. 
In recent years, scholars have conducted research on the finite-time synchronization problem of FCVDNs [17,25,30,33]. However, there are some limitations in these studies, as listed below. Firstly, in [17,25], the system parameters consist of complex and real values. Compared to these, fully complex-valued systems are more practical and have a complex mathematical derivation. Secondly, time delay was not considered in [17,25,30], which is a common phenomenon in reality. Thirdly, when using state feedback control in [33], the feedback strength is fixed, which is less energy-efficient compared to the adaptive control strategy used in this paper.
Remark 7. 
Finite-time synchronization has a faster convergence rate compared with asymptotic and exponential synchronization, as the estimated ST is based on the initial states. In fact, when the initial state is unknown, the ST cannot be estimated. Therefore, it is interesting and necessary to study the FNTS of FFCVDNs. Next, we further explore the fixed time convergence results.
Remark 8. 
This article studies the FNTS of FFCVDNs by designing the adaptive controllers. DNs are considered fully complex-valued networks, which represent more general situations and have wider applications. These can be applied in research such as signal processing, audio analysis, and engineering control, etc.

4. Numerical Simulations

Consider FFCVDNs consisting of 3 communities: C 1 = { 1 , 2 , 3 } , C 2 = { 4 , 5 , 6 } , C 3 = { 7 , 8 , 9 } and 9 nodes, each 3-dimensional. The topology among the different clusters is shown in Figure 1. Set c 1 = 8 2 i , c 2 = 2 2 i , π 1 = 0.2 , π 2 = 0.1 , B = 0.2 A ,
G 1 = 1.5 + 1.5 i 0 0 0 1.4 + 1.5 i 0 0 0 1.4 + 1.5 i , G 2 = 1.8 + 1.8 i 0 0 0 1.9 + 1.9 i 0 0 0 1.9 + 2.1 i ,
A 11 = 1 1 i 1 + 1 i 0 1 + 1 i 2 2 i 1 + 1 i 0 1 + 1 i 1 1 i , A 12 = 1 1 i 0 1 + 1 i 0 0 0 0 0 0 ,
A 13 = 0 0 0 1 1 i 1 + 1 i 0 0 0 0 , A 21 = 0 0 0 1 + 1 i 1 1 i 0 0 0 0 ,
A 22 = 1 1 i 1 + 1 i 0 1 + 1 i 2 2 i 1 + 1 i 1 + 1 i 1 + 1 i 2 2 i , A 23 = 1 1 i 1 + 1 i 0 0 0 0 0 0 0 ,
A 31 = 0 0 0 0 0 0 0 0 0 , A 32 = 1 1 i 0 1 + 1 i 0 0 0 0 0 0 , A 33 = 1 1 i 1 + 1 i 0 1 + 1 i 1 1 i 0 0 1 + 1 i 1 1 i .
The nonlinear vector functions in the 3 communities are selected as:
f 1 ( x i ( t ) , x i ( t π 1 ) ) = D ˜ 1 x i ( t ) + g 1 ( x i ( t ) ) + h 1 ( x i ( t π 1 ) ) ,   i = 1 , 2 , 3 , f 2 ( x i ( t ) , x i ( t π 1 ) ) = D ˜ 2 x i ( t ) + g 2 ( x i ( t ) ) + h 2 ( x i ( t π 1 ) ) ,   i = 4 , 5 , 6 , f 3 ( x i ( t ) , x i ( t π 1 ) ) = D ˜ 3 x i ( t ) + g 3 ( x i ( t ) ) + h 3 ( x i ( t π 1 ) ) ,   i = 7 , 8 , 9 ,
where x i ( t ) = ( x i 1 ( t ) , x i 1 ( t ) , x i 3 ( t ) ) T C 3 ,
g 1 ( x i ( t ) ) = ( 0 , x i 1 x i 3 , x i 1 ¯ x i 2 + x i 1 x i 2 ¯ 2 ) T ,
g 2 ( x i ( t ) ) = ( 0 , x i 1 x i 3 , x i 1 ¯ x i 2 + x i 1 x i 2 ¯ 2 ) T ,
g 3 ( x i ( t ) ) = ( 0 , x i 1 x i 3 , x i 1 ¯ x i 2 + x i 1 x i 2 ¯ 2 + i Re ( x i 2 ) Im ( x i 1 ) ) T ,
h 1 ( x i ( t ) ) = ( 0 , ( 0.2 0.2 i ) cos ( Re ( x i 2 ) ) + sin ( Im ( x i 2 ) ) i , 0 ) T ,
h 2 ( x i ( t ) ) = ( 0 , ( 0.1 + 0.1 i ) cos ( Re ( x i 2 ) ) + sin ( Im ( x i 2 ) ) i , 0 ) T ,
h 3 ( x i ( t ) ) = ( 0 , ( 0.2 + 0.1 i ) cos ( Re ( x i 2 ) ) + sin ( Im ( x i 2 ) ) i , 0 ) T ,
D ˜ 1 = 34.99 34.91 0 6.99 27.92 0 0 0 2.98 , D ˜ 2 = 1.99 1.98 0 59.9 + 0.02 i 1 0.06 i 0 0 0 0.79 ,
D ˜ 3 = 20.95 20.98 0 0 9.86 0 0 0 5.94 .
The initial conditions of system (1) are selected as:
x i 1 ( π ) = 1.5 0.5 i + ( 1.3 + 0.5 i ) i , x i 2 ( π ) = 2.8 + 0.5 i ( 1.1 + 0.5 i ) i , x i 3 ( π ) = 4.1 + 0.5 i + ( 1 + 0.5 i ) i ,
where π [ 0.2 , 0 ] . Additionally, the trajectories of the system (2) are provided in Figure 2 with the initial values s 1 ( π ) = ( 1.5 + 1.1 i , 2.1 1.2 i , 3.9 + 0.5 i ) T , s 2 ( π ) = ( 2.7 + 2.5 i , 3.8 1.9 i , 5.3 + 2.6 i ) T , s 3 ( π ) = ( 3.8 + 5.1 i , 5 5.3 i , 5.8 + 5.9 i ) T , π [ 0.2 , 0 ] , when α = 0.97.
Figure 1. The topology of system (1) with 3 communities. C k represents different communities, k = Δ ( 3 ) .
Figure 1. The topology of system (1) with 3 communities. C k represents different communities, k = Δ ( 3 ) .
Fractalfract 07 00645 g001
Two examples are then given to demonstrate the correctness and flexibility of the outcomes.

4.1. Example 1

First, consider the FTCS of the FFCVDNs with time delay (1) with the controllers (17) and (18). Let d ^ 1 ( t 0 ) = d ^ 2 ( t 0 ) = d ^ 3 ( t 0 ) = 69 ,   d ^ 4 ( t 0 ) = d ^ 5 ( t 0 ) = d ^ 6 ( t 0 ) = 105 ,   d ^ 7 ( t 0 ) = d ^ 8 ( t 0 ) = d ^ 9 ( t 0 ) = 42 , θ ˇ 1 ( 1 ) = θ ˇ 2 ( 1 ) = θ ˇ 3 ( 1 ) = 0.28 ,   θ ˇ 4 ( 1 ) = θ ˇ 5 ( 1 ) = θ ˇ 6 ( 1 ) = 0.15 ,   θ ˇ 7 ( 1 ) = θ ˇ 8 ( 1 ) = θ ˇ 9 ( 1 ) = 0.3 , θ ˇ 1 ( 2 ) = 3 ,   θ ˇ 2 ( 2 ) = 6 ,   θ ˇ 3 ( 2 ) = 3 ,   θ ˇ 4 ( 2 ) = 3.1 ,   θ ˇ 5 ( 2 ) = 6.1 ,   θ ˇ 6 ( 2 ) = 6.1 ,   θ ˇ 7 ( 2 ) = 3.3 ,   θ ˇ 8 ( 2 ) = 3.3 ,   θ ˇ 9 ( 2 ) = 3.3 , α = 0.97 , Λ = 9.5 , ϱ i = 10 , d 1 = d 2 = d 3 = 70 , d 4 = d 5 = d 6 = 107 , d 7 = d 8 = d 9 = 45 , i Δ ( 9 ) . According to Theorem 2, FFCVDNs can achieve FNTS. Figure 3 depicts the trajectories of the feedback strength d i ( t ) . Apparently, feedback strength d i ( t ) converges to the fixed values at the end. Figure 4 shows the trajectories of synchronization errors (2) via controllers (17) and (18). Obviously, the synchronization errors of nodes within the same community converge to 0. Figure 4 shows the trajectories of synchronization errors (2) via controllers (17) and (18). Obviously, the same community’s synchronization errors converge to zero.
In FFCVDNs, there exists three communities. Figure 5 depicts the trajectories of state variables x i 1 , x i 2 , and x i 3 ( i = Δ ( 9 ) ) of system (1) via controllers (17) and (18). It is clear that nodes from the same community have similar dynamic behaviors, whereas nodes from other communities display different dynamic behaviors. This means that the system has achieved FTCS. The ST can be estimated as T 2 3.8318 .

4.2. Example 2

Next, consider the FTCS of proposed network (1) with controllers (40) and (41). Let d ^ 1 ( t 0 ) = d ^ 2 ( t 0 ) = d ^ 3 ( t 0 ) = 90 ,   d ^ 4 ( t 0 ) = d ^ 5 ( t 0 ) = d ^ 6 ( t 0 ) = 107 ,   d ^ 7 ( t 0 ) = d ^ 8 ( t 0 ) = d d ^ 9 ( t 0 ) = 44 , θ ˇ 1 ( 1 ) = θ ˇ 2 ( 1 ) = θ ˇ 3 ( 1 ) = 0.28 ,   θ ˇ 4 ( 1 ) = θ ˇ 5 ( 1 ) = θ ˇ 6 ( 1 ) = 0.15 ,   θ ˇ 7 ( 1 ) = θ ˇ 8 ( 1 ) = θ ˇ 9 ( 1 ) = 0.3 , θ ˇ 1 ( 2 ) = 3 ,   θ ˇ 2 ( 2 ) = 6 ,   θ ˇ 3 ( 2 ) = 3 ,   θ ˇ 4 ( 2 ) = 3.1 ,   θ ˇ 5 ( 2 ) = 6.1 ,   θ ˇ 6 ( 2 ) = 6.1 ,   θ ˇ 7 ( 2 ) = 3.3 ,   θ ˇ 8 ( 2 ) = 3.3 ,   θ ˇ 9 ( 2 ) = 3.3 , α = 0.97 , Λ = 9.5 , ϱ i = 70 , d 1 = d 2 = d 3 = 99 ,   d 4 = d 5 = d 6 = 114 ,   d 7 = d 8 = d 9 = 49 , i = Δ ( 9 ) . Then, the conditions in Theorem 4 are met, which means FFCVDNs can achieve FNTS. Figure 6 depicts the trajectories of the feedback strength d i ( t ) . From Figure 6, we can see that the feedback strength d i ( t ) converges to fixed values at the end. Figure 7 describes the trajectories of synchronization errors (2) via controllers (40) and (41). Obviously, the synchronization errors of nodes within the same community converge to 0.
The trajectories of x i 1 , x i 2 , and x i 3 ( i = Δ ( 9 ) ) of system (1) via controllers (40) and (41) are shown in Figure 7. It is easy to see that the nodes from the same community have similar dynamic behaviors, whereas nodes from other communities display different dynamic behaviors. According to Figure 7 and Figure 8, system (1) can achieve FTCS via controllers (40) and (41), and the ST can be estimated as T 4 5.6279.
Remark 9. 
From Figure 4, Figure 5, Figure 7, and Figure 8, it can be seen that the real ST is shorter than the evaluated ST and that there exists an estimation error. On the one hand, it is because the use of Lemmas 1–3 amplifies the estimation of ST, and on the other hand, it is prone to errors when simulating actual systems. Based on the above discussion, finding a more accurate ST estimation will be one of our future research topics.
Remark 10. 
As shown in Figure 3 and Figure 6, the feedback strength d i ( t ) automatically adjusts with changes to the operating environment. Adaptive control can reduce the conservatism on state feedback control in which the feedback strength is fixed; thus, the strength must be maximal, which means a kind of waste in practice.

5. Conclusions

In this paper, the FTCS issue for FFCVDNs with time delay have been studied. The delay-dependent and delay-independent controllers have been designed based on the quadratic norm and the absolute-valued norm instead of transforming the complex-valued networks into two independent real-valued systems. Some synchronization criteria have been established to ensure the realization of FNTS, where the ST is related to the fractional order α and fractional-order power law Λ . Finally, some illustrative simulations show the correctness of the theoretical results. The results can be applied to the analysis of dynamical networks, such as traffic control, communication engineering, distributed computing, etc. Significantly, in practical application, some phenomena can be better characterized by discontinuous systems [38,39]. This inspires us to study the FTCS of discontinuous systems in the future.

Author Contributions

Conceptualization, K.X. and J.Y.; methodology, K.X.; software, Q.K.; validation, J.Y. and H.C.; writing—original draft preparation, K.X.; writing—review and editing, Q.K.; visualization, Q.K.; supervision, H.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Gan, Q.T.; Xiao, F.; Qin, Y.; Yang, J. Fixed-time cluster synchronization of discontinuous directed community networks via periodically or aperiodically switching control. IEEE Access. 2019, 7, 83306–83318. [Google Scholar] [CrossRef]
  2. Boonsatit, N.; Rajendran, S.; Lim, C.P.; Jirawattanapanit, A.; Mohandas, P. New Adaptive Finite-Time Cluster Synchronization of Neutral-Type Complex-Valued Coupled Neural Networks with Mixed Time Delays. Fractal Fract. 2022, 6, 515. [Google Scholar] [CrossRef]
  3. Fan, H.; Shi, K.; Zhao, Y. Pinning impulsive cluster synchronization of uncertain complex dynamical networks with multiple time-varying delays and impulsive effects. Phys. A 2022, 587, 126534. [Google Scholar] [CrossRef]
  4. He, Q.; Ma, Y. Quantized adaptive pinning control for fixed/preassigned-time cluster synchronization of multi-weighted complex networks with stochastic disturbances. Nonlinear Anal. Hybrid Syst. 2022, 44, 101157. [Google Scholar] [CrossRef]
  5. Yang, S.; Hu, C.; Yu, J.; Jiang, H.J. Finite-time cluster synchronization in complex-variable networks with fractional-order and nonlinear coupling. Neural Netw. 2021, 135, 212–224. [Google Scholar] [CrossRef]
  6. Yang, Q.; Wu, H.; Cao, J.D. Pinning exponential cluster synchronization for fractional-order complex dynamical networks with switching topology and mode-dependent impulses. Neurocomputing 2021, 428, 182–194. [Google Scholar] [CrossRef]
  7. Bhat, S.P.; Bernstein, D.S. Finite-time stability of homogeneous system. In Proceedings of the American Control Conference, Albuquerque, NM, USA, 6 June 1997; pp. 2513–2514. [Google Scholar]
  8. Cai, S.; Zhou, F.; He, Q. Fixed-time cluster lag synchronization in directed heterogeneous community networks. Phys. A 2019, 525, 128–142. [Google Scholar] [CrossRef]
  9. Cui, W.; Fang, J.A.; Zhang, W.B.; Wang, X. Finite-time cluster synchronisation of Markovian switching complex networks with stochastic perturbations. IET Control Theory Appl. 2014, 8, 30–41. [Google Scholar] [CrossRef]
  10. Jiang, S.Q.; Lu, X.B.; Cai, G.L.; Cai, S.M. Adaptive finite-time control for overlapping cluster synchronization in coupled complex networks. Neurocomputing 2017, 266, 188–195. [Google Scholar] [CrossRef]
  11. Jiang, S.Q.; Lu, X.B.; Cai, G.L.; Cai, S.M. Adaptive fixed-time control for cluster synchronisation of coupled complex networks with uncertain disturbances. Int. J. Syst. Sci. 2017, 48, 3382–3390. [Google Scholar] [CrossRef]
  12. Liu, X.W.; Chen, T.P. Finite-time and fixed-time cluster synchronization with or without pinning control. IEEE Trans. Cybern. 2018, 48, 240–252. [Google Scholar] [CrossRef]
  13. Yang, X.S.; Ho, D.W.; Lu, J.Q.; Song, Q. Finite-time cluster synchronization of T-S fuzzy complex networks with discontinuous subsystems and random coupling delays. IEEE Trans. Fuzzy Syst. 2015, 23, 2302–2316. [Google Scholar] [CrossRef]
  14. Li, H.L.; Cao, J.D.; Jiang, H.J.; Alsaedi, A. Finite-time synchronization and parameter identification of uncertain fractional-order complex networks. Phys. A 2019, 587, 533. [Google Scholar] [CrossRef]
  15. Li, Y.; Kao, Y.G.; Wang, C.H.; Xia, H.W. Finite-time synchronization of delayed fractional-order heterogeneous complex networks. Neurocomputing 2020, 384, 368–375. [Google Scholar] [CrossRef]
  16. Peng, X.; Wu, H.Q.; Cao, J.D. Global nonfragile synchronization in finite time for fractional-order discontinuous neural networks with nonlinear growth activations. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 2123–2137. [Google Scholar] [CrossRef]
  17. Xu, Y.; Li, W.X. Finite-time synchronization of fractional-order complex-valued coupled systems. Phys. A 2020, 549, 123903. [Google Scholar] [CrossRef]
  18. Li, H.L.; Cao, J.D.; Jiang, H.J.; Alsaedi, A. Finite-time synchronization of fractional-order complex networks via hybrid feedback control. Neurocomputing 2018, 320, 69–75. [Google Scholar] [CrossRef]
  19. Li, H.L.; Cao, J.D.; Jiang, H.J.; Alsaedi, A. Graph theory-based finite-time synchronization of fractional-order complex dynamical networks. J. Frankl. Inst. 2018, 355, 5771–5789. [Google Scholar] [CrossRef]
  20. Lu, J.Y.; Guo, Y.P.; Ji, Y.D.; Fan, S.S. Finite-time synchronization for different dimensional fractional-order complex dynamical networks. Chaos Solitons Fract. 2020, 130, 109433. [Google Scholar] [CrossRef]
  21. Jia, Y.; Wu, H.; Cao, J.D. Non-fragile robust finite-time synchronization for fractional-order discontinuous complex networks with multi-weights and uncertain couplings under asynchronous switching. Appl. Math. Comput. 2020, 370, 124929. [Google Scholar] [CrossRef]
  22. Zhang, L.Z.; Zhong, J.; Lu, J.Q. Intermittent control for finite-time synchronization of fractional-order complex networks. Neural Netw. 2021, 144, 11–22. [Google Scholar] [CrossRef] [PubMed]
  23. Jian, J.; Wang, P. Lagrange α-exponential stability and α-exponential convergence for fractional-order complex-valued neural networks. Neural Netw. 2017, 91, 1–10. [Google Scholar] [CrossRef]
  24. Kaslik, E.; Radulescu, I.R. Dynamics of complex-valued fractional-order neural networks. Neural Netw. 2017, 89, 39–49. [Google Scholar] [CrossRef]
  25. Hou, T.Q.; Yu, J.; Hu, C.; Jiang, H.J. Finite-time synchronization of fractional-order complex-variable dynamic networks. IEEE Trans. Syst. Man Cybern.Syst. 2021, 51, 4297–4307. [Google Scholar] [CrossRef]
  26. Zheng, B.B.; Hu, C.; Yu, J.; Jiang, H.J. Finite-time synchronization of fully complex-valued neural networks with fractional-order. Neurocomputing 2020, 373, 70–80. [Google Scholar] [CrossRef]
  27. Long, C.Q.; Zhang, G.D.; Zeng, Z.G.; Hu, J.H. Finite-time stabilization of complex-valued neural networks with proportional delays and inertial terms: A non-separation approach. Neural Netw. 2022, 148, 86–95. [Google Scholar] [CrossRef]
  28. Das, S.; Das, P.; Das, P. Dynamics and control of multidrug-resistant bacterial infection in hospital with multiple delays. Commun. Nonlinear Sci. Numer. Simul. 2020, 89, 105279. [Google Scholar] [CrossRef]
  29. Ren, Y.; Jiang, H.J.; Li, J.R.; Lu, B.L. Finite-time synchronization of stochastic complex networks with random coupling delay via quantized aperiodically intermittent control. Neurocomputing 2021, 420, 337–348. [Google Scholar] [CrossRef]
  30. Xiong, K.L.; Yu, J.; Hu, C.; Jiang, H.J. Synchronization in finite/fixed time of fully complex-valued dynamical networks via nonseparation approach. J. Frankl. Inst. 2020, 357, 473–493. [Google Scholar] [CrossRef]
  31. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: New York, NY, USA, 2006. [Google Scholar]
  32. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  33. Kang, Q.; Yang, Q.; Yang, J.; Gan, Q.; Li, R. Synchronization in finite-time of delayed fractional-order fully complex-valued dynamical networks via non-separation method. Entropy 2022, 24, 1460. [Google Scholar] [CrossRef]
  34. Xia, W.G.; Cao, J.D. Pinning synchronization of delayed dynamical networks via periodically intermittent control. Chaos 2009, 19, 013120. [Google Scholar] [CrossRef] [PubMed]
  35. Cai, S.M.; He, Q.B.; Hao, J.J.; Liu, Z.R. Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes. Phys. A 2010, 374, 2539–2550. [Google Scholar] [CrossRef]
  36. Yu, J.; Hu, C.; Jiang, H.J. Corrogendum to “Projective synchronization for fractional neural networks”. Neural Netw. 2015, 67, 152–154. [Google Scholar] [CrossRef]
  37. Xu, Q.; Zhuang, S.X.; Liu, S.J.; Xiao, J. Decentralized adaptive coupling synchronization of fractional-order complex-variable dynamical networks. Neurocomputing 2016, 186, 119–126. [Google Scholar] [CrossRef]
  38. Danca, M. Controlling chaos in discontinuous dynamical systems. Chaos Solitons Fract. 2014, 22, 605–612. [Google Scholar] [CrossRef]
  39. Forti, M.; Grazzini, M.; Nistri, P.; Pancioni, L. Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations. Phys. D 2006, 214, 88–99. [Google Scholar] [CrossRef]
Figure 2. State trajectories for system (2) with 3 different communities. Obviously, the internal status of nodes belonging to different communities varies.
Figure 2. State trajectories for system (2) with 3 different communities. Obviously, the internal status of nodes belonging to different communities varies.
Fractalfract 07 00645 g002
Figure 3. The curves between feedback strength d i ( t ) and time t under the initial values d 1 ( t 0 ) = d 2 ( t 0 ) = d 3 ( t 0 ) = 69 ,   d 4 ( t 0 ) = d 5 ( t 0 ) = d 6 ( t 0 ) = 105 ,   d 7 ( t 0 ) = d 8 ( t 0 ) = d 9 ( t 0 ) = 42 , i = Δ ( 9 ) . Feedback strength d i ( t ) converges to fixed values at the end.
Figure 3. The curves between feedback strength d i ( t ) and time t under the initial values d 1 ( t 0 ) = d 2 ( t 0 ) = d 3 ( t 0 ) = 69 ,   d 4 ( t 0 ) = d 5 ( t 0 ) = d 6 ( t 0 ) = 105 ,   d 7 ( t 0 ) = d 8 ( t 0 ) = d 9 ( t 0 ) = 42 , i = Δ ( 9 ) . Feedback strength d i ( t ) converges to fixed values at the end.
Fractalfract 07 00645 g003
Figure 4. The solutions to synchronization errors e i j over time t, i = Δ ( 9 ) ,   j = Δ ( 3 ) . It is easy to see that e i j converges to zero in the same community, which indicates that the internal nodes within the same community can achieve synchronization within T 2 = 3.8318 .
Figure 4. The solutions to synchronization errors e i j over time t, i = Δ ( 9 ) ,   j = Δ ( 3 ) . It is easy to see that e i j converges to zero in the same community, which indicates that the internal nodes within the same community can achieve synchronization within T 2 = 3.8318 .
Fractalfract 07 00645 g004
Figure 5. Trajectories of state variables x i j of system (1) under controllers (17) and (18), i = Δ ( 9 ) ,   j = Δ ( 3 ) . In each community, the trajectories of nodes can converge to the corresponding target trajectories. (a) Trajectories of x i 1 under controllers (17) and (18), i = Δ ( 9 ) . (b) Trajectories of x i 2 under controllers (17) and (18), i = Δ ( 9 ) . (c) Trajectories of x i 3 under controllers (17) and (18), i = Δ ( 9 ) .
Figure 5. Trajectories of state variables x i j of system (1) under controllers (17) and (18), i = Δ ( 9 ) ,   j = Δ ( 3 ) . In each community, the trajectories of nodes can converge to the corresponding target trajectories. (a) Trajectories of x i 1 under controllers (17) and (18), i = Δ ( 9 ) . (b) Trajectories of x i 2 under controllers (17) and (18), i = Δ ( 9 ) . (c) Trajectories of x i 3 under controllers (17) and (18), i = Δ ( 9 ) .
Fractalfract 07 00645 g005
Figure 6. The curves between feedback strength d i ( t ) and time t under the initial values d 1 ( t 0 ) = d 2 ( t 0 ) = d 3 ( t 0 ) = 90 ,   d 4 ( t 0 ) = d 5 ( t 0 ) = d 6 ( t 0 ) = 107 ,   d 7 ( t 0 ) = d 8 ( t 0 ) = d 9 ( t 0 ) = 44 , i = Δ ( 9 ) . Feedback strength d i ( t ) converges to fixed values at the end.
Figure 6. The curves between feedback strength d i ( t ) and time t under the initial values d 1 ( t 0 ) = d 2 ( t 0 ) = d 3 ( t 0 ) = 90 ,   d 4 ( t 0 ) = d 5 ( t 0 ) = d 6 ( t 0 ) = 107 ,   d 7 ( t 0 ) = d 8 ( t 0 ) = d 9 ( t 0 ) = 44 , i = Δ ( 9 ) . Feedback strength d i ( t ) converges to fixed values at the end.
Fractalfract 07 00645 g006
Figure 7. The solutions to synchronization errors e i j over time t, i = Δ ( 9 ) ,   j = Δ ( 3 ) . It is easy to see that e i j converges to zero in the same community, which indicates that the internal nodes within the same community can achieve synchronization within T 4 = 5.6279 .
Figure 7. The solutions to synchronization errors e i j over time t, i = Δ ( 9 ) ,   j = Δ ( 3 ) . It is easy to see that e i j converges to zero in the same community, which indicates that the internal nodes within the same community can achieve synchronization within T 4 = 5.6279 .
Fractalfract 07 00645 g007
Figure 8. Trajectories of state variables x i j of system (1) under controllers (40) and (41), i = Δ ( 9 ) ,   j = Δ ( 3 ) . In each community, the trajectories of nodes can converge to the corresponding target trajectories. (a) Trajectories of x i 1 under controllers (40) and (41), i = Δ ( 9 ) . (b) Trajectories of x i 2 under the controllers (40) and (41), i = Δ ( 9 ) . (c) Trajectories of x i 3 under controllers (40) and (41), i = Δ ( 9 ) .
Figure 8. Trajectories of state variables x i j of system (1) under controllers (40) and (41), i = Δ ( 9 ) ,   j = Δ ( 3 ) . In each community, the trajectories of nodes can converge to the corresponding target trajectories. (a) Trajectories of x i 1 under controllers (40) and (41), i = Δ ( 9 ) . (b) Trajectories of x i 2 under the controllers (40) and (41), i = Δ ( 9 ) . (c) Trajectories of x i 3 under controllers (40) and (41), i = Δ ( 9 ) .
Fractalfract 07 00645 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Xiang, K.; Kang, Q.; Chang, H.; Yang, J. Adaptive Control for Finite-Time Cluster Synchronization of Fractional-Order Fully Complex-Valued Dynamical Networks. Fractal Fract. 2023, 7, 645. https://doi.org/10.3390/fractalfract7090645

AMA Style

Xiang K, Kang Q, Chang H, Yang J. Adaptive Control for Finite-Time Cluster Synchronization of Fractional-Order Fully Complex-Valued Dynamical Networks. Fractal and Fractional. 2023; 7(9):645. https://doi.org/10.3390/fractalfract7090645

Chicago/Turabian Style

Xiang, Kaiquan, Qiaokun Kang, Hao Chang, and Jing Yang. 2023. "Adaptive Control for Finite-Time Cluster Synchronization of Fractional-Order Fully Complex-Valued Dynamical Networks" Fractal and Fractional 7, no. 9: 645. https://doi.org/10.3390/fractalfract7090645

APA Style

Xiang, K., Kang, Q., Chang, H., & Yang, J. (2023). Adaptive Control for Finite-Time Cluster Synchronization of Fractional-Order Fully Complex-Valued Dynamical Networks. Fractal and Fractional, 7(9), 645. https://doi.org/10.3390/fractalfract7090645

Article Metrics

Back to TopTop