Next Article in Journal
Asymptotic Growth of Sample Paths of Tempered Fractional Brownian Motions, with Statistical Applications to Vasicek-Type Models
Next Article in Special Issue
Fixed-Time Synchronization for Fractional-Order Cellular Inertial Fuzzy Neural Networks with Mixed Time-Varying Delays
Previous Article in Journal
Supplemental Stability Criteria with New Formulation for Linear Time-Invariant Fractional-Order Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adaptive Output Synchronization of Coupled Fractional-Order Memristive Reaction-Diffusion Neural Networks

School of Artificial Intelligence, Chongqing University of Technology, Chongqing 401135, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(2), 78; https://doi.org/10.3390/fractalfract8020078
Submission received: 29 November 2023 / Revised: 4 January 2024 / Accepted: 8 January 2024 / Published: 25 January 2024

Abstract

:
This article discusses the adaptive output synchronization problem of coupled fractional-order memristive reaction-diffusion neural networks (CFOMRDNNs) with multiple output couplings or multiple output derivative couplings. Firstly, by using Lyapunov functional and inequality techniques, an adaptive output synchronization criterion for CFOMRDNNs with multiple output couplings is proposed. Then, an adaptive controller is designed for ensuring the output synchronization of CFOMRDNNs with multiple output derivative couplings. Finally, two numerical examples are given to verify the effectiveness of the theoretical results.

1. Introduction

In recent years, coupled neural networks (CNNs) have received significant attention because their dynamical behaviors have been applied in many fields such as chaos generators design, image processing and secure communication. As an important dynamical behavior of CNNs, synchronization has been widely discussed during the past decade [1,2,3,4,5]. With the help of convex combination technique and time-varying Lyapunov functions, Long et al. [3] investigated the synchronization of coupled switched neural networks affected by stochastic disturbances and impulses. The state synchronization of CNNs was studied in above works [1,2,3,4,5], however, state synchronization is often difficult to achieve. Actually, sometimes only partial state variables are needed to be synchronized. Hence, some scholars have considered the output synchronization of CNNs [6,7,8,9,10]. Wang et al. [6] solved the output synchronization problem of directed and undirected CNNs by employing matrix theory and inequality technique.
In practical situations, it is more appropriate to use multiple weighted complex networks to describe various real networks (e.g., communication networks, public transport networks, etc.). Since CNNs are a special type of complex networks, some authors have considered the dynamical behaviors of multiple weighted CNNs [11,12]. In [11], some synchronization criteria were established for CNNs with multistate couplings by designing suitable event-triggered controller. In [1,2,3,4,5,6,7,8,9,10,11,12], the authors discussed networks with state coupling. As a matter of fact, output coupling is also an important coupling form in CNNs. Recently, some investigations about the output synchronization of CNNs with multiple output couplings have been reported [13,14,15]. A class of CNNs with multiple output couplings was introduced by Liu et al. [14], and the output synchronization problem for the proposed networks was investigated by exploiting the Barbalat’s lemma and adaptive controller. On the other hand, different time derivatives of node states may lead to different changes of other nodes in some real networks. Thus, considering the dynamical behaviors for CNNs with derivative coupling is meaningful [16,17,18]. Tang et al. [16] designed an impulsive pinning control strategy to ensure that the derivative CNNs are synchronized.
It is worth pointing out that [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18] only focused on integer-order coupled neural network models. In fact, compared with integer-order derivatives, fractional-order derivatives can better describe the memory and hereditary properties of diverse materials and processes. Furthermore, fractional calculus can also be applied to biological neurons. For example, fractional-order derivatives afford basic and universal computation for individual neuron that can facilitate stimulus anticipation and information processing in [19]. Hence, more and more authors have shown interest in the coupled fractional-order neural networks (CFONNs) and have obtained important results [20,21,22,23]. In [20], a kind of multi-weights CFONNs with and without uncertain parameters was introduced, and several output synchronization criteria for such networks were derived based on Mittag–Leffler functions and Laplace transforms. Additionally, considering the diffusion phenomenon is inevitable in CNNs when electrons are moving in a nonuniform electromagnetic field, some researchers investigated the dynamical behaviors of CFONNs with reaction-diffusion terms [24,25,26,27]. Wang et al. [26] presented a multiple weighted coupled fractional-order neural network model with reaction-diffusion terms and solved the synchronization problem for proposed model by using adaptive schemes and some inequality techniques. Regrettably, the output synchronization of CFONNs with reaction-diffusion terms has not been studied.
As is well known, in 2008, HP Labs first produced nanoscale memristor devices. In the implementation of neural network circuits, resistors can be replaced by memristors to simulate synaptic structures. Therefore, a memristive neural network model was established successfully [28,29]. Li et al. [29] presented a quaternion-valued fuzzy memristive neural network and derived several quasi-synchronization criteria for such a network. Moreover, due to the fractional-order systems having property of long-term memory, there has been growing attention about the dynamical behaviors of fractional-order memristive neural networks [30,31,32,33,34]. Ma et al. [30] introduced a delayed coupled fractional-order memristive neural network model with parameter mismatch and designed a discontinuous controller to ensure that the proposed model can achieve synchronization. On the basis of Lyapunov functionals and fractional-order derivative inequalities, Mao et al. [31] addressed the synchronization issue of fractional-order multidimensional memristive neural networks with time-varying delays. Unfortunately, the output synchronization of coupled fractional-order memristive reaction-diffusion neural networks (CFOMRDNNs) under adaptive controller has never been considered.
This article discusses the output synchronization of CFOMRDNNs with multiple output couplings or multiple output derivative couplings via adaptive control. The main contributions of this article are as follows.
(1) This article introduces a type of CFOMRDNNs with multi-output derivative couplings. Different from the existing coupled fractional-order reaction-diffusion neural network models [24,26], derivative coupling is considered in the network model of this article because the state change velocities of neighbor nodes have a great influence on each node.
(2) An output feedback controller and an adaptive scheme are designed to ensure the output synchronization of CFOMRDNNs with multi-output derivative couplings. Considering that in many cases only partial state variables are required to be synchronized, this article explores the output synchronization problem of CFOMRDNNs with multi-output derivative couplings, which is different from the synchronization of coupled fractional-order reaction-diffusion neural networks investigated in [26].
(3) Under the help of the Laplace transform and Lyapunov functional, an output synchronization criterion is presented for CFOMRDNNs with multi-output couplings. It is evident that tackling the output synchronization problem of CFOMRDNNs with multi-output couplings is very meaningful, as it has not been discussed before.

2. Preliminaries

Let λ M ( Q ) and λ m ( Q ) mean the maximum and the minimum eigenvalues of the real symmetric matrix Q, respectively. ⊗ represents the Kronecker product. * means the convolution operator. R and R + denote the set of all real numbers and the set of all positive real numbers, respectively. R n and R n × σ stand for the set of all n-dimensional real-valued vectors and the set of all n × σ real-valued matrices, respectively. Φ = { ϕ = ( ϕ 1 , ϕ 2 , , ϕ N ) T R N | ϕ l < α l , l = 1 , 2 , , N } , Φ is the boundary of Φ and Φ ¯ = Φ Φ . For any z ( ϕ , t ) = ( z 1 ( ϕ , t ) , z 2 ( ϕ , t ) , , z σ ( ϕ , t ) ) R σ with ( ϕ , t ) Φ × R , z ( · , t ) 2 = Φ i σ z i 2 ( ϕ , t ) d ϕ .
Definition 1
(See [26]). Letting γ ( t ) C 1 ( [ 0 , + ] , R ) , the Caputo fractional derivative for γ ( t ) is given by
  0 D t q γ ( t ) = 1 Γ ( 1 q ) 0 t γ ( ς ) ( t ς ) q d ς , t > 0 ,
where 0 < q < 1 .
Definition 2
(See [35]). The Mittag–Leffler function is defined by
E μ , ν ( ω ) = κ = 0 + ω κ Γ ( κ μ + ν ) ,
where μ, ν R + , ω C . When ν = 1 , E μ ( ω ) = E μ , 1 ( ω ) = κ = 0 + ω κ Γ ( κ μ + 1 ) .
Lemma 1
(See [36]). For any continuously differentiable function δ ( ϕ , t ) : R N × R + R σ , one has
  0 D t q ( δ T ( ϕ , t ) W δ ( ϕ , t ) ) 2 δ T ( ϕ , t ) W 0 D t q δ ( ϕ , t ) ,
where 0 W R σ × σ and 0 < q < 1 .
Lemma 2
(See [37]). Set Φ be a cube χ l < α l ( l = 1 , 2 , , N ) and set τ ( χ ) be a real-valued function belonging to C 1 ( Φ ) which vanishes on the boundary Φ of Φ , i . e , τ ( χ ) | Φ = 0 . We have
Φ τ 2 ( χ ) d χ α l 2 Φ τ χ l 2 d χ ,
in which χ = ( χ 1 , χ 2 , , χ N ) T .

3. Output Synchronization of CFOMRDNNs with Multiple Output Couplings

3.1. Network Model

The coupled fractional-order reaction-diffusion neural network model with multiple couplings considered in [26] is described by
  0 D t q u m ( ϕ , t ) = G Δ u m ( ϕ , t ) Y u m ( ϕ , t ) + Q f ( u m ( ϕ , t ) ) + C + a = 1 ξ n = 1 ϖ b a H m n a E ˘ a u n ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where q ( 0 , 1 ) ; u m ( ϕ , t ) = ( u m 1 ( ϕ , t ) , u m 2 ( ϕ , t ) , , u m r ( ϕ , t ) ) T R r represents the state vector of the mth node; G = diag ( g 1 , g 2 , , g r ) > 0 ; Δ = l = 1 N 2 ϕ l 2 is the Laplace diffusion operator on Φ ; Y = diag ( y 1 , y 2 , , y r ) > 0 ; f ( · ) denotes the activation function; C = ( c 1 , c 2 , , c r ) T R r ; R r × r Q denotes a constant matrix; b a R + ( a = 1 , 2 , , ξ ) represents the coupling strength of the ath coupling form; 0 < E ˘ a R r × r is the inner coupling matrices; H a = ( H m n a ) ϖ × ϖ R ϖ × ϖ ( a = 1 , 2 , , ξ ) is the outer coupling matrix in the ath coupling form, in which H m n a R satisfies the following condition: if there is an edge between node m and node n, then H m n a = H n m a > 0 ( m n ) ; otherwise, H m n a = H n m a = 0 ( m n ) ; and H m m a = n = 1 n m ϖ H m n a .
Based on model (1), in order to investigate the output synchronization, the CFOMRDNNs with multiple output couplings are presented in this section, which are given as
  0 D t q u m ( ϕ , t ) = G Δ u m ( ϕ , t ) Y u m ( ϕ , t ) + Q f ( u m ( ϕ , t ) ) + C + a = 1 ξ n = 1 ϖ b a H m n a E ˜ a ε n ( ϕ , t ) , ε m ( ϕ , t ) = X u m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where q , u m ( ϕ , t ) , G , Δ , Y , Q , f ( · ) , b a , C , H a = ( H m n a ) ϖ × ϖ R ϖ × ϖ have similar meanings as these in network (1); ε m ( ϕ , t ) = ( ε m 1 ( ϕ , t ) , ε m 2 ( ϕ , t ) , , ε m σ ( ϕ , t ) ) R σ ( 1 σ r ) denotes the output vector of the mth node;
R σ × r X = x 1 0 0 0 0 0 0 x 2 0 0 0 0 0 0 x 3 0 0 0 0 0 0 x σ 0 0 ,
in which x ϑ R + , ϑ = 1 , 2 , , σ ;
R r × σ E ˜ a = e 1 a 0 0 0 0 e 2 a 0 0 0 0 e 3 a 0 0 0 0 e σ a 0 0 0 0 0 0 0 0 ,
where e ϑ k R + , ϑ = 1 , 2 , , σ .
Consider the following CFOMRDNNs with multiple output couplings consisting of ϖ identical fractional-order memristive reaction-diffusion neural networks with multiple output ouplings:
  0 D t q u m ( ϕ , t ) = G Δ u m ( ϕ , t ) Y u m ( ϕ , t ) + Q ( u m ( ϕ , t ) ) f ( u m ( ϕ , t ) ) + C + a = 1 ξ n = 1 ϖ b a H m n a E ˜ a ε n ( ϕ , t ) + v m ( ϕ , t ) , ε m ( ϕ , t ) = X u m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where u m ( ϕ , t ) , ε m ( ϕ , t ) , G , Δ , Y , f ( · ) , b a , C , H a = ( H m n a ) ϖ × ϖ R ϖ × ϖ , E ˜ a , X have similar meanings as these in network (2); Q ( u m ( ϕ , t ) ) is the memristor connection weight and v m ( ϕ , t ) = ( v m 1 ( ϕ , t ) , v m 2 ( ϕ , t ) , , v m r ( ϕ , t ) ) T R r represents the control input of the mth node.
The memristor connection weight Q ( u m ( ϕ , t ) ) = ( q i j ( u m i ( ϕ , t ) ) ) r × r is defined as
q i j ( u m i ( ϕ , t ) ) = q ^ i j , | u m i ( ϕ , t ) | Θ i , q ˇ i j , | u m i ( ϕ , t ) | < Θ i ,
in which Θ i denotes the switching jump, q ^ i j , q ˇ i j are known constants, i , j = 1 , 2 , , r .
Define
R r × r Q ( u m ( ϕ , t ) ) = Q ( 1 ) ( u m ( ϕ , t ) ) Q ( 2 ) ( u m ( ϕ , t ) ) Q ( 3 ) ( u m ( ϕ , t ) ) Q ( 4 ) ( u m ( ϕ , t ) ) ,
in which Q ( 1 ) ( u m ( ϕ , t ) ) R σ × σ , Q ( 2 ) ( u m ( ϕ , t ) ) R σ × ( r σ ) , Q ( 4 ) ( u m ( ϕ , t ) ) R ( r σ ) × ( r σ ) , Q ( 3 ) ( u m ( ϕ , t ) ) R ( r σ ) × σ . The matrix Q ( 2 ) ( u m ( ϕ , t ) ) = 0 is considered in the following part of this article, then we can get
R r × r Q ( u m ( ϕ , t ) ) = Q ( 1 ) ( u m ( ϕ , t ) ) 0 Q ( 3 ) ( u m ( ϕ , t ) ) Q ( 4 ) ( u m ( ϕ , t ) ) .
In many cases, only a fraction of state variables of the nodes are needed to reach synchronization. In the circumstances, these state variables may not be affected by the other state variables in the state of each node. Hence, the connection weight Q ( u m ( ϕ , t ) ) is selected in the form of (5) throughout this article.
By taking u ^ m ( ϕ , t ) = ( u m 1 ( ϕ , t ) , u m 2 ( ϕ , t ) , , u m σ ( ϕ , t ) ) T R σ , v ^ m ( ϕ , t ) = ( v m 1 ( ϕ , t ) , v m 2 ( ϕ , t ) , , v m σ ( ϕ , t ) ) T R σ , E ^ a = diag ( e 1 a , e 2 a , , e σ a ) R σ × σ , G ^ = diag ( g 1 , g 2 , , g σ ) , f ^ ( u ^ m ( ϕ , t ) ) = ( f 1 ( u m 1 ( ϕ , t ) ) , f 2 ( u m 2 ( ϕ , t ) ) , , f σ ( u m σ ( ϕ , t ) ) ) T , Y ^ = diag ( y 1 , y 2 , y σ ) , C ^ = ( C 1 , C 2 , , C σ ) T and X ^ = diag ( x 1 , x 2 , x σ ) , one gets from (3) and (5) that
  0 D t q u ^ m ( ϕ , t ) = G ^ Δ u ^ m ( ϕ , t ) Y ^ u ^ m ( ϕ , t ) + Q ( 1 ) ( u m ( ϕ , t ) ) f ^ ( u ^ m ( ϕ , t ) ) + C ^ + a = 1 ξ n = 1 ϖ b a H m n a E ^ a ε n ( ϕ , t ) + v ^ m ( ϕ , t ) , ε m ( ϕ , t ) = X ^ u ^ m ( ϕ , t ) , m = 1 , 2 , , ϖ .
Base on the switch rules in (4), the state of | u m i ( ϕ , t ) | can be | u m i ( ϕ , t ) | Θ i or | u m i ( ϕ , t ) | < Θ i if the index i of Θ i is fixed. Since the connection weight coefficient q i j ( u m i ( ϕ , t ) ) is determined according to the threshold value of | u m i ( ϕ , t ) | , there are two possible values for q i j ( u m i ( ϕ , t ) ) . Hence, the number of possible forms of Q ( 1 ) ( u m ( ϕ , t ) ) is 2 σ 2 . The characteristic function is defined as follows:
Γ ι ( ϕ , t ) = 1 , Q ( 1 ) ( u m ( ϕ , t ) ) = Q ι , 0 , o t h e r w i s e ,
where ι { 1 , 2 , , 2 σ 2 } . We can reach the conclusion that ι = 1 2 σ 2 Γ ι ( ϕ , t ) = 1 . Based on (6) and (7), we have
  0 D t q u ^ m ( ϕ , t ) = G ^ Δ u ^ m ( ϕ , t ) Y ^ u ^ m ( ϕ , t ) + ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ^ ( u ^ m ( ϕ , t ) ) + C ^ + a = 1 ξ n = 1 ϖ b a H m n a E ^ a ε n ( ϕ , t ) + v ^ m ( ϕ , t ) , ε m ( ϕ , t ) = X ^ u ^ m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι = Q ( 1 ) ( u m ( ϕ , t ) ) .
For simplicity, define q ´ i j = max ( q ^ i j , q ˇ i j ) , i , j = 1 , 2 , , σ . Q ´ = diag ( j = 1 σ q ´ 1 j 2 , j = 1 σ q ´ 2 j 2 , , j = 1 σ q ´ σ j 2 ) .
In this article, the network (3) is connected and function f ϑ ( · ) ( ϑ = 1 , 2 , , σ ) meets the Lipschitz condition, namely, there exists R + θ ϑ which satisfies
| f ϑ ( ψ 1 ) f ϑ ( ψ 2 ) | θ ϑ | ψ 1 ψ 2 |
for any ψ 1 , ψ 2 R . Furthermore, define Θ = diag ( θ 1 2 , θ 2 2 , , θ σ 2 ) .
The Dirichlet boundary condition and initial value of network (3) are given as
u m ( ϕ , 0 ) = ϱ m ( ϕ ) R σ , ϕ Φ , u m ( ϕ , t ) = 0 , ( ϕ , t ) Φ × [ 0 , + ) ,
where ϱ m ( ϕ ) ( m = 1 , 2 , , ϖ ) is continuous on Φ ¯ .
Denote f ( u ( ϕ , t ) ) = f ^ X ^ 1 u ( ϕ , t ) , in which u ( ϕ , t ) R σ . Then, it can be derived from (8) that
  0 D t q ε m ( ϕ , t ) = G ^ Δ ε m ( ϕ , t ) Y ^ ε m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a ε n ( ϕ , t ) + X ^ v ^ m ( ϕ , t ) ,
where m = 1 , 2 , , ϖ .
By taking ε ¯ ( ϕ , t ) = 1 ϖ m = 1 ϖ ε m ( ϕ , t ) , we can acquire
  0 D t q ε ¯ m ( ϕ , t ) = G ^ Δ ε ¯ m ( ϕ , t ) Y ^ ε ¯ m ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + 1 ϖ a = 1 ξ n = 1 ϖ b a m = 1 ϖ H m n a X ^ E ^ a ε n ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ v ^ m ( ϕ , t ) = G ^ Δ ε ¯ m ( ϕ , t ) Y ^ ε ¯ m ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + 1 ϖ m = 1 ϖ X ^ v ^ m ( ϕ , t ) .
Define z m ( ϕ , t ) = ( z m 1 ( ϕ , t ) , z m 2 ( ϕ , t ) , , z m σ ( ϕ , t ) ) T = ε m ( ϕ , t ) ε ¯ ( ϕ , t ) R σ . By (9) and (10), we derive
  0 D t q z m ( ϕ , t ) = G ^ Δ z m ( ϕ , t ) Y ^ z m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ v ^ m ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε β ( ϕ , t ) ) + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a z n ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ v ^ β ( ϕ , t ) ,
where m = 1 , 2 , , ϖ .
In the following, the output synchronization is defined for the network (3).
Definition 3.
The network (3) can achieve output synchronization if
lim t + ε m ( · , t ) 1 ϖ n = 1 ϖ ε n ( · , t ) 2 = 0 , p = 1 , 2 , , ϖ .

3.2. Adaptive Control for Output Synchronization

Design following output feedback controller and adaptive scheme for the network (3)
v ^ m ( ϕ , t ) = a = 1 ξ b a s m a ( t ) E ^ a z m ( ϕ , t ) ,   0 D t q s m a ( t ) = b a Φ z m T ( ϕ , t ) X ^ P E ^ a z m ( ϕ , t ) d ϕ 1 2 λ M ( P ) ( s m a ( t ) s ^ m a ) ,
where m = 1 , 2 , , ϖ , R σ × σ P > 0 , s ^ m a R + , and s m a ( t ) R + .
Define
z ( ϕ , t ) = ( z 1 T ( ϕ , t ) , z 2 T ( ϕ , t ) , , z ϖ T ( ϕ , t ) ) T , u ( ϕ , t ) = ( u 1 T ( ϕ , t ) , u 2 T ( ϕ , t ) , , u ϖ T ( ϕ , t ) ) T .
Theorem 1.
Under the adaptive controller (12), the network (3) can realize output synchronization.
Proof. 
Construct the Lyapunov functional for the network (3):
V 1 ( t ) = O 1 ( t ) + K 1 ( t ) , O 1 ( t ) = Φ m = 1 ϖ z m T ( ϕ , t ) P z m ( ϕ , t ) d ϕ , K 1 ( t ) = m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 2 ,
where 0 < P = diag ( p 1 , p 2 , , p σ ) R σ × σ .
By (11), (13) and Lemma 1, one has
  0 D t q O 1 ( t ) 2 Φ m = 1 ϖ z m T ( ϕ , t ) P   0 D t q z m ( ϕ , t ) d ϕ = 2 Φ m = 1 ϖ z m T ( ϕ , t ) P [ G ^ Δ z m ( ϕ , t ) Y ^ z m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι ( f ( ε m ( ϕ , t ) ) f ( ε ¯ ( ϕ , t ) ) + f ( ε ¯ ( ϕ , t ) ) ) 1 ϖ β = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε β ( ϕ , t ) ) + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a z n ( ϕ , t ) a = 1 ξ b a s m a ( t ) X ^ E ^ a z m ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ v ^ β ( ϕ , t ) ] d ϕ .
Because f ϑ ( · ) ( ϑ = 1 , 2 , , σ ) satisfies the Lipschitz condition, one obtains
2 m = 1 ϖ z m T ( ϕ , t ) P X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) f ( ε ¯ ( ϕ , t ) ) m = 1 ϖ ι = 1 2 σ 2 Γ ι ( ϕ , t ) z m T ( ϕ , t ) P X ^ Q ι ι = 1 2 σ 2 Γ ι ( ϕ , t ) z m T ( ϕ , t ) P X ^ Q ι T + m = 1 ϖ f ( ε m ( ϕ , t ) ) f ( ε ¯ ( ϕ , t ) ) T f ( ε m ( ϕ , t ) ) f ( ε ¯ ( ϕ , t ) ) m = 1 ϖ i = 1 σ j = 1 σ p i 2 x i 2 q ´ i j 2 z m i 2 ( ϕ , t ) + m = 1 ϖ ϑ = 1 σ θ ϑ 2 z m ϑ 2 ( ϕ , t ) = m = 1 ϖ z m T ( ϕ , t ) P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) .
Since
m = 1 ϖ z m ( ϕ , t ) = m = 1 ϖ ( ε m ( ϕ , t ) ε ¯ ( ϕ , t ) ) = m = 1 ϖ ε m ( ϕ , t ) 1 ϖ n = 1 ϖ ε n ( ϕ , t ) = m = 1 ϖ ε m ( ϕ , t ) n = 1 ϖ ε n ( ϕ , t ) = 0 ,
then
m = 1 ϖ z m T ( ϕ , t ) X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε ¯ ( ϕ , t ) ) 1 ϖ β = 1 ϖ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε β ( ϕ , t ) ) = 0 ,
m = 1 ϖ z m T ( ϕ , t ) X ^ 1 ϖ β = 1 ϖ v ^ β ( ϕ , t ) = 0 .
Additionally,
2 Φ z m T ( ϕ , t ) P G ^ Δ z m ( ϕ , t ) d ϕ = 2 ζ = 1 σ p ζ g ζ Φ z m ζ ( ϕ , t ) Δ z m ζ ( ϕ , t ) d ϕ = 2 l = 1 N ζ = 1 σ p ζ g ζ Φ ( z m ζ ( ϕ , t ) ϕ l ) 2 d ϕ 2 l = 1 N 1 α l 2 ζ = 1 σ p ζ g ζ Φ z m ζ 2 ( ϕ , t ) d ϕ = 2 l = 1 N 1 α l 2 Φ z m T ( ϕ , t ) P G ^ z m ( ϕ , t ) d ϕ .
From (14)–(18), we can derive
  0 D t q O 1 ( t ) m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) d ϕ + 2 a = 1 ξ m = 1 ϖ n = 1 ϖ b a H m n a Φ z m T ( ϕ , t ) P X ^ E ^ a z n ( ϕ , t ) d ϕ 2 a = 1 ξ m = 1 ϖ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ .
By (12), (13) and Lemma 1, one has
  0 D t q K 1 ( t ) 2 m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 0 D t q s m ( t ) 2 m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) ( b a Φ z m T ( ϕ , t ) X ^ P E ^ a z m ( ϕ , t ) d ϕ 1 2 λ M ( P ) ( s m a ( t ) s ^ m a ) ) .
In the light of (19) and (20), we have
  0 D t q V 1 ( t ) m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) d ϕ + 2 a = 1 ξ m = 1 ϖ n = 1 ϖ b a H m n a Φ z m T ( ϕ , t ) P X ^ E ^ a z n ( ϕ , t ) d ϕ 2 a = 1 ξ m = 1 ϖ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ + 2 m = 1 ϖ a = 1 ξ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ 2 m = 1 ϖ a = 1 ξ b a s ^ m a Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ 1 λ M ( P ) m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 2 = m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) d ϕ + 2 a = 1 ξ m = 1 ϖ n = 1 ϖ b a H m n a Φ z m T ( ϕ , t ) P X ^ E ^ a z n ( ϕ , t ) d ϕ 2 m = 1 ϖ a = 1 ξ b a s ^ m a Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ 1 λ M ( P ) K 1 ( t ) = Φ z T ( ϕ , t ) [ I ϖ 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ + 2 a = 1 ξ b a H a ( P X ^ E ^ a ) 2 a = 1 ξ b a S ^ a ( P X ^ E ^ a ) ] z ( ϕ , t ) 1 λ M ( P ) K 1 ( t ) Φ z T ( ϕ , t ) Λ 2 a = 1 ξ b a λ m ( S ^ a ) ( P X ^ E ^ a ) z ( ϕ , t ) 1 λ M ( P ) K 1 ( t ) ,
where Λ = I ϖ 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ + 2 a = 1 ξ b a H a ( P X ^ E ^ a ) ,   S ^ a = diag ( s ^ 1 a , s ^ 2 a , , s ^ ϖ a ) ( a = 1 , 2 , , ξ ) and s ^ m a R + .
Select sufficiently large s ^ m a such that
λ M ( Λ ) 2 a = 1 ξ b a λ m ( S ^ a ) λ m ( P X ^ E ^ a ) 1 .
Furthermore, it follows from (21) and (22) that
  0 D t q V 1 ( t ) + z ( · , t ) 2 2 K 1 ( t ) λ M ( P ) .
By (13), one has
λ m ( P ) z ( · , t ) 2 2 V 1 ( t ) λ M ( P ) z ( · , t ) 2 2 + K 1 ( t ) .
Combining (23) and (24), one derives
  0 D t q V 1 ( t ) λ M ( P ) V 1 ( t ) .
Based on (24), there exists a 0 ψ ( t ) R such that
  0 D t q V 1 ( t ) + ψ ( t ) = V 1 ( t ) λ M ( P ) .
Let Ψ ( s ) = L [ ψ ( t ) ] and V 1 ( s ) = L [ V 1 ( t ) ] . According to (26), one acquires
s q V 1 ( s ) s q 1 V 1 ( 0 ) + Ψ ( s ) = V 1 ( s ) λ M ( P ) .
From (27), we have
V 1 ( s ) = s q 1 V 1 ( 0 ) s q + 1 λ M ( P ) Ψ ( s ) s q + 1 λ M ( P ) .
The inverse Laplace transform is used for (28), one has
V 1 ( t ) = V 1 ( 0 ) E q 1 λ M ( P ) t q ψ ( t ) t q 1 E q , q 1 λ M ( P ) t q .
In consideration of the fact that ψ ( t ) and E q , q 1 λ M ( P ) t q are nonnegative, it is derived from (24) and (29) that
0 λ m ( P ) z ( · , t ) 2 2 V 1 ( t ) V 1 ( 0 ) E q 1 λ M ( P ) t q .
Based on (30), we could gain
lim t + z ( · , t ) 2 = 0 .
Thus, the network (3) under the adaptive controller (12) attains output synchronized. □

4. Output Synchronization of CFOMRDNNs with Multiple Output Derivative Couplings

4.1. Network Model

The CFORDMNNs with multiple output derivative couplings discussed are described as
  0 D t q u m ( ϕ , t ) = G Δ u m ( ϕ , t ) Y u m ( ϕ , t ) + Q ( u m ( ϕ , t ) ) f ( u m ( ϕ , t ) ) + C + a = 1 ξ n = 1 ϖ b a H m n a E ˜ a   0 D t q ε n ( ϕ , t ) + v m ( ϕ , t ) , ε m ( ϕ , t ) = X u m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where q , u m ( ϕ , t ) , Δ , ε m ( ϕ , t ) , G , Y , f ( · ) , b a , C , v m ( ϕ , t ) , H a = ( H m n a ) ϖ × ϖ R ϖ × ϖ , E ˜ a , X have the same meanings as these in network (3) and Q ( u m ( ϕ , t ) ) = ( q i j ( u m i ( ϕ , t ) ) ) r × r have the same meanings as it in network (4).
The Dirichlet boundary condition and initial value of network (32) are given as
u m ( ϕ , 0 ) = ϱ m ( ϕ ) R σ , ϕ Φ , u m ( ϕ , t ) = 0 , ( ϕ , t ) Φ × [ 0 , + ) ,
where ϱ m ( ϕ ) ( m = 1 , 2 , , ϖ ) is continuous on Φ ¯ .
According to (5) and (32), we have
  0 D t q u ^ m ( ϕ , t ) = G ^ Δ u ^ m ( ϕ , t ) Y ^ u ^ m ( ϕ , t ) + Q ( 1 ) ( u m ( ϕ , t ) ) f ^ ( u ^ m ( ϕ , t ) ) + C ^ + a = 1 ξ n = 1 ϖ b a H m n a E ^ a   0 D t q ε n ( ϕ , t ) + v ^ m ( ϕ , t ) , ε m ( ϕ , t ) = X ^ u ^ m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
where Q ( 1 ) ( u m ( ϕ , t ) ) has the same definition as it in (5); u ^ m ( ϕ , t ) , v ^ m ( ϕ , t ) , f ^ ( u ^ m ( ϕ , t ) ) , E ^ a , G ^ , Y ^ , C ^ and X ^ have the same definitions as these in (6).
By (7) and (33), one gets
  0 D t q u ^ m ( ϕ , t ) = G ^ Δ u ^ m ( ϕ , t ) Y ^ u ^ m ( ϕ , t ) + ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ^ ( u ^ m ( ϕ , t ) ) + C ^ + a = 1 ξ n = 1 ϖ b a H m n a E ^ a   0 D t q ε n ( ϕ , t ) + v ^ m ( ϕ , t ) , ε m ( ϕ , t ) = X ^ u ^ m ( ϕ , t ) , m = 1 , 2 , , ϖ ,
in which Γ ι ( ϕ , t ) and Q ι have the same definitions as these in (7) and ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι = Q ( 1 ) ( u m ( ϕ , t ) ) .
On the basis of (34), we can obtain
  0 D t q ε m ( ϕ , t ) = G ^ Δ ε m ( ϕ , t ) Y ^ ε m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a   0 D t q ε n ( ϕ , t ) + X ^ v ^ m ( ϕ , t ) ,
in which m = 1 , 2 , , ϖ , f ( · ) has the same definition as it in (9).
Letting ε ¯ ( ϕ , t ) = 1 ϖ m = 1 ϖ ε m ( ϕ , t ) , one has
  0 D t q ε ¯ m ( ϕ , t ) = G ^ Δ ε ¯ m ( ϕ , t ) Y ^ ε ¯ m ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + 1 ϖ a = 1 ξ n = 1 ϖ b a m = 1 ϖ H m n a X ^ E ^ a   0 D t q ε n ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ v ^ m ( ϕ , t ) = G ^ Δ ε ¯ m ( ϕ , t ) Y ^ ε ¯ m ( ϕ , t ) + 1 ϖ m = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ C ^ + 1 ϖ m = 1 ϖ X ^ v ^ m ( ϕ , t ) .
Denoting z m ( ϕ , t ) = ( z m 1 ( ϕ , t ) , z m 2 ( ϕ , t ) , , z m σ ( ϕ , t ) ) T = ε m ( ϕ , t ) ε ¯ ( ϕ , t ) R σ , we derive
  0 D t q z m ( ϕ , t ) = G ^ Δ z m ( ϕ , t ) Y ^ z m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε m ( ϕ , t ) ) + X ^ v ^ m ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε β ( ϕ , t ) ) + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a   0 D t q z n ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ v ^ β ( ϕ , t ) ,
where m = 1 , 2 , , ϖ .

4.2. Adaptive Control for Output Synchronization

An adaptive output feedback controller for the network (32) is devised as follows:
v ^ m ( ϕ , t ) = a = 1 ξ b a s m a ( t ) E ^ a z m ( ϕ , t ) ,   0 D t q s m a ( t ) = b a Φ z m T ( ϕ , t ) X ^ P E ^ a z m ( ϕ , t ) d ϕ 1 2 λ M ( P ) ( s m a ( t ) s ^ m a ) ,
where m = 1 , 2 , , ϖ , R σ × σ P > 0 , s ^ m a R + and s m a ( t ) R + .
Theorem 2.
The network (32) is output synchronized under the adaptive controller (38).
Proof. 
Take the following Lyapunov functional for the network (32):
V 2 ( t ) = O 2 ( t ) + K 2 ( t ) O 2 ( t ) = Φ m = 1 ϖ z m T ( ϕ , t ) P z m ( ϕ , t ) d ϕ a = 1 ξ b a Φ z T ( ϕ , t ) H a ( P X ^ E ^ a ) z ( ϕ , t ) d ϕ , K 2 ( t ) = m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 2 ,
in which 0 < P = diag ( P 1 , P 2 , , P σ ) R σ × σ .
From (37), (39) and Lemma 1, one obtains
  0 D t q O 2 ( t ) 2 Φ m = 1 ϖ z m T ( ϕ , t ) P   0 D t q z m ( ϕ , t ) d ϕ 2 a = 1 ξ b a z T ( ϕ , t ) H a P X ^ E ^ a 0 D t q z ( ϕ , t ) d ϕ = 2 Φ m = 1 ϖ z m T ( ϕ , t ) P [ G ^ Δ z m ( ϕ , t ) Y ^ z m ( ϕ , t ) + X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι ( f ( ε m ( ϕ , t ) )   f ( ε ¯ ( ϕ , t ) ) + f ε ¯ ( ϕ , t ) ) 1 ϖ β = 1 ϖ X ^ ι = 1 2 σ 2 Γ ι ( ϕ , t ) Q ι f ( ε β ( ϕ , t ) ) + a = 1 ξ n = 1 ϖ b a H m n a X ^ E ^ a   0 D t q z n ( ϕ , t ) a = 1 ξ b a s m a ( t ) X ^ E ^ a z n ( ϕ , t ) 1 ϖ β = 1 ϖ X ^ v ^ β ( ϕ , t ) ] d ϕ 2 a = 1 ξ b a z T ( ϕ , t ) H a P X ^ E ^ a 0 D t q z ( ϕ , t ) d ϕ .
Using (15) to (18) and according to (40), we can derive
  0 D t q O 2 ( t ) m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) d ϕ 2 a = 1 ξ m = 1 ϖ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) ,
where q ´ i j = max ( q ^ i j , q ˇ i j ) , i , j = 1 , 2 , , σ , Q ´ = diag j = 1 σ q ´ 1 j 2 , j = 1 σ q ´ 2 j 2 , , j = 1 σ q ´ σ j 2 .
By (38), (39) and Lemma 1, one gets
  0 D t q K 2 ( t ) 2 m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 0 D t q s m ( t ) 2 m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) ( b a Φ z m T ( ϕ , t ) X ^ P E ^ a z m ( ϕ , t ) d ϕ 1 2 λ M ( P ) s m a ( t ) s ^ m a ) .
In view of (41) and (42), we have
  0 D t q V 2 ( t ) m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ z m ( ϕ , t ) d ϕ 2 a = 1 ξ m = 1 ϖ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ + 2 m = 1 ϖ a = 1 ξ b a s m a ( t ) Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ 2 m = 1 ϖ a = 1 ξ b a s ^ m a Φ z m T ( ϕ , t ) P X ^ E ^ a z m ( ϕ , t ) d ϕ 1 λ M ( P ) m = 1 ϖ a = 1 ξ ( s m a ( t ) s ^ m a ) 2 = m = 1 ϖ Φ z m T ( ϕ , t ) 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ P X ^ + Θ z m ( ϕ , t ) d ϕ 2 m = 1 ϖ a = 1 ξ b a s ^ m a Φ z m T ( ϕ , t ) X ^ P E ^ a z m ( ϕ , t ) d ϕ 1 λ M ( P ) K 2 ( t ) = Φ z T ( ϕ , t ) [ I ϖ 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ 2 a = 1 ξ b a S ^ a ( P X ^ E ^ a ) ] z ( ϕ , t ) 1 λ M ( P ) K 2 ( t ) Φ z T ( ϕ , t ) Ξ 2 a = 1 ξ b a λ m ( S ^ a ) ( P X ^ E ^ a ) z ( ϕ , t ) 1 λ M ( P ) K 2 ( t ) ,
where Ξ = I ϖ 2 l = 1 N P G ^ α l 2 2 P Y ^ + P X ^ Q ´ X ^ P + Θ , S ^ a = diag ( s ^ 1 a , s ^ 2 a , , s ^ ϖ a ) and s ^ m a R + .
Select sufficiently large s ^ m a such that
λ M ( Ξ ) 2 a = 1 ξ b a λ m ( S ^ a ) λ m ( P X ^ E ^ a ) 1 .
Moreover, we can obtain from (43) and (44) that
  0 D t q V 2 ( t ) + z ( · , t ) 2 2 K 2 ( t ) λ M ( P ) .
Similar to the proof from (24) to (30), we can obtain
lim t + z ( · , t ) 2 = 0 .
Therefore, the network (32) can realize output synchronization under the adaptive controller (38). □

5. Numerical Examples

5.1. Example 1

Consider the following CFOMRDNNs with multiple output couplings:
  0 D t 0.81 u m ( ϕ , t ) = G 2 u m ( ϕ , t ) ϕ 2 Y u m ( ϕ , t ) + Q ( u m ( ϕ , t ) ) f ( u m ( ϕ , t ) ) + C + 0.2 n = 1 5 H m n 1 E ˜ 1 ε n ( ϕ , t ) + 0.5 n = 1 5 H m n 2 E ˜ 2 ε n ( ϕ , t ) + 0.3 n = 1 5 H m n 3 E ˜ 3 ε n ( ϕ , t ) + v m ( ϕ , t ) , ε m ( ϕ , t ) = X u m ( ϕ , t ) , m = 1 , 2 , , 5 ,
where Φ = { ϕ | 0.5 < ϕ < 0.5 } , f ϑ ( η ) = ( | η + 1 | | η 1 | ) / 8 , η R , ϑ = 1 , 2 , 3 , G = diag ( 0.7 , 0.52 , 0.94 , 0.51 ) , Y = diag ( 0.27 , 0.42 , 0.16 , 0.38 ) , C = ( 0.33 , 0.29 , 0.54 , 0.66 ) T and
E ˜ 1 = 0.34 0 0 0 0.25 0 0 0 0.48 0 0 0 , E ˜ 2 = 0.75 0 0 0 0.46 0 0 0 0.43 0 0 0 ,
E ˜ 3 = 0.18 0 0 0 0.42 0 0 0 0.77 0 0 0 , X = 0.4 0 0 0 0 0.55 0 0 0 0 0.67 0 ,
H 1 = 0.6 0.1 0 0.5 0 0.1 1.6 0.8 0.7 0 0 0.8 1.7 0 0.9 0.5 0.7 0 1.2 0 0 0 0.9 0 0.9 ,
H 2 = 0.7 0.2 0 0.5 0 0.2 0.9 0.5 0.2 0 0 0.5 0.6 0 0.1 0.5 0.2 0 0.7 0 0 0 0.1 0 0.1 ,
H 3 = 1.5 0.4 0 1.1 0 0.4 0.9 0.3 0.2 0 0 0.3 0.8 0 0.5 1.1 0.2 0 1.3 0 0 0 0.5 0 0.5 ,
S ^ 1 = 0.26 0 0 0 0 0 0.26 0 0 0 0 0 0.27 0 0 0 0 0 0.22 0 0 0 0 0 0.19 ,
S ^ 2 = 0.27 0 0 0 0 0 0.19 0 0 0 0 0 0.26 0 0 0 0 0 0.17 0 0 0 0 0 0.21 ,
S ^ 3 = 0.23 0 0 0 0 0 0.22 0 0 0 0 0 0.21 0 0 0 0 0 0.25 0 0 0 0 0 0.15 ,
q 11 ( u m 1 ( ϕ , t ) ) = 0.45 , | u m 1 ( ϕ , t ) | 1 , 0.3 , | u m 1 ( ϕ , t ) | > 1 , q 12 ( u m 1 ( ϕ , t ) ) = 0.5 , | u m 1 ( ϕ , t ) | 1 , 0.46 , | u m 1 ( ϕ , t ) | > 1 ,
q 13 ( u m 1 ( ϕ , t ) ) = 0.34 , | u m 1 ( ϕ , t ) | 1 , 0.18 , | u m 1 ( ϕ , t ) | > 1 , q 14 ( u m 1 ( ϕ , t ) ) = 0.52 , | u m 1 ( ϕ , t ) | 1 , 0.38 , | u m 1 ( ϕ , t ) | > 1 ,
q 21 ( u m 2 ( ϕ , t ) ) = 0.6 , | u m 2 ( ϕ , t ) | 1 , 0.38 , | u m 2 ( ϕ , t ) | > 1 , q 22 ( u m 2 ( ϕ , t ) ) = 0.27 , | u m 2 ( ϕ , t ) | 1 , 0.33 , | u m 2 ( ϕ , t ) | > 1 ,
q 23 ( u m 2 ( ϕ , t ) ) = 0.75 , | u m 2 ( ϕ , t ) | 1 , 0.66 , | u m 2 ( ϕ , t ) | > 1 , q 24 ( u m 2 ( ϕ , t ) ) = 0.61 , | u m 2 ( ϕ , t ) | 1 , 0.67 , | u m 2 ( ϕ , t ) | > 1 ,
q 31 ( u m 3 ( ϕ , t ) ) = 0.53 , | u m 3 ( ϕ , t ) | 1 , 0.39 , | u m 3 ( ϕ , t ) | > 1 , q 32 ( u m 3 ( ϕ , t ) ) = 0.31 , | u m 3 ( ϕ , t ) | 1 , 0.44 , | u m 3 ( ϕ , t ) | > 1 ,
q 33 ( u m 3 ( ϕ , t ) ) = 0.59 , | u m 3 ( ϕ , t ) | 1 , 0.74 , | u m 3 ( ϕ , t ) | > 1 . q 34 ( u m 3 ( ϕ , t ) ) = 0.54 , | u m 3 ( ϕ , t ) | 1 , 0.47 , | u m 3 ( ϕ , t ) | > 1 ,
q 41 ( u m 4 ( ϕ , t ) ) = 0.73 , | u m 4 ( ϕ , t ) | 1 , 0.46 , | u m 4 ( ϕ , t ) | > 1 , q 42 ( u m 4 ( ϕ , t ) ) = 0.61 , | u m 4 ( ϕ , t ) | 1 , 0.28 , | u m 4 ( ϕ , t ) | > 1 ,
q 43 ( u m 4 ( ϕ , t ) ) = 0.55 , | u m 4 ( ϕ , t ) | 1 , 0.38 , | u m 4 ( ϕ , t ) | > 1 , q 44 ( u m 4 ( ϕ , t ) ) = 0.59 , | u m 4 ( ϕ , t ) | 1 , 0.74 , | u m 4 ( ϕ , t ) | > 1 .
Obviously, the function f ϑ ( · ) ( ϑ = 1 , 2 , 3 ) fulfills the Lipschitz condition with θ ϑ = 0.25 . Based on Theorem 1, the network (47) attains output synchronization under the adaptive controller (12). Figure 1 displays the changing processes of norms of error vectors z m ( · , t ) , m = 1 , 2 , , 5 in the networks (47). From Figure 1, it is clear that the norms of error vectors z m ( · , t ) , m = 1 , 2 , , 5 can converge to 0, which reflects the effectiveness of the designed adaptive controller. Figure 2 depicts the change curves of the adaptive feedback gains s m a ( t ) for the networks (47).

5.2. Example 2

Take into account the following CFOMRDNNs with multiple output derivative couplings:
  0 D t 0.95 u m ( ϕ , t ) = G 2 u m ( ϕ , t ) ϕ 2 Y u m ( ϕ , t ) + Q ( u m ( ϕ , t ) ) f u m ( ϕ , t ) + C + 0.4 n = 1 5 H m n 1 E ˜ 1   0 D t 0.95 ε n ( ϕ , t ) + 0.5 n = 1 5 H m n 2 E ˜ 2   0 D t 0.95 ε n ( ϕ , t ) + 0.6 n = 1 5 H m n 3 E ˜ 3   0 D t 0.95 ε n ( ϕ , t ) + v m ( ϕ , t ) , ε m ( ϕ , t ) = X u m ( ϕ , t ) , m = 1 , 2 , , 5 ,
where Φ = { ϕ | 0.5 < ϕ < 0.5 } , f ϑ ( η ) = ( | η + 1 | | η 1 | ) / 8 , η R , ϑ = 1 , 2 , 3 , G = diag ( 0.5 , 0.52 , 0.54 , 0.59 ) , Y = diag ( 0.47 , 0.42 , 0.46 , 0.38 ) , C = ( 0.43 , 0.49 , 0.54 , 0.41 ) T and
E ˜ 1 = 0.44 0 0 0 0.45 0 0 0 0.48 0 0 0 , E ˜ 2 = 0.55 0 0 0 0.46 0 0 0 0.43 0 0 0 ,
E ˜ 3 = 0.58 0 0 0 0.42 0 0 0 0.67 0 0 0 , X = 0.47 0 0 0 0 0.55 0 0 0 0 0.66 0 ,
H 1 = 0.53 0 0.23 0.3 0 0 0.55 0 0.23 0.32 0.23 0 0.44 0 0.21 0.3 0.23 0 0.63 0.1 0 0.32 0.21 0.1 0.63 ,
H 2 = 0.5 0.2 0 0.3 0 0.2 0.75 0.25 0.3 0 0 0.25 0.55 0 0.3 0.3 0.3 0 0.6 0 0 0 0.3 0 0.3 ,
H 3 = 0.4 0.1 0 0.3 0 0.1 0.45 0.15 0.2 0 0 0.15 0.55 0 0.4 0.3 0.2 0 0.5 0 0 0 0.4 0 0.4 ,
S ^ 1 = 0.5 0 0 0 0 0 0.6 0 0 0 0 0 0.6 0 0 0 0 0 0.6 0 0 0 0 0 0.7 ,
S ^ 2 = 0.4 0 0 0 0 0 0.7 0 0 0 0 0 0.6 0 0 0 0 0 0.5 0 0 0 0 0 0.5 ,
S ^ 3 = 0.5 0 0 0 0 0 0.6 0 0 0 0 0 0.4 0 0 0 0 0 0.7 0 0 0 0 0 0.5 ,
q 11 ( u m 1 ( ϕ , t ) ) = 0.55 , | u m 1 ( ϕ , t ) | 1 , 0.45 , | u m 1 ( ϕ , t ) | > 1 , q 12 ( u m 1 ( ϕ , t ) ) = 0.46 , | u m 1 ( ϕ , t ) | 1 , 0.5 , | u m 1 ( ϕ , t ) | > 1 ,
q 13 ( u m 1 ( ϕ , t ) ) = 0.48 , | u m 1 ( ϕ , t ) | 1 , 0.44 , | u m 1 ( ϕ , t ) | > 1 , q 14 ( u m 1 ( ϕ , t ) ) = 0.47 , | u m 1 ( ϕ , t ) | 1 , 0.54 , | u m 1 ( ϕ , t ) | > 1 ,
q 21 ( u m 2 ( ϕ , t ) ) = 0.48 , | u m 2 ( ϕ , t ) | 1 , 0.6 , | u m 2 ( ϕ , t ) | > 1 , q 22 ( u m 2 ( ϕ , t ) ) = 0.53 , | u m 2 ( ϕ , t ) | 1 , 0.47 , | u m 2 ( ϕ , t ) | > 1 ,
q 23 ( u m 2 ( ϕ , t ) ) = 0.66 , | u m 2 ( ϕ , t ) | 1 , 0.55 , | u m 2 ( ϕ , t ) | > 1 , q 24 ( u m 2 ( ϕ , t ) ) = 0.68 , | u m 2 ( ϕ , t ) | 1 , 0.35 , | u m 2 ( ϕ , t ) | > 1 ,
q 31 ( u m 3 ( ϕ , t ) ) = 0.49 , | u m 3 ( ϕ , t ) | 1 , 0.53 , | u m 3 ( ϕ , t ) | > 1 , q 32 ( u m 3 ( ϕ , t ) ) = 0.44 , | u m 3 ( ϕ , t ) | 1 , 0.31 , | u m 3 ( ϕ , t ) | > 1 ,
q 33 ( u m 3 ( ϕ , t ) ) = 0.51 , | u m 3 ( ϕ , t ) | 1 , 0.59 , | u m 3 ( ϕ , t ) | > 1 . q 34 ( u m 3 ( ϕ , t ) ) = 0.51 , | u m 3 ( ϕ , t ) | 1 , 0.71 , | u m 3 ( ϕ , t ) | > 1 ,
q 41 ( u m 4 ( ϕ , t ) ) = 0.44 , | u m 4 ( ϕ , t ) | 1 , 0.63 , | u m 4 ( ϕ , t ) | > 1 , q 42 ( u m 4 ( ϕ , t ) ) = 0.62 , | u m 4 ( ϕ , t ) | 1 , 0.53 , | u m 4 ( ϕ , t ) | > 1 ,
q 43 ( u m 4 ( ϕ , t ) ) = 0.41 , | u m 4 ( ϕ , t ) | 1 , 0.58 , | u m 4 ( ϕ , t ) | > 1 , q 44 ( u m 4 ( ϕ , t ) ) = 0.41 , | u m 4 ( ϕ , t ) | 1 , 0.63 , | u m 4 ( ϕ , t ) | > 1 .
Evidently, the function f ϑ ( · ) ( ϑ = 1 , 2 , 3 ) satisfies the Lipschitz condition with θ ϑ = 0.25 . From the Theorem 2, it is found that the network (48) is output synchronized under the adaptive controller (38). From Figure 3, we can see the norms of error vectors z m ( · , t ) , m = 1 , 2 , , 5 can converge to 0, which reflects the designed adaptive output feedback controller in the networks (48) is effective. Figure 4 shows the change curves of the adaptive feedback gains s m a ( t ) for the networks (48).

6. Conclusions

In this article, two types of CFOMRDNNs with multiple output couplings or multiple output derivative couplings have been presented. We have addressed the problem of output synchronization of CFOMRDNNs with multiple output couplings with the assistance of the inverse Laplace transform and the properties of Mittag–Leffler function. Taking into account the effect of derivative coupling, the output synchronization of CFOMRDNNs with multiple output derivative couplings has been further studied by employing adaptive control strategy. At last, two numerical examples have substantiated the effectiveness of the derived output synchronization criteria.

Author Contributions

Validation, Y.W. and Z.-Y.X.; Writing—original draft, Feng You; Writing—review & editing, H.-A.T.; Supervision, J.-W.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Scientific Research Foundation of Chongqing University of Technology under Grant 2021ZDZ001.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wu, S.C.; Li, X.D.; Ding, Y.H. Saturated impulsive control for synchronization of coupled delayed neural networks. Neural Netw. 2021, 141, 261–269. [Google Scholar] [CrossRef] [PubMed]
  2. Zhang, H.; Gong, D.; Chen, B.; Liu, Z. Synchronization for coupled neural networks with interval delay: A novel augmented Lyapunov–Krasovskii functional method. IEEE Trans. Neural Netw. Learn. Syst. 2013, 24, 58–70. [Google Scholar] [CrossRef] [PubMed]
  3. Long, H.; Ci, J.; Guo, Z.; Wen, S.; Huang, T. Synchronization of coupled switched neural networks subject to hybrid stochastic disturbances. Neural Netw. 2023, 166, 459–470. [Google Scholar] [CrossRef] [PubMed]
  4. Wen, S.; Zeng, Z.; Huang, T.; Meng, Q.; Yao, W. Lag synchronization of switched neural networks via neural activation function and applications in image encryption. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1493–1502. [Google Scholar] [CrossRef] [PubMed]
  5. Wang, J.; Zhang, H.; Wang, Z.; Liu, Z. Sampled-data synchronization of Markovian coupled neural networks with mode delays based on mode-dependent LKF. IEEE Trans. Neural Netw. Learn. Syst. 2017, 28, 2626–2637. [Google Scholar] [CrossRef] [PubMed]
  6. Wang, J.L.; Wu, H.N.; Huang, T.; Xu, M. Output synchronization in coupled neural networks with and without external disturbances. IEEE Trans. Control. Netw. Syst. 2018, 5, 2049–2061. [Google Scholar] [CrossRef]
  7. Wang, J.L.; Wu, H.N.; Huang, T.; Ren, S.Y.; Wu, J. Passivity and output synchronization of complex dynamical networks with fixed and adaptive coupling strength. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 364–376. [Google Scholar] [CrossRef]
  8. Yu, H.; Antsaklis, P. Output synchronization of networked passive systems with event-driven communication. Trans. Autom. Control. 2014, 59, 750–756. [Google Scholar] [CrossRef]
  9. Wang, N.; Li, X.J. Optimal output synchronization control of a class of complex dynamical networks with partially unknown system dynamics. IEEE Trans. Syst. Man, Cybern. Syst. 2021, 51, 822–832. [Google Scholar] [CrossRef]
  10. Xiao, X.; Li, X.J.; Jin, X.Z.; Cui, Y. Output synchronization control for a class of complex dynamical networks with non-identical dynamics. Appl. Math. Comput. 2018, 335, 38–49. [Google Scholar] [CrossRef]
  11. Huang, Y.; Xiao, X.; Wang, Y.; Li, J. Event-triggered pinning synchronization and robust pinning synchronization of coupled neural networks with multiple weights. Int. J. Adapt. Control. Signal Process. 2023, 37, 584–602. [Google Scholar] [CrossRef]
  12. Wang, J.L.; Qin, Z.; Wu, H.N.; Huang, T.; Wei, P.C. Analysis and pinning control for output synchronization and H output synchronization of multi-weighted complex networks. IEEE Trans. Cybern. 2019, 49, 175–205. [Google Scholar] [CrossRef]
  13. Wang, J.L.; Wang, D.Y.; Wu, H.N.; Huang, T. Output synchronization of complex dynamical networks with multiple output or output derivative couplings. IEEE Trans. Cybern. 2021, 51, 927–937. [Google Scholar] [CrossRef] [PubMed]
  14. Liu, X.L.; Wang, J.L.; Huang, T. Output synchronization for coupled neural networks with multiple delayed output couplings. IEEE Trans. Circuits Syst. II: Express Briefs. 2022, 69, 4394–4398. [Google Scholar] [CrossRef]
  15. Zhao, L.H.; Ren, S.Y.; Shi, Y.W.; Liu, Y.P. Generalized lag output synchronization of the multiple output coupled complex dynamical networks. In Proceedings of the 38th Chinese Control Conference (CCC), Guangzhou, China, 27–30 July 2019; pp. 930–935. [Google Scholar] [CrossRef]
  16. Tang, Z.; Park, J.H.; Wang, Y.; Feng, J. Impulsive synchronization of derivative coupled neural networks with cluster-tree topology. IEEE Trans. Netw. Sci. Eng. 2019, 7, 1788–1798. [Google Scholar] [CrossRef]
  17. Wang, D.Y.; Wang, J.L.; Ren, S.Y.; Huang, Y.L. Output synchronization and H output synchronization of complex dynamical networks with multiple derivative couplings. J. Frankl. Inst. 2019, 356, 407–440. [Google Scholar] [CrossRef]
  18. Wang, J.L.; Wu, H.Y.; Huang, T.; Ren, S.Y. Finite-time synchronization and H synchronization for coupled neural networks with multistate or multiderivative couplings. IEEE Trans. Neural Netw. Learn. Syst. Early Acces. 2022. [Google Scholar] [CrossRef]
  19. Lundstrom, B.N.; Higgs, M.H.; Spain, W.J.; Fairhall, A.L. Fractional differentiation by neocortical pyramidal neurons. Nat. Neurosci. 2008, 11, 1335–1342. [Google Scholar] [CrossRef]
  20. Lin, Y.T.; Wang, J.L.; Liu, C.G.; Huang, Y.L. Output synchronization of coupled fractional-order neural networks with multiple weights. In Proceedings of the 41th Chinese Control Conference (CCC), Hefei, China, 25–27 July 2022; pp. 953–958. [Google Scholar] [CrossRef]
  21. Liu, P.; Li, Y.; Sun, J.; Wang, Y. Output synchronization analysis of coupled fractional-order neural networks with fixed and adaptive couplings. Neural Comput. Appl. 2023, 35, 517–528. [Google Scholar] [CrossRef]
  22. Lin, Y.T.; Wang, J.L.; Liu, C.G. Output synchronization analysis and PD control for coupled fractional-order neural networks with multiple weights. Neurocomputing 2023, 519, 17–25. [Google Scholar] [CrossRef]
  23. Yang, D.; Ren, G.; Wang, H.; Yu, Y.; Yuan, X. Adaptive control for output projective synchronization of fractional-order hybrid coupled neural networks with mismatched dimensions. Neurocomputing 2023, 558, 126738. [Google Scholar] [CrossRef]
  24. Liu, F.; Yang, Y.; Chang, Q. Synchronization of fractional-order delayed neural networks with reaction–diffusion terms: Distributed delayed impulsive control. Commun. Nonlinear Sci. Numer. Simul. 2023, 124, 107303. [Google Scholar] [CrossRef]
  25. Zhao, F.L.; Wang, Z.P.; Wu, H.N.; Wang, J.L.; Huang, T. Output synchronization of reaction–diffusion neural networks under random packet losses via event-triggered sampled–data control. Neurocomputing 2022, 514, 563–573. [Google Scholar] [CrossRef]
  26. Wang, J.L.; Du, X.Y.; Liu, C.G. Synchronization and adaptive control for coupled fractional-order reaction–diffusion neural networks with multiple couplings. ISA Trans. 2023, 136, 93–103. [Google Scholar] [CrossRef]
  27. Qiu, Q.; Su, H. Finite-time output synchronization for output-coupled reaction-diffusion neural networks with directed topology. IEEE Trans. Netw. Sci. Eng. 2022, 9, 1386–1394. [Google Scholar] [CrossRef]
  28. Zhou, C.; Wang, C.; Sun, Y.; Yao, W.; Lin, H. Cluster output synchronization for memristive neural networks. Inf. Sci. 2022, 589, 459–477. [Google Scholar] [CrossRef]
  29. Li, R.; Cao, J.; Li, N. Quasi-synchronization control of quaternion-valued fuzzy memristive neural networks. Fuzzy Sets Syst. 2023, 472, 108701. [Google Scholar] [CrossRef]
  30. Ma, F.; Gao, X. Synchronization and quasi-synchronization of delayed fractional coupled memristive neural networks. Neural Process. Lett. 2022, 54, 1647–1662. [Google Scholar] [CrossRef]
  31. Mao, X.; Wang, X.; Lu, Y.; Qin, H. Synchronizations control of fractional-order multidimension-valued memristive neural networks with delays. Neurocomputing 2024, 563, 126942. [Google Scholar] [CrossRef]
  32. Chen, L.; Cao, J.; Wu, R.; Machado, J.T.; Lopes, A.M.; Yang, H. Stability and synchronization of fractional-order memristive neural networks with multiple delays. Neural Netw. 2017, 94, 76–85. [Google Scholar] [CrossRef] [PubMed]
  33. Fan, Y.; Huang, X.; Wang, Z.; Xia, J.; Li, Y. Global Mittag–Leffler synchronization of delayed fractional-order memristive neural networks. Adv. Differ. Equ. 2018, 2018, 338. [Google Scholar] [CrossRef]
  34. Zhang, L.; Yang, Y.; Wang, F. Lag synchronization for fractional-order memristive neural networks via period intermittent control. Nonlinear Dyn. 2017, 89, 367–381. [Google Scholar] [CrossRef]
  35. Li, Y.; Chen, Y.; Podlubny, I. Mittag–Leffler stability of fractional order nonlinear dynamic systems. Automatica 2009, 45, 1965–1969. [Google Scholar] [CrossRef]
  36. Lv, Y.; Hu, C.; Yu, J.; Jiang, H.; Huang, T. Edge-based fractional-order adaptive strategies for synchronization of fractional-order coupled networks with reaction–diffusion terms. IEEE Trans. Cybern. 2020, 50, 1582–1594. [Google Scholar] [CrossRef] [PubMed]
  37. Lu, J.G. Global exponential stability and periodicity of reaction–diffusion delayed recurrent neural networks with Dirichlet boundary conditions. Chaos Solitons Fractals 2008, 35, 116–125. [Google Scholar] [CrossRef]
Figure 1. z m ( · , t ) 2 , m = 1 , 2 , , 5 .
Figure 1. z m ( · , t ) 2 , m = 1 , 2 , , 5 .
Fractalfract 08 00078 g001
Figure 2. s m a ( t ) , m = 1 , 2 , , 5 , a = 1 , 2 , 3 .
Figure 2. s m a ( t ) , m = 1 , 2 , , 5 , a = 1 , 2 , 3 .
Fractalfract 08 00078 g002
Figure 3. z m ( · , t ) 2 , m = 1 , 2 , , 5 .
Figure 3. z m ( · , t ) 2 , m = 1 , 2 , , 5 .
Fractalfract 08 00078 g003
Figure 4. s m a ( t ) , m = 1 , 2 , , 5 , a = 1 , 2 , 3 .
Figure 4. s m a ( t ) , m = 1 , 2 , , 5 , a = 1 , 2 , 3 .
Fractalfract 08 00078 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

You, F.; Tang, H.-A.; Wang, Y.; Xia, Z.-Y.; Li, J.-W. Adaptive Output Synchronization of Coupled Fractional-Order Memristive Reaction-Diffusion Neural Networks. Fractal Fract. 2024, 8, 78. https://doi.org/10.3390/fractalfract8020078

AMA Style

You F, Tang H-A, Wang Y, Xia Z-Y, Li J-W. Adaptive Output Synchronization of Coupled Fractional-Order Memristive Reaction-Diffusion Neural Networks. Fractal and Fractional. 2024; 8(2):78. https://doi.org/10.3390/fractalfract8020078

Chicago/Turabian Style

You, Feng, Hong-An Tang, Yanhong Wang, Zi-Yi Xia, and Jin-Wei Li. 2024. "Adaptive Output Synchronization of Coupled Fractional-Order Memristive Reaction-Diffusion Neural Networks" Fractal and Fractional 8, no. 2: 78. https://doi.org/10.3390/fractalfract8020078

APA Style

You, F., Tang, H. -A., Wang, Y., Xia, Z. -Y., & Li, J. -W. (2024). Adaptive Output Synchronization of Coupled Fractional-Order Memristive Reaction-Diffusion Neural Networks. Fractal and Fractional, 8(2), 78. https://doi.org/10.3390/fractalfract8020078

Article Metrics

Back to TopTop