Next Article in Journal
L1 Adaptive Control for Marine Structures
Previous Article in Journal
Does a New Electric Vehicle Manufacturer Have the Incentive for Battery Life Investment? A Study Based on the Game Framework
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adaptive Global Synchronization for a Class of Quaternion-Valued Cohen-Grossberg Neural Networks with Known or Unknown Parameters

1
College of Applied Mathematics, Chengdu University of Information Technology, Chengdu 610225, China
2
School of Science, Southwest Petroleum University, Chengdu 610500, China
3
School of Mathematics and Physics, Hunan University of Arts and Science, Changde 415000, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(16), 3553; https://doi.org/10.3390/math11163553
Submission received: 6 June 2023 / Revised: 20 July 2023 / Accepted: 14 August 2023 / Published: 17 August 2023
(This article belongs to the Section Dynamical Systems)

Abstract

:
In this paper, the adaptive synchronization problem of quaternion-valued Cohen–Grossberg neural networks (QVCGNNs), with and without known parameters, is investigated. On the basis of constructing an appropriate Lyapunov function, and utilizing parameter identification theory and decomposition methods, two effective adaptive feedback schemes are proposed, to guarantee the realization of global synchronization of CGQVNNs. The control gain of the above schemes can be obtained using the Matlab LMI toolbox. The theoretical results presented in this work enrich the literature exploring the adaptive synchronization problem of quaternion-valued neural networks (QVNNs). Finally, the reliability of the theoretical schemes derived in this work is shown in two interesting numerical examples.

1. Introduction

Over recent decades, Cohen–Grossberg neural networks (CGNNs), which were introduced and explored by Cohen and Grossberg [1], have aroused widespread interest for their potential applications in image processing, control problems, and optimizations, and a variety of outcomes utilizing CGNNs have been reported [2,3,4,5,6,7,8]. However, these results have mainly been concentrated in the real (complex) number field, and there are few reports on the exploration of CGNNs with quaternion parameters in the literature [9,10].
A quaternion, initially introduced and explored by Hamilton [11], consists of a real unit and three imaginary units. If we regard a quaternion as an extension of plural space into real space with higher dimensions, that is, treat a quaternion as four-dimensional real space, then problems that cannot be solved in three-dimensional space can be solved by mapping to four-dimensional space, such as gimbal lock, image compression, and so on. It is worth mentioning that, differently from the real number and plural, the multiplication exchange law no longer supports quaternions, which makes it more difficult to explore the dynamics of QVNNs. Therefore, studying the dynamic characteristics of QVNNs is a challenging topic. Recently, many results such as the μ -stability [12,13], stability [14,15,16,17,18], anti-synchronization [19,20], and synchronization [21,22,23,24,25,26] of QVNNs have been reported. However, to the best of our knowledge, there are few reports on the dynamic characteristics of QVCGNNs in the literature. Therefore, it is necessary to further explore QVCGNNs.
Synchronization involves coupled systems reaching identical dynamical behaviors at the same time. Since the synchronization of two chaotic systems was first achieved in 1990 by Pecora and Carrol [27] using the drive–response method, chaos synchronization began to enter the field of vision of researchers.To solve the synchronization problem, scholars have designed many control methods and obtained various outcomes [19,20,21,22,23,24,25,26,28,29,30,31,32]. Based on the Lyapunov stability theory and introducing a new definition for global quasi-synchronization, Refs. [21,29] explored the quasi-synchronization problem of chaotic systems with parameter mismatch. Based on parameter identification and utilizing adaptive control and Lyapunov functionals, Ref. [24] successfully explored exponential synchronization of CGNNs. For memristive neural networks (MNNs), refs. [22,26] designed different controllers to explore fixed-time synchronization in a quaternion field. Through dividing the model into equivalent real-valued systems, utilizing fixed-time theory, and constructing novel nonlinear feedback controllers, fixed-time synchronization of a neural network with delays was investigated in [23]. Based on the adaptive control theory and by designing a linear feedback controller with an update law, Ref. [32] achieved the synchronization of two coupled neural networks in the case of known or unknown parameters. However, reports about the synchronization of CGQVNNs are rare, let alone adaptive synchronization.
Motivated by the aforementioned factor, the goal of this work was to investigate the adaptive synchronization control of CGQVNNs, with and without known parameters. The main contributions of this work are outlined as follows:
(1)
Reports focusing on the adaptive synchronization of QVCGNNs are rare. This is the first exploration of the adaptive synchronization of QVCGNNs with known or unknown parameters;
(2)
Different easy to implement feedback control schemes are designed, to guarantee adaptive synchronization in the case of known and unknown parameters, utilizing parameter identification theory, decomposition methods, and Lyapunov theory;
(3)
QVNNs are an expansion of RVNNs and CVNNs; hence, the theoretical results presented in this paper can also be applied to RVNNs and CVNNs.
The remaining contents of this work are summarized as follows: In Section 2, we introduce the network model and preliminaries. The schemes of adaptive control are given in Section 3. In Section 4, simulation examples are presented, to demonstrate the correctness of the results.
Notations: Q denotes a quaternion-valued field. Q n and Q n × m denote the n-dimensional quaternion-valued vector space and the quaternion-valued matrix space with n × m dimensions, respectively. R n and R n × m denote the n-dimensional real-valued vector space the real-valued matrix space with n × m dimensions, respectively. C < 0 ( C > 0 ) means that C is a negative (positive) definite matrix. The smallest eigenvalue of matrix A is denoted by λ m i n ( A ) .

2. Model Description and Preliminaries

A quaternion q Q , consisting of a real part and three imaginary parts, can be described as
q = q R + q I i + q J j + q K k ,
where q R , q I , q J , q K R . i , j , k are imaginary units. i , j , k follow the Hamilton rules:
i 2 = j 2 = k 2 = i j k = 1 , i j = j i = k , j k = k j = i , k i = i k = j .
For any q i = q i 1 + q i 2 i + q i 3 j + q i 4 k Q , q ¯ i means conjugate with q ¯ i = q i 1 q i 2 i q i 3 j q i 4 k , | q i | = q i 1 2 + q i 2 2 i + q i 3 2 j + q i 4 2 k means modulus. q = i = 1 n | q i | 2 means the norm, where q = ( q 1 , q 2 , . . . , q n ) Q n .
For the two different quaternions q and p, where q = q R + q I i + q J j + q K k , p = p R + p I i + p J j + p K k ; then, using the Hamilton rule, we can denote q p as
q p = ( q R p R q I p I q J p J q K p K ) + ( q R p I + q I p R + q J p K q K p J ) i + ( q R p J + q J p R + q K p J q I p K ) j + ( q R p K + q K p R + q I p J q J p I ) k .
Remark 1.
According to the Hamilton rules, we can see that the commutative law does not hold for quaternion multiplication. For this reason, natures that hold for the real and complex fields may not be applicable to quaternions, which greatly increases the difficulty of calculation and analysis, and the previous methods dealing with RVNNS and CVNNs cannot be applied directly to QVNNs.Therefore, how to choose different methods for exploring the dynamic behaviors of QVNNs is a challenging problem.
Consider the following simplified QVCGNNs with time delays:
s ˙ ( t ) = C [ k ( s ( t ) ) A f ( s ( t ) ) B g ( s ( t ν ) ) + J ( t ) ] ,
where s ( · ) = ( s 1 ( · ) , s 2 ( · ) , , s n ( · ) ) ) T Q n represents the state vector. C = d i a g ( c 1 , c 2 , , c n ) Q n × n stands for the amplification gain. k ( s ( · ) ) = ( k 1 ( s 1 ( · ) ) , , k n ( s n ( · ) ) ) T : Q n Q n denotes the vector-valued behaved function. A, B Q n × n denote the connection weight matrix and the delayed connection weight matrix, respectively. f ( s ( · ) ) = ( f 1 ( s 1 ( · ) ) , , f n ( s n ( · ) ) ) T and g ( s ( · ) ) = ( g 1 ( s 1 ( · ) ) , , g n ( s n ( · ) ) ) T : Q n Q n represent activation function without and with time delays, respectively. ν i is the time delay with ν i 0 . J ( t ) = ( J 1 ( t ) , J 2 ( t ) , , J n ( t ) ) T Q n stands for the external input vector.
Remark 2.
Compared with typical CGNNs, the amplification function in model (1) is constant. Thus, model (1) is a special case of the classical CGNNs.
For research purposes, the following assumptions are given:
Assumption 1.
Assume that for s ¯ , s Q , there exist real diagonal matrices M i j R n × n ( i , j = R , I , J , K ) with M i j > 0 , such that
| f R ( s ) f R ( s ¯ ) | M R R | s R s ¯ R | + M R I | s I s ¯ I | + M R J | s J s ¯ J | + M R K | s K s ¯ K | , | f I ( s ) f I ( s ¯ ) | M I R | s R s ¯ R | + M I I | s I s ¯ I | + M I J | s J s ¯ J | + M I K | s K s ¯ K | , | f J ( s ) f J ( s ¯ ) | M J R | s R s ¯ R | + M J I | s I s ¯ I | + M J J | s J s ¯ J | + M J K | s K s ¯ K | , | f K ( s ) f K ( s ¯ ) | M K R | s R s ¯ R | + M K I | s I s ¯ I | + M K J | s J s ¯ J | + M K K | s K s ¯ K | .
Similarly, for g ( · ) , there exist real diagonal matrices N i j R n × n ( i , j = R , I , J , K ) with N i j > 0 such that
| g R ( s ) g R ( s ¯ ) | N R R | s R s ¯ R | + N R I | s I s ¯ I | + N R J | s J s ¯ J | + N R K | s K s ¯ K | , | g I ( s ) g I ( s ¯ ) | N I R | s R s ¯ R | + N I I | s I s ¯ I | + N I J | s J s ¯ J | + N I K | s K s ¯ K | , | g J ( s ) g J ( s ¯ ) | N J R | s R s ¯ R | + N J I | s I s ¯ I | + N J J | s J s ¯ J | + N J K | s K s ¯ K | , | g K ( s ) g K ( s ¯ ) | N K R | s R s ¯ R | + N K I | s I s ¯ I | + N K J | s J s ¯ J | + N K K | s K s ¯ K | .
Assumption 2.
Assume that, for s Q , k ( s ) can be expressed as
k ( s ) = k R ( s ) + k I ( s ) i + k J ( s ) j + k K ( s ) k .
Lemma 1 ([33]).
Assume that Ω 1 , Ω 2 ,   a n d   Ω 3 are real matrices with appropriate dimensions and Ω 3 satisfies Ω 3 > 0 , then for x , y R n , one has
2 x T Ω 1 T Ω 2 y x T Ω 1 T Ω 3 Ω 1 x + y T Ω 2 T Ω 3 1 Ω 2 y .
Then, the response system is designed as follows:
s ˜ ˙ ( t ) = C [ k ( s ˜ ( t ) ) A f ( s ˜ ( t ) ) B g ( s ˜ ( t ν ) ) + J ( t ) ] + U ( t ) ,
where s ˜ ( t ) = ( s ˜ 1 ( t ) , s ˜ 2 ( t ) , , s ˜ n ( t ) ) Q n is the response state vector, U ( t ) = ( U 1 ( t ) , U 2 ( t ) , , U n ( t ) ) Q n is the external control input.
Define X ( t ) = s ˜ ( t ) s ( t ) as the synchronization error signal between the drive and response system, then
X ˙ ( t ) = C [ k ˜ ( X ( t ) ) A f ˜ ( X ( t ) ) B g ˜ ( X ( t ν ) ) ] + U ( t ) ,
where k ˜ ( X ( t ) ) = k ( s ˜ ( t ) ) k ( s ( t ) ) , f ˜ ( X ( t ) ) = f ( s ˜ ( t ) ) g ( s ( t ) ) , g ˜ ( X ( t ν ) ) = g ( s ˜ ( t ν ) ) g ( s ( t ν ) ) .
For reasons of simplicity, we show X = X ( t ) , X ν = X ( t ν ) , k ˜ ( X ( t ) ) = k ˜ ( X ) , U = U ( t ) . Let X ( t ) = X R ( t ) + X I ( t ) i + X J ( t ) j + X K ( t ) k . Then, the error system can be divided into the following equivalent system:
X ˙ R = K R ( X ) + A R f ˜ R ( X ) + A I f ˜ I ( X ) + A J f ˜ J ( X ) + A K f ˜ K ( X ) + B R g ˜ R ( X ν ) + B I g ˜ I ( X ν ) + B J g ˜ J ( X ν ) + B K g ˜ K ( X ν ) + U R , X ˙ I = K I ( X ) A I f ˜ R ( X ) + A R f ˜ I ( X ) + A K f ˜ J ( X ) A J f ˜ K ( X ) B I g ˜ R ( X ν ) + B R g ˜ I ( X ν ) + B K g ˜ J ( X ν ) B J g ˜ K ( X ν ) + U I , X ˙ J = K J ( X ) A J f ˜ R ( X ) A K f ˜ I ( X ) + A R f ˜ J ( X ) + A I f ˜ K ( X ) B J g ˜ R ( X ν ) B K g ˜ I ( X ν ) + B R g ˜ J ( X ν ) + B I g ˜ K ( X ν ) + U J , X ˙ K = K K ( X ) A K f ˜ R ( X ) + A J f ˜ I ( X ) A I f ˜ J ( X ) + A R f ˜ K ( X ) B K g ˜ R ( X ν ) + B J g ˜ I ( X ν ) B I g ˜ J ( X ν ) + B R g ˜ K ( X ν ) + U K .
where
K R ( X ) = C R k ˜ R ( X ) + C I k ˜ I ( X ) + C J k ˜ J ( X ) + C K k ˜ K ( X ) , K I ( X ) = C R k ˜ I ( X ) C I k ˜ R ( X ) C J k ˜ K ( X ) + C K k ˜ J ( X ) , K J ( X ) = C R k ˜ J ( X ) C J k ˜ R ( X ) + C I k ˜ K ( X ) C K k ˜ I ( X ) , K K ( X ) = C R k ˜ K ( X ) C K k ˜ R ( X ) C I k ˜ J ( X ) + C J k ˜ I ( X ) , A R = C R A R C I A I C J A J C K A K , A I = C R A I C I A R C J A K + C K A J , A J = C R A J + C I A K C J A R C K A I , A K = C R A K C I A J + C J A I C K A R , B R = C R B R C I B I C J B J C K B K , B I = C R B I C I B R C J B K + C K B J , B J = C R B J + C I B K C J B R C K B I , B K = C R B K C I B J + C J B I C K B R
To achieve global synchronization, we design a control scheme, as follows:
U R ( t ) = ζ R ( t ) X R ( t ) K R ( X ( t ) ) U I ( t ) = ζ I ( t ) X I ( t ) K I ( X ( t ) ) U J ( t ) = ζ J ( t ) X J ( t ) K J ( X ( t ) ) U K ( t ) = ζ K ( t ) X K ( t ) K K ( X ( t ) )
where X i ( t ) = ( X 1 i ( t ) , X 2 i ( t ) , , X n i ( t ) ) R n . ζ i ( t ) = d i a g ( ζ 1 i ( t ) , ζ 2 i ( t ) , , ζ n i ( t ) ) R n × n , ( i = R , I , J , K ) are the coupling strength matrices that are updated on the basis of the following adaptive law:
ζ ˙ p R ( t ) = ω p R ( X p R ( t ) ) 2 ζ ˙ p I ( t ) = ω p I ( X p I ( t ) ) 2 ζ ˙ p J ( t ) = ω p J ( X p J ( t ) ) 2 ζ ˙ p K ( t ) = ω p K ( X p K ( t ) ) 2
where ω p R , ω p I , ω p J , ω p K are positive constants to be determined later, for p = 1 , 2 , , n . In addition, let ω i = d i a g ( ω 1 i , , ω p i , , ω n i )   ( i = R , I , J , K ) .

3. Main Results

In this section, several criteria are proposed for achieving global synchronization of systems (1) and (4) with known and unknown parameters through designing effective controllers.
Theorem 1.
Assume that Assumption 1 holds if a positive matrix S and four positive diagonal matrices ω R , ω I , ω J , ω K exist, such that
Λ = Λ 11 O O O Λ 15 Λ 16 Λ 17 Λ 18 Λ 22 O O Λ 25 Λ 26 Λ 27 Λ 28 Λ 33 O Λ 35 Λ 36 Λ 37 Λ 38 Λ 44 Λ 45 Λ 46 Λ 47 Λ 48 S O O O S O O S O S < 0 ,
where
Λ 11 = 1 2 i = R , I J , K A i ( A i ) T + 2 ( i = R , I J , K j = R , I J K M i j ) + S ω R , Λ 22 = 1 2 i = R , I J , K A i ( A i ) T + 2 ( i = R , I J , K j = R , I J K M i j ) + S ω I , Λ 33 = 1 2 i = R , I J , K A i ( A i ) T + 2 ( i = R , I J , K j = R , I J K M i j ) + S ω J , Λ 44 = 1 2 i = R , I J , K A i ( A i ) T + 2 ( i = R , I J , K j = R , I J K M i j ) + S ω K , Λ 15 = 1 2 | B R | N R R + 1 2 | B I | N I R + 1 2 | B J | N J R + 1 2 | B K | N K R , Λ 16 = 1 2 | B R | N R I + 1 2 | B I | N I I + 1 2 | B J | N J I + 1 2 | B K | N K I , Λ 17 = 1 2 | B R | N R J + 1 2 | B I | N I J + 1 2 | B J | N J J + 1 2 | B K | N K J , Λ 18 = 1 2 | B R | N R K + 1 2 | B I | N I K + 1 2 | B J | N J K + 1 2 | B K | N K K , Λ 25 = 1 2 | B R | N I R + 1 2 | B I | N R R + 1 2 | B J | N K R + 1 2 | B K | N J R , Λ 26 = 1 2 | B R | N I I + 1 2 | B I | N R I + 1 2 | B J | N K I + 1 2 | B K | N J I , Λ 27 = 1 2 | B R | N I J + 1 2 | B I | N R J + 1 2 | B J | N K J + 1 2 | B K | N J J , Λ 28 = 1 2 | B R | N I K + 1 2 | B I | N R K + 1 2 | B J | N K K + 1 2 | B K | N J K , Λ 35 = 1 2 | B J | N R R + 1 2 | B K | N I R + 1 2 | B R | N J R + 1 2 | B I | N K R , Λ 36 = 1 2 | B J | N R I + 1 2 | B K | N I I + 1 2 | B R | N J I + 1 2 | B I | N K I , Λ 37 = 1 2 | B J | N R J + 1 2 | B K | N I J + 1 2 | B R | N J J + 1 2 | B I | N K J , Λ 38 = 1 2 | B J | N R K + 1 2 | B K | N I K + 1 2 | B R | N J K + 1 2 | B I | N K K , Λ 45 = 1 2 | B K | N R R + 1 2 | B J | N I R + 1 2 | B I | N J R + 1 2 | B R | N K R , Λ 46 = 1 2 | B K | N R I + 1 2 | B J | N I I + 1 2 | B I | N J I + 1 2 | B R | N K I , Λ 47 = 1 2 | B K | N R J + 1 2 | B J | N I J + 1 2 | B I | N J J + 1 2 | B R | N K J , Λ 48 = 1 2 | B K | N R K + 1 2 | B J | N I K + 1 2 | B I | N J K + 1 2 | B R | N K K .
Then, under the control function of the controller (6) and corresponding adaptive rule (7), systems (1) and (4) will be globally synchronized.
Proof. 
First, we define the Lyapunov function through the following:
V ( t ) = 1 2 ( ( X R ( t ) ) T X R ( t ) + ( X I ( t ) ) T X I ( t ) + ( X J ( t ) ) T X J ( t ) + ( X K ( t ) ) T X K ( t ) ) + t ν t ( ( X R ( v ) ) T S X R ( v ) + ( X I ( v ) ) T S X I ( v ) + ( X J ( v ) ) T S X J ( v ) + ( X K ( v ) ) T S X K ( v ) ) d v + 1 2 ( p = 1 n 1 ω p R ( ζ p R ( t ) + ω p R ) 2 + p = 1 n 1 ω p I ( ζ p I ( t ) + ω p I ) 2 + p = 1 n 1 ω p J ( ζ p J ( t ) + ω p J ) 2 + p = 1 n 1 ω p K ( ζ p K ( t ) + ω p K ) 2 )
Combining with Lemma 2, the derivative of V ( t ) with respect to t through the solutions of system (5) is as follows:
V ˙ ( t ) ( X R ( t ) ) T ( Θ + S ) X R ( t ) + ( X I ( t ) ) T ( Θ + S ) X I ( t ) + ( X J ( t ) ) T ( Θ + S ) X J ( t ) + ( X K ( t ) ) T ( Θ + S ) X K ( t ) + 2 ( [ f ˜ R ( X ( t ) ) ] T f R ( X ( t ) ) + [ f ˜ I ( X ( t ) ) ] T f I ( X ( t ) ) + [ f ˜ J ( X ( t ) ) ] T f J ( X ( t ) ) + [ f ˜ K ( X ( t ) ) ] T f K ( X ( t ) ) ) p = 1 n ω p R ( X p R ( t ) ) 2 p = 1 n ω p I ( X p I ( t ) ) 2 p = 1 n ω p J ( X p J ( t ) ) 2 p = 1 n ω p R ( X p K ( t ) ) 2 ( X R ( t ν ) ) T S X R ( t ν ) ( X I ( t ν ) ) T S X I ( t ν ) ( X J ( t ν ) ) T S X J ( t ν ) ( X K ( t ν ) ) T S X K ( t ν ) + ( X R ( t ) ) T B R g ˜ R ( X ( t ν ) ) + ( X R ( t ) ) T B I g ˜ I ( X ( t ν ) ) + ( X R ( t ) ) T B J g ˜ J ( X ( t ν ) ) + ( X R ( t ) ) T B K g ˜ K ( X ( t ν ) ) ( X I ( t ) ) T B I g ˜ R ( X ( t ν ) ) + ( X I ( t ) ) T B R g ˜ I ( X ( t ν ) ) + ( X I ( t ) ) T B K g ˜ J ( X ( t ν ) ) ( X I ( t ) ) T B J g ˜ K ( X ( t ν ) ) ( X J ( t ) ) T B J g ˜ R ( X ( t ν ) ) ( X J ( t ) ) T B K g ˜ I ( X ( t ν ) ) + ( X J ( t ) ) T B R g ˜ J ( X ( t ν ) ) + ( X J ( t ) ) T B I g ˜ K ( X ( t ν ) ) ( X K ( t ) ) T B K g ˜ R ( X ( t ν ) ) + ( X K ( t ) ) T B J g ˜ I ( X ( t ν ) ) ( X K ( t ) ) T B I g ˜ J ( X ( t ν ) ) + ( X K ( t ) ) T B R g ˜ K ( X ( t ν ) )
where Θ = 1 2 A R ( A R ) T + 1 2 A I ( A I ) T + 1 2 A J ( A J ) T + 1 2 A K ( A K ) T .
In the light of (2), for i = R , I , J , K , we can obtain:
2 [ f ˜ i ( X ( t ) ) ] T f ˜ i ( X ( t ) ) 2 ( M i R + M i I + M i J + M i K ) ( [ X R ( t ) ] T X R ( t ) + [ X I ( t ) ] T X I ( t ) + [ X J ( t ) ] T X J ( t ) + [ X K ( t ) ] T X K ( t ) )
where M i R = ( M i R ) T M i R , M i I = ( M i I ) T M i I , M i J = ( M i J ) T M i J , M i K = ( M i K ) T M i K .
In the light of (3), the following inequality holds:
( X R ( t ) ) T B R g ˜ R ( X ( t ν ) ) + ( X R ( t ) ) T B I g ˜ I ( X ( t ν ) ) + ( X R ( t ) ) T B J g ˜ J ( X ( t ν ) ) + ( X R ( t ) ) T B K g ˜ K ( X ( t ν ) ) ( X R ( t ) ) T { B R N R R + B I N I R + B J N J R + B K N K R } X R ( t ν ) { B R N R I + B I N I I + B J N J I + B K N K I } X I ( t ν ) + ( X R ( t ) ) T { B R N R J + B I N I J + B J N J J + B K N K J } X J ( t ν ) + ( X R ( t ) ) T { B R N R K + B I N I K + B J N J K + B K N K K } X K ( t ν ) ( X I ( t ) ) T B R g ˜ I ( X ( t ν ) ) ( X I ( t ) ) T B I g ˜ R ( X ( t ν ) ) + ( X I ( t ) ) T B K g ˜ J ( X ( t ν ) ) ( X I ( t ) ) T B J g ˜ K ( X ( t ν ) ) ( X I ( t ) ) T { B R N I R + B I N R R + B J N K R + B K N J R } X R ( t ν ) + ( X I ( t ) ) T { B R N I I + B I N R I + B J N K I + B K N J I } X I ( t ν ) + ( X I ( t ) ) T { B R N I J + B I N R J + B J N K J + B K N J J } X J ( t ν ) + ( X I ( t ) ) T { B R N I K + B I N R K + B J N K K + B K N J K } X K ( t ν ) ( X J ( t ) ) T B J g ˜ R ( X ( t ν ) ) ( X J ( t ) ) T B K g ˜ I ( X ( t ν ) ) + ( X J ( t ) ) T B R g ˜ J ( X ( t ν ) ) + ( X J ( t ) ) T B I g ˜ K ( X ( t ν ) ) ( X J ( t ) ) T { B J N R R + B K N I R + B R N J R + B I N K R } X R ( t ν ) + ( X J ( t ) ) T { B J N R I + B K N I I + B R N J I + B I N K I } X I ( t ν ) + ( X J ( t ) ) T { B J N R J + B K N I J + B R N J J + B I N K J } X J ( t ν ) + ( X J ( t ) ) T { B J N R K + B K N I K + B R N J K + B I N K K } X K ( t ν ) ( X K ( t ) ) T B K g ˜ R ( X ( t ν ) ) + ( X K ( t ) ) T B J g ˜ I ( X ( t ν ) ) ( X K ( t ) ) T B I g ˜ J ( X ( t ν ) ) + ( X K ( t ) ) T B R g ˜ K ( X ( t ν ) ) ( X K ( t ) ) T { B K N R R + B J N I R + B I N J R + B R N K R } X R ( t ν ) + ( X K ( t ) ) T { B K N R I + B J N I I + B I N J I + B R N K I } X I ( t ν ) + ( X K ( t ) ) T { B K N R J + B J N I J + B I N J J + B R N K J } X J ( t ν ) + ( X K ( t ) ) T { B K N R K + B J N I K + B I N J K + B R N K K } X K ( t ν )
Based on (10)–(12), we obtain
V ˙ ( t ) ( X R ( t ) ) T ( Θ + 2 M + S ) X R ( t ) + ( X I ( t ) ) T ( Θ + 2 M + S ) X I ( t ) + ( X J ( t ) ) T ( Θ + 2 M + S ) X J ( t ) + ( X K ( t ) ) T ( Θ + 2 M + S ) X K ( t ) + ( X R ( t ) ) T ( i = R , I J , K B i N i R ) X R ( t ν ) + ( X R ( t ) ) T ( i = R , I J , K B i N i I ) X I ( t ν ) + ( X R ( t ) ) T ( i = R , I J , K B i N i J ) X J ( t ν ) + ( X R ( t ) ) T ( i = R , I J , K B i N i K ) X K ( t ν ) + ( X I ( t ) ) T { B R N I R + B I N R R + B J N K R + B K N J R } X R ( t ν ) + ( X I ( t ) ) T { B R N I I + B I N R I + B J N K I + B K N J I } X I ( t ν ) + ( X I ( t ) ) T { B R N I J + B I N R J + B J N K J + B K N J J } X J ( t ν ) + ( X I ( t ) ) T { B R N I K + B I N R K + B J N K K + B K N J K } X K ( t ν ) + ( X J ( t ) ) T { B J N R R + B K N I R + B R N J R + B I N K R } X R ( t ν ) + ( X J ( t ) ) T { B J N R I + B K N I I + B R N J I + B I N K I } X I ( t ν ) + ( X J ( t ) ) T { B J N R J + B K N I J + B R N J J + B I N K J } X J ( t ν ) + ( X J ( t ) ) T { B J N R K + B K N I K + B R N J K + B I N K K } X K ( t ν ) + ( X K ( t ) ) T { B K N R R + B J N I R + B I N J R + B R N K R } X R ( t ν ) + ( X K ( t ) ) T { B K N R I + B J N I I + B I N J I + B R N K I } X I ( t ν ) + ( X K ( t ) ) T { B K N R J + B J N I J + B I N J J + B R N K J } X J ( t ν ) + ( X K ( t ) ) T { B K N R K + B J N I K + B I N J K + B R N K K } X K ( t ν ) ( X R ( t ν ) ) T S X R ( t ν ) ( X I ( t ν ) ) T S X I ( t ν ) ( X J ( t ν ) ) T S X J ( t ν ) ( X K ( t ν ) ) T S X K ( t ν ) p = 1 n ω p R ( X p R ( t ) ) 2 p = 1 n ω p I ( X p I ( t ) ) 2 p = 1 n ω p J ( X p J ( t ) ) 2 p = 1 n ω p K ( X p K ( t ) ) 2 = ( ξ ( t ) ) T Λ ξ ( t )
where
ξ ( t ) = ( X R ( t ) , X I ( t ) , X J ( t ) , X K ( t ) , X R ( t ν ) , X I ( t ν ) , X J ( t ν ) , X K ( t ν ) ) , M = i = R , I J , K j = R , I J K M i j .
According to (8), we know that Λ is a negative definite matrix; thus, there exists a constant ρ > 0 such that
V ˙ ( t ) ρ ( ξ ( t ) ) T ξ ( t ) < 0
where ρ = λ m i n ( Λ ) > 0 .
Therefore, the proof is completed and the global synchronization problem of QVCGNNs with known parameters is finally solved.
It is remarkable that certain parameter values of the system cannot be accurately known in practical applications, and such uncertain factors will disrupt synchronization. Therefore, it is of great significance to explore the adaptive synchronization of two QVCGNNs in the case of unknown parameters. Therefore, the drive system defined by us remains the same as (1), and the response system with unknown parameters is as follows:
s ˜ ˙ ( t ) = C [ k ( s ˜ ( t ) ) A ^ f ( s ˜ ( t ) ) B ^ g ( s ˜ ( t ν ) ) + J ( t ) ] + U ( t )
where A ^ = ( a ^ i j ) n × n , B ^ = ( b ^ i j ) n × n are uncertain or unknown matrices that we need to estimate.
Here, the synchronization error signal between the response system (14) and drive system (1) remains denoted by X ( t ) = s ˜ ( t ) s ( t ) . Then, the error dynamical system is as follows:
X ˙ R = K R + A R f ˜ R ( X ) + A I f ˜ I ( X ) + A J f ˜ J ( X ) + A K f ˜ K ( X ) + B R g ˜ R ( X ν ) + B I g ˜ I ( X ν ) + B J g ˜ J ( X ν ) + B K g ˜ K ( X ν ) + A ˇ R f R ( X ) + A ˇ I f I ( X ) + A ˇ J f J ( X ) + A ˇ K f K ( X ) + B ˇ R g R ( X ν ) + B ˇ I g I ( ( X ν ) + B ˇ J g J ( ( X ν ) + B ˇ K g K ( ( X ν ) + U R , X ˙ I = K I A I f ˜ R ( X ) + A R f ˜ I ( X ) + A K f ˜ J ( X ) A J f ˜ K ( X ) B I g ˜ R ( X ν ) + B R g ˜ I ( X ν ) + B K g ˜ J ( X ν ) B J g ˜ K ( X ν ) A ˇ I f R ( X ) + A ˇ R f I ( X ) + A ˇ K f J ( X ) A ˇ J f K ( X ) B ˇ I g R ( X ν ) + B ˇ R g I ( X ν ) + B ˇ K g J ( X ν ) B ˇ J g K ( X ν ) + U I , X ˙ J = K J A J f ˜ R ( X ) A K f ˜ I ( X ) + A R f ˜ J ( X ) + A I f ˜ K ( X ) B J g ˜ R ( X ν ) B K g ˜ I ( X ν ) + B R g ˜ J ( X ν ) + B I g ˜ K ( X ν ) A ˇ J f R ( X ) A ˇ K f I ( X ) + A ˇ R f J ( X ) + A ˇ I f K ( X ) B ˇ J g R ( X ν ) B ˇ K g I ( X ν ) + B ˇ R g J ( X ν ) + B ˇ I g K ( X ν ) + U J , X ˙ K = K K A K f ˜ R ( X ) + A J f ˜ I ( X ) A I f ˜ J ( X ) + A R f ˜ K ( X ) B K g ˜ R ( X ν ) + B J g ˜ I ( X ν ) B I g ˜ J ( X ν ) + B R g ˜ K ( X ν ) A ˇ K f R ( X ) + A ˇ J f I ( X ) A ˇ I f J ( X ) + A ˇ R f K ( X ) B ˇ K g R ( X ν ) + B ˇ J g I ( X ν ) B ˇ I g J ( X ν ) + B ˇ R g K ( X ν ) + U K .
where
A ˇ R = C R ( A ^ R A R ) C I ( A ^ I A I ) C J ( A ^ J A J ) C K ( A ^ K A K ) , A ˇ I = C R ( A ^ I A I ) C I ( A ^ R A R ) C J ( A ^ K A K ) + C K ( A ^ J A J ) , A ˇ J = C R ( A ^ J A J ) + C I ( A ^ K A K ) C J ( A ^ R A R ) C K ( A ^ I A I ) , A ˇ K = C R ( A ^ K A K ) C I ( A ^ J A J ) + C J ( A ^ I A I ) C K ( A ^ R A R ) , B ˇ R = C R ( B ^ R B R ) C I ( B ^ I B I ) C J ( B ^ J B J ) C K ( B ^ K B K ) , B ˇ I = C R ( B ^ I B I ) C I ( B ^ R B R ) C J ( B ^ K B K ) + C K ( B ^ J B J ) , B ˇ J = C R ( B ^ J B J ) + C I ( B ^ K B K ) C J ( B ^ R B R ) C K ( B ^ I B I ) , B ˇ K = C R ( B ^ K B K ) C I ( B ^ J B J ) + C J ( B ^ I B I ) C K ( B ^ R B R )
and f ( s ˜ ) = f ( s ˜ ( t ) ) , g ( s ˜ ν ) = g ( s ˜ ( t ν ) ) . □
Theorem 2.
If Assumption 1 holds, the positive matrix S and four positive diagonal matrices ω R , ω I , ω J , ω K exist, such that inequality (8) holds and the adaptive rules of parameter matrices A ^ = ( a ^ i j ) n × n , B ^ = ( b ^ i j ) n × n are designed as
a ^ ˙ p q R = η p q R X p R [ c p R f q R ( s ˜ ) c p I f q I ( s ˜ ) c p J f q J ( s ˜ ) c p K f q K ( s ˜ ) ] η p q R X p I [ c p I f q R ( s ˜ ) + c p R f q I ( s ˜ ) c p K f q J ( s ˜ ) + c p J f q K ( s ˜ ) ] η p q R X p J [ c p J f q R ( s ˜ ) + c p K f q I ( s ˜ ) + c p R f q J ( s ˜ ) c p I f q K ( s ˜ ) ] η p q R X p K [ c p K f q R ( s ˜ ) c p J f q I ( s ˜ ) + c p I f q J ( s ˜ ) + c p R f q K ( s ˜ ) ] a ^ ˙ p q I = η p q I X p R [ c p I f q R ( s ˜ ) + c p R f q I ( s ˜ ) + c p K f q J ( s ˜ ) c p J f q K ( s ˜ ) ] η p q I X p I [ c p R f q R ( s ˜ ) c p I f q I ( s ˜ ) + c p J f q J ( s ˜ ) + c p K f q K ( s ˜ ) ] η p q I X p J [ c p K f q R ( s ˜ ) c p J f q I ( s ˜ ) c p I f q J ( s ˜ ) c p R f q K ( s ˜ ) ] + η p q I X p K [ c p J f q R ( s ˜ ) + c p K f q I ( s ˜ ) c p R f q J ( s ˜ ) + c p I f q K ( s ˜ ) ] a ^ ˙ p q J = η p q J X p R [ c p J f q R ( s ˜ ) c p K f q I ( s ˜ ) + c p R f q J ( s ˜ ) + c p I f q K ( s ˜ ) ] + η p q J X p I [ c p K f q R ( s ˜ ) + c p J f q I ( s ˜ ) + c p I f q J ( s ˜ ) c p R f q K ( s ˜ ) ] η p q J X p J [ c p R f q R ( s ˜ ) + c p I f q I ( s ˜ ) c p J f q J ( s ˜ ) + c p K f q K ( s ˜ ) ] η p q J X p K [ c p I f q R ( s ˜ ) c p R f q I ( s ˜ ) c p K f q J ( s ˜ ) d J J f q K ( s ˜ ) ] a ^ ˙ p q K = η p q K X p R [ c p K f q R ( s ˜ ) + c p J f q I ( s ˜ ) c p I f q J ( s ˜ ) + c p R f q K ( s ˜ ) ] η p q K X p I [ c p J f q R ( s ˜ ) c p K f q I ( s ˜ ) c p R f q J ( s ˜ ) c p I f q K ( s ˜ ) ] + η p q K X p J [ c p I f q R ( s ˜ ) c p R f q I ( s ˜ ) + c p K f q J ( s ˜ ) + c p J f q K ( s ˜ ) ] η p q K X p K [ c p R f q R ( s ˜ ) + c p I f q I ( s ˜ ) + c p J f q J ( s ˜ ) c p K f q K ( s ˜ ) ] b ^ ˙ p q R = σ p q R X p R [ c p R g q R ( s ˜ ν ) c p I g q I ( s ˜ ν ) c p J g q J ( s ˜ ν ) c p K g q K ( s ˜ ν ) ] σ p q R X p I [ c p I g q R ( s ˜ ν ) + c p R g q I ( s ˜ ν ) c p K g q J ( s ˜ ν ) + c p J g q K ( s ˜ ν ) ] σ p q R X p J [ c p J g q R ( s ˜ ν ) + c p K g q I ( s ˜ ν ) + c p R g q J ( s ˜ ν ) c p I g q K ( s ˜ ν ) ] σ p q R X p K [ c p K g q R ( s ˜ ν ) c p J g q I ( s ˜ ν ) + c p I g q J ( s ˜ ν ) + c p R g q K ( s ˜ ν ) ] b ^ ˙ p q I = σ p q I X p R [ c p I g q R ( s ˜ ν ) + c p R g q I ( s ˜ ν ) + c p K g q J ( s ˜ ν ) c p J g q K ( s ˜ ν ) ] σ p q I X p I [ c p R g q R ( s ˜ ν ) c p I g q I ( s ˜ ν ) + c p J g q J ( s ˜ ν ) + c p K g q K ( s ˜ ν ) ] σ p q I X p J [ c p K g q R ( s ˜ ν ) c p J g q I ( s ˜ ν ) c p I g q J ( s ˜ ν ) c p R g q K ( s ˜ ν ) ] + σ p q I X p K [ c p J g q R ( s ˜ ν ) + c p K g q I ( s ˜ ν ) c p R g q J ( s ˜ ν ) + c p I g q K ( s ˜ ν ) ] b ^ ˙ p q J = σ p q J X p R [ c p J g q R ( s ˜ ν ) c p K g q I ( s ˜ ν ) + c p R g q J ( s ˜ ν ) + c p I g q K ( s ˜ ν ) ] + σ p q J X p I [ c p K g q R ( s ˜ ν ) + c p J g q I ( s ˜ ν ) + c p I g q J ( s ˜ ν ) c p R g q K ( s ˜ ν ) ] σ p q J X p J [ c p R g q R ( s ˜ ν ) + c p I g q I ( s ˜ ν ) c p J g q J ( s ˜ ν ) + c p K g q K ( s ˜ ν ) ] σ p q J X p K [ c p I g q R ( s ˜ ν ) c p R g q I ( s ˜ ν ) c p K g q J ( s ˜ ν ) d J J g q K ( s ˜ ν ) ] b ^ ˙ p q K = σ p q K X p R [ c p K g q R ( s ˜ ν ) + c p J g q I ( s ˜ ν ) c p I g q J ( s ˜ ν ) + c p R g q K ( s ˜ ν ) ] σ p q K X p I [ c p J g q R ( s ˜ ν ) c p K g q I ( s ˜ ν ) c p R g q J ( s ˜ ν ) c p I g q K ( s ˜ ν ) ] + σ p q K X p J [ c p I g q R ( s ˜ ν ) c p R g q I ( s ˜ ν ) + c p K g q J ( s ˜ ν ) + c p J g q K ( s ˜ ν ) ] σ p q K X p K [ c p R g q R ( s ˜ ν ) + c p I g q I ( s ˜ ν ) + c p J g q J ( s ˜ ν ) c p K g q K ( s ˜ ν ) ] ,
where p , q = 1 , 2 , , n , any σ p q r , η p q r R ( r = R , I , J , K ) with σ p q r > 0 , η p q r > 0 .
Then, using the control function of controller (6), as well as the corresponding adaptive rule (7), systems (1) and (14) will achieve global synchronization. Moreover, for p , q = 1 , 2 , , n
lim t a ^ p q R = a p q R , lim t a ^ p q I = a p q I , lim t a ^ p q J = a p q J , lim t a ^ p q K = a p q K , lim t b ^ p q R = b p q R , lim t b ^ p q I = b p q I , lim t b ^ p q J = b p q J , lim t b ^ p q K = b p q K .
Proof. 
First, the Lyapunov function is defined as
V ( t ) = 1 2 ( ( X R ( t ) ) T X R ( t ) + ( X I ( t ) ) T X I ( t ) + ( X J ( t ) ) T X J ( t ) + ( X K ( t ) ) T X K ( t ) )
+ t ν t ( ( X R ( v ) ) T S X R ( v ) + ( X I ( v ) ) T S X I ( v ) + ( X J ( v ) ) T S X J ( v )
+ ( X K ( v ) ) T S X K ( v ) ) d v + 1 2 ( p = 1 n 1 ω p R ( ζ p R ( t ) + ω p R ) 2 + p = 1 n 1 ω p I ( ζ p I ( t ) + ω p I ) 2
+ p = 1 n 1 ω p J ( ζ p J ( t ) + ω p J ) 2 + p = 1 n 1 ω p K ( ζ p K ( t ) + ω p K ) 2 ) + 1 2 p = 1 n [ q = 1 n 1 η p q R ( a ^ p q R a p q R ) 2
+ q = 1 n 1 η p q I ( a ^ p q I a p q I ) 2 + q = 1 n 1 η p q J ( a ^ p q J a p q J ) 2 + q = 1 n 1 η p q K ( a ^ p q K a p q K ) 2
+ q = 1 n 1 σ p q R ( b ^ p q R b p q R ) 2 + q = 1 n 1 σ p q I ( b ^ p q I b p q I ) 2 + q = 1 n 1 σ p q J ( b ^ p q J b p q J ) 2
+ q = 1 n 1 σ p q K ( b ^ p q K b p q K ) 2 ] .
Calculating the derivative of V ( t ) and combining it with the inequalities (11) and (12), as well as Lemma 1 and the adaptive rules of the parameter matrices (16), we obtain
V ˙ ( t ) ρ ( ξ ( t ) ) T ξ ( t ) < 0 ,
where parameters such as ξ ( t ) and ρ are defined in exactly the same manner as those defined in inequality (13).
Therefore, global synchronization between system (1) and system (14) is realized. □
Remark 3.
According to theorems 1 and 2, constructing an appropriate Lyapunov function, and utilizing parameter identification theory, two effective adaptive feedback schemes are proposed, to guarantee the realization of global synchronization for quaternion-valued Cohen–Grossberg neural networks, with and without known parameters.
Remark 4.
It is worth mentioning that RVNNs and CVNNs are special cases of QVNNs, when a I , a J , a K = 0 and a J , a K = 0 , respectively. Therefore, the adaptive synchronization criteria proposed in this paper could be applied to the problem of synchronization of other RVNNs and CVNNs.

4. Numerical Examples

In order to demonstrate the effectiveness and reliability of the synchronization schemes proposed in this paper, two interesting examples are given in this section.
Example 1.
Taking into account the following model as the drive system:
x ˙ ( t ) = C [ k ( x ( t ) ) A f ( x ( t ) ) B g ( x ( t ν ) ) + J ( t ) ] ,
the response system is
x ˜ ˙ ( t ) = C [ k ( x ˜ ( t ) ) A f ( x ˜ ( t ) ) B g ( x ˜ ( t ν ) ) + J ( t ) ] + U ( t )
where
C = 1 + 1 i + 1 j + 0.8 k 0 0 0.8 + 1 i + 1.5 j + 0.9 k , A = 1.6 2.7 i 1.5 j 1.7 k 1.5 + 1.5 i + 1.8 j + 1.8 k 1.5 + 1.5 i + 1 j + 1.2 k 0 1.3 i + 1.6 j 1.6 k , B = 1.3 + 1 i + 1.2 j + 0.9 k 1.2 1 i 1.2 j 1.8 k 1.2 1.8 i + 1 j 1.6 k 1.1 1 i 1.5 j 1.5 k , k 1 ( x 1 ) = 1.5 x 1 R s i n ( x 1 R ) + ( 1.2 x 1 I + c o s ( x 1 I ) ) i + ( 1.5 x 1 J 0.7 s i n ( x 1 J ) ) j + ( 1.6 x 1 K s i n ( x 1 K ) ) k ; k 2 ( x 2 ) = 1.6 x 2 R 1.2 c o s ( x 2 R ) + ( 1.4 x 2 I 0.9 s i n ( x 2 I ) ) i + ( 1.8 x 2 J 1.6 c o s ( x 2 J ) ) j + ( 1.5 x 2 K 1.7 c o s ( x 2 K ) ) k ; f i ( x i ) = 1 e x i I 1 + e x i I + 1 e x i R 1 + e x i R i + 1 e x i K 1 + e x i K j + 1 e x i J 1 + e x i J k ( i = 1 , 2 ) ; g i ( x i ) = 1 1 + e x i K + 1 1 + e x i R i + 1 1 + e x i I j + 1 e x i J 1 + e x i J k ( i = 1 , 2 ) ; J 1 ( t ) = t a n h ( 2 t ) 3.5 i c o s ( 2 t 1 ) + j t a n h ( 4 t ) 1.2 k c o s ( 1.5 t 0.75 ) ; J 2 ( t ) = 1.5 s i n ( t 1 ) + 0.9 i t a n h ( 2 t 0.5 ) 1.3 j s i n ( 2 t 0.8 ) + 1.6 k t a n h ( t + 1.5 )
and ν 1 = 0.5 , ν 2 = 1 . x 1 ( t ) = 1 + 0.9 i + 0.5 j + 0.8 k , x ˜ 1 ( t ) = 8.65 + 4.5 i 3.7 j + 2.1 k , for t [ 0.5 , 0 ] and x 2 ( t ) = 1.2 + 1.9 i + 2.3 j + 2.1 k , x ˜ 2 ( t ) = 3.2 2.5 i + 4.2 j + 5.9 k , for t [ 1 , 0 ] is given as initial values.
The error trajectories X i R , X i I , X i J , X i K ( i = 1 , 2 ) for the drive and response system without control are depicted in Figure 1, from which we can easily observe that the drive–response system has not achieved synchronization.
In light of Theorem 1, and by utilizing the Matlab LMI toolbox, a set of solutions is obtained, as follows: ω 1 R = 132.1068 , ω 2 R = 132.1068 , ω 1 I = 130.1655 , ω 2 I = 130.1655 , ω 1 J = 130.1682 , ω 2 J = 130.1682 , ω 1 K = 137.3688 , ω 2 K = 137.3688 . Thus, the conclusion that the drive and response system will achieve global synchronization under the adaptive controller (6) can be drawn.
Choose initial values of control gains ζ 1 R ( 0 ) = 0.5 , ζ 2 R ( 0 ) = 1.5 , ζ 1 I ( 0 ) = 0.5 , ζ 2 I ( 0 ) = 1.5 , ζ 1 J ( 0 ) = 0.3 , ζ 2 J ( 0 ) = 1.3 , ζ 1 K ( 0 ) = 0.3 , ζ 2 K ( 0 ) = 1.3 . Figure 2 shows the trajectories of the synchronization errors between x i r and x ˜ i r ( r = R , I , J , K ) , ( i = 1 , 2 ) . That is to say, system (1) and system (4) have evidently realized global synchronization.
Example 2.
Consider system (1) as the drive system, and give parameters as
C = 0.6 0.2 i 0.6 j + 0.8 k 0 0 0.8 0.5 i 0.5 j + 0.9 k , A = 0.2 0.5 i 0.5 j 0.5 k 0.5 + 0.3 i + 0.8 j + 0.6 k 0.5 + 0.5 i + 0.5 j + 0.2 k 0.5 0.4 i + 0.6 j 0.6 k , B = 0.4 + 0.4 i 0.6 j + 0.4 k 0.2 0.5 i 0.5 j 0.6 k 0.8 0.6 i + 0.6 j 0.2 k 0.6 0.4 i 0.5 j 0.8 k , k 1 ( x 1 ) = 1.1 x 1 R 0.9 c o s ( x 1 R ) + ( 1.8 x 1 I 2.7 s i n ( x 1 I ) ) i + ( 1.4 x 1 J c o s ( x 1 J ) ) j + ( 1.5 x 1 K + s i n ( x 1 K ) ) k ; k 2 ( x 2 ) = 1.2 x 2 R + 0.9 s i n ( x 2 R ) + ( 1.5 x 2 I 0.6 c o s ( x 2 I ) ) i + ( 1.2 x 2 J + 0.6 s i n ( x 2 J ) ) j + ( 1.6 x 2 K + 0.7 s i n ( x 2 K ) ) k ; f i ( x i ) = 1 1 + e x i K + 1 1 + e x i R i + 1 1 + e x i J j + t a n h ( x i I ) k ( i = 1 , 2 ) ; g 1 ( x 1 ) = 1 1 + e x 1 K + 1 1 + e x 1 R i + 1 1 + e x 1 I j + 1 e x 1 J 1 + e x 1 J k ; g 2 ( x 2 ) = 1 1 + e x 2 K + 1 1 + e x 2 R i + 1 1 + e x 2 I j + 1 1 + e x 2 J k ; J 1 ( t ) = 0.8 c o s ( 2 t + 1 ) 1.2 i s i n ( 2 t 5 ) + j t a n h ( 0.5 t 1.75 ) 1.2 k c o s ( t + 0.5 ) ; J 2 ( t ) = 1.5 t a n h ( t + 1.5 ) + 0.9 i t a n h ( 2 t 0.5 ) 1.3 j s i n ( 2 t 0.8 ) + 1.6 k t a n h ( t 1.5 )
and ν 1 = 0.5 , ν 2 = 0.8 .
Then, let us regard system (14) as the response system with unknown parameters. For reasons of simplicity, we will only identify four parameters: a 11 = 0.2 0.5 i 0.5 j 0.5 k , a 22 = 0.5 0.4 i + 0.6 j 0.6 k , b 11 = 0.4 + 0.4 i 0.6 j + 0.4 k , b 22 = 0.6 0.4 i 0.5 j 0.8 k . Hence, the connection weight matrices needed for identification are given in the following form as
A ^ = a ^ 11 0.5 + 0.3 i + 0.8 j + 0.6 k 0.5 + 0.5 i + 0.5 j + 0.2 k a ^ 22 , B ^ = b ^ 11 0.2 0.5 i 0.5 j 0.6 k 0.8 0.6 i + 0.6 j 0.2 k b ^ 22 .
Choose initial values as x 1 ( t ) = 1.26 2.4 i + 2 j + 3.5 k , x ˜ 1 ( t ) = 3.85 + 3.5 i 2.7 j 1.1 k , for t [ 0.5 , 0 ] and x 2 ( t ) = 2.8 + 2.9 i 2.4 j 2.5 k , x ˜ 2 ( t ) = 1.2 1.7 i + 2.2 j + 1 k , for t [ 0.8 , 0 ] . Then, the error trajectories X i R , X i I , X i J , X i K ( i = 1 , 2 ) for the drive and response system without control are depicted in Figure 3, which shows that the drive and response system cannot achieve synchronization.
In light of Theorem 2, and by utilizing the Matlab LMI toolbox, a set of solutions is obtained, as follows: ω 1 R = 171.3329 , ω 2 R = 171.3329 , ω 1 I = 169.6663 , ω 2 I = 169.6663 , ω 1 J = 169.6663 , ω 2 J = 169.6663 , ω 1 K = 176.3329 , ω 2 K = 176.3329 , which implies that system (1) and system (14) will be globally synchronized under the influence of the adaptive control scheme proposed in Theorem 2.
Choose initial values of control gains ζ p i ( 0 ) = 4   ( i = R , I , J , K ) , ( p = 1 , 2 ) . Figure 4 shows the trajectories of the synchronization errors between x i r and x ˜ i r ( r = R , I , J ) , ( K ; i = 1 , 2 ) . Obviously, the drive system and response system have achieved global synchronization under the adaptive control scheme proposed in Theorem 2.

5. Conclusions

In this paper, under the precondition of decomposing QVCGNNs into equivalent real-valued systems, the adaptive synchronization criteria of QVCGNNs with and without known parameters were explored. Using Lyapunov theory and the LMI technique, easy to implement controllers with simple adaptive rules were designed in the case of known parameters. Moreover, aiming at QVCGNNs with unknown parameters, an adaptive feedback control scheme combining adaptive control theory and parameter identification was proposed. Differently from the existing results, this paper discussed the adaptive synchronization of QVCGNNs with known or unknown parameters for the first time. Finally, the correctness of the schemes was demonstrated through two examples and corresponding simulations.

Author Contributions

Writing—original draft, Y.S. and W.L.; writing—review & editing, Y.C. and S.W.; project administration, J.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China under Grant 61703354; the Sichuan National Applied Mathematics construction project 2022ZX004; the CUIT KYTD202243; the Scientific Research Foundation of Chengdu University of Information Technology KYTZ202184; Scientific Research Fund of Hunan Provincial Science and Technology Department 2022JJ30416.

Data Availability Statement

The datasets generated during the current study are available from the corresponding author on reasonable request.

Acknowledgments

The authors extend their appreciation to the supported by the National Natural Science Foundation of China under Grant 61703354; the Sichuan National Applied Mathematics construction project 2022ZX004; the Scientific Research Foundation of Chengdu University of Information Technology KYTZ202184; the CUIT KYTD202243; Scientific Research Fund of Hunan Provincial Science and Technology Department 2022JJ30416; the Scientific Research Funds of Hunan Provincial Education Department 22A0483.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Cohen, M.; Grossberg, S. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. Syst. Cybern. 1983, 13, 815–826. [Google Scholar] [CrossRef]
  2. Zhang, Z.; Cao, J.; Zhou, D. Novel LMI-Based Condition on Global Asymptotic Stability for a Class of Cohen-Grossberg BAM Networks With Extended Activation Functions. IEEE Trans. Neural Netw. Learn. 2014, 25, 1161–1172. [Google Scholar]
  3. Yang, X.; Cao, J.; Yu, W. Exponential synchronization of memristive Cohen-Grossberg neural networks with mixed delays. Cogn. Neurodyn 2014, 8, 239–249. [Google Scholar] [CrossRef] [PubMed]
  4. Shi, Y.; Cao, J. Finite-time synchronization of memristive Cohen-Grossberg neural networks with time delays. Neurocomputing 2020, 377, 159–167. [Google Scholar] [CrossRef]
  5. Zhang, C.; Deng, F.; Peng, Y.; Zhang, B. Adaptive synchronization of Cohen-Grossberg neural network with mixed time-varying delays and stochastic perturbation. Appl. Math. Comput. 2015, 269, 792–801. [Google Scholar] [CrossRef]
  6. Zheng, M.; Li, L.; Peng, H. Finite-time stability and synchronization for memristor-based fractional-order Cohen-Grossberg neural network. Eur. Phys. J. B 2016, 89, 204. [Google Scholar] [CrossRef]
  7. Zhang, Z.; Yu, S. Global asymptotic stability for a class of complex-valued Cohen-Grossberg neural networks with time delays. Neurocomputing 2016, 171, 1158–1166. [Google Scholar] [CrossRef]
  8. Li, L. Discrete Analogue for a Class of Impulsive Cohen-Grossberg Neural Networks with Asynchronous Time-Varying Delays. Neural Process. Lett. 2019, 49, 331–345. [Google Scholar] [CrossRef]
  9. Cheng, Y.; Shi, Y. The Exponential Synchronization and Asymptotic Synchronization of Quaternion-Valued Memristor-Based Cohen-Grossberg Neural Networks with Time-Varying Delays. Neural Process. Lett. 2023, in press. [Google Scholar] [CrossRef]
  10. Wei, H.; Wu, B.; Tu, Z. Exponential synchronization and state estimation of inertial quaternion-valued Cohen-Grossberg neural networks: Lexicographical order method. Int. J. Robust Nonlinear Control. 2020, 30, 2171–2185. [Google Scholar] [CrossRef]
  11. Hamilton, W. Lectures on Quaternions; Hodges and Smith: Dublin, Ireland, 1853. [Google Scholar]
  12. You, X.; Song, Q.; Jing, L.; Liu, Y.; Alsaadi, F. Global μ-stability of quaternion-valued neural networks with mixed time-varying delays. Neurocomputing 2018, 290, 12–25. [Google Scholar] [CrossRef]
  13. Liu, Y.; Zhang, D.D.; Lu, J.; Cao, J. Global μ-stability criteria for quaternion-valued neural networks with unbounded time-varying delays. Inf. Sci. 2016, 360, 273–288. [Google Scholar] [CrossRef]
  14. Tu, Z.; Zhao, Y.; Ding, N.; Feng, Y.; Zhang, W. Stability analysis of quaternion-valued neural networks with both discrete and distributed delays. Appl. Math. Comput. 2019, 343, 342–353. [Google Scholar] [CrossRef]
  15. Tan, Y.; Wang, X.; Yang, J.; Hu, J. Robust Exponential Stability for Discrete-Time Quaternion-Valued Neural Networks with Time Delays and Parameter Uncertainties. Neural Process. Lett. 2020, 51, 2317–2335. [Google Scholar] [CrossRef]
  16. Xu, X.; Xu, Q.; Yang, J.; Xue, H.; Xu, Y. Further research on exponential stability for quaternion-valued neural networks with mixed delays. Neurocomputing 2020, 400, 186–205. [Google Scholar] [CrossRef]
  17. Song, Q.; Long, L.; Zhao, Z.; Liu, Y.; Alsaadi, F. Stability criteria of quaternion-valued neutral-type delayed neural networks. Neurocomputing 2020, 412, 287–294. [Google Scholar] [CrossRef]
  18. Shu, J.; Xiong, L.; Wu, T.; Liu, Z. Stability Analysis of Quaternion-Valued Neutral-Type Neural Networks with Time-Varying Delay. Mathematics 2019, 7, 101. [Google Scholar] [CrossRef]
  19. Xu, W.; Zhu, S.; Fang, X.; Wang, W. Adaptive anti-synchronization of memristor-based complex-valued neural networks with time delays. Phys. A Stat. Mech. Its Appl. 2019, 535, 122427. [Google Scholar] [CrossRef]
  20. Wu, Z.; Wang, Z.; Zhou, T.; Tan, S. Global Synchronization and Anti-Synchronization of Fractional-Order Complex-Valued Gene Regulatory Networks With Time-Varying Delays. IEEE Access 2020, 8, 150555–150572. [Google Scholar] [CrossRef]
  21. Li, C.; Chen, G.; Liao, X.; Fan, Z. Chaos quasisynchronization induced by impulses with parameter mismatches. Chaos: Interdiscip. J. Nonlinear Sci. 2006, 16, 1–101. [Google Scholar] [CrossRef]
  22. Wei, R.; Cao, J. Fixed-time synchronization of quaternion-valued memristive neural networks with time delays. Neural Netw. 2019, 113, 1–10. [Google Scholar] [CrossRef]
  23. Deng, H.; Bao, H. Fixed-time synchronization of quaternion-valued neural networks. Phys. A Stat. Mech. 2019, 527, 1–16. [Google Scholar] [CrossRef]
  24. Hu, J.; Zeng, C. Adaptive exponential synchronization of complex-valued Cohen-Grossberg neural networks with known and unknown parameters. Neural Netw. 2017, 86, 90–101. [Google Scholar] [CrossRef] [PubMed]
  25. Shi, Y.; Zhu, P. Finite-time synchronization of stochastic memristor-based delayed neural networks. Neural Comput. Appl. 2018, 29, 293–301. [Google Scholar] [CrossRef]
  26. Cheng, Y.; Shi, Y. Exponential synchronization of quaternion-valued memristor-based neural networks with time-varying delays. Int. J. Adapt. Control Signal Process. 2023, 37, 1762–1781. [Google Scholar] [CrossRef]
  27. Pecora, L.M.; Carroll, T.L. Synchronization in chaotic systems. Phys. Rev. Lett. 1990, 64, 821–824. [Google Scholar] [CrossRef] [PubMed]
  28. Huang, J. Chaos synchronization between two novel different hyperchaotic systems with unknown parameters. Nonlinear Anal. 2008, 69, 4174–4181. [Google Scholar] [CrossRef]
  29. Huang, T.; Li, C.; Liao, X. Synchronization of a class of coupled chaotic delayed systems with parameter mismatch. Chaos 2007, 17, 033121. [Google Scholar] [CrossRef] [PubMed]
  30. Wang, S.; Shi, K. Mixed-Delay-Dependent Augmented Functional for Synchronization of Uncertain Neutral-Type Neural Networks with Sampled-Data Control. Mathematics 2023, 11, 872. [Google Scholar] [CrossRef]
  31. Li, M.; Fan, Y. Aperiodic Sampled-Data Control for Anti-Synchronization of Chaotic Nonlinear Systems Subject to Input Saturation. Axioms 2023, 12, 403. [Google Scholar] [CrossRef]
  32. He, W.; Cao, J. Adaptive synchronization of a class of chaotic neural networks with known or unknown parameters. Phys. Lett. A 2008, 372, 408–416. [Google Scholar] [CrossRef]
  33. Hu, J.; Wang, J. Global stability of complex-valued recurrent neural networks with time-delays. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 853–865. [Google Scholar] [CrossRef] [PubMed]
Figure 1. The error trajectories X i R , X i I , X i J , X i K ( i = 1 , 2 ) for the drive–response system without control.
Figure 1. The error trajectories X i R , X i I , X i J , X i K ( i = 1 , 2 ) for the drive–response system without control.
Mathematics 11 03553 g001
Figure 2. The trajectories of synchronization errors between x i r and x ˜ i r ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Figure 2. The trajectories of synchronization errors between x i r and x ˜ i r ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Mathematics 11 03553 g002
Figure 3. The trajectories of synchronization errors between x i r and x ˜ i r without control ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Figure 3. The trajectories of synchronization errors between x i r and x ˜ i r without control ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Mathematics 11 03553 g003
Figure 4. The trajectories of synchronization errors between x i r and x ˜ i r ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Figure 4. The trajectories of synchronization errors between x i r and x ˜ i r ( r = R , I , J , K ) , ( i = 1 , 2 ) .
Mathematics 11 03553 g004
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

Guo, J.; Shi, Y.; Luo, W.; Cheng, Y.; Wang, S. Adaptive Global Synchronization for a Class of Quaternion-Valued Cohen-Grossberg Neural Networks with Known or Unknown Parameters. Mathematics 2023, 11, 3553. https://doi.org/10.3390/math11163553

AMA Style

Guo J, Shi Y, Luo W, Cheng Y, Wang S. Adaptive Global Synchronization for a Class of Quaternion-Valued Cohen-Grossberg Neural Networks with Known or Unknown Parameters. Mathematics. 2023; 11(16):3553. https://doi.org/10.3390/math11163553

Chicago/Turabian Style

Guo, Jun, Yanchao Shi, Weihua Luo, Yanzhao Cheng, and Shengye Wang. 2023. "Adaptive Global Synchronization for a Class of Quaternion-Valued Cohen-Grossberg Neural Networks with Known or Unknown Parameters" Mathematics 11, no. 16: 3553. https://doi.org/10.3390/math11163553

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop