Next Article in Journal
Fractal Tent Map with Application to Surrogate Testing
Next Article in Special Issue
Existence of Mild Solutions to Delay Diffusion Equations with Hilfer Fractional Derivative
Previous Article in Journal
Well-Posedness and Hyers–Ulam Stability of Fractional Stochastic Delay Systems Governed by the Rosenblatt Process
Previous Article in Special Issue
Quasi-Projective Synchronization of Discrete-Time Fractional-Order Complex-Valued BAM Fuzzy Neural Networks via Quantized Control
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quantized Nonfragile State Estimation of Memristor-Based Fractional-Order Neural Networks with Hybrid Time Delays Subject to Sensor Saturations

1
School of Automation, Nanjing University of Science and Technology, Nanjing 210094, China
2
School of Electronics and Information Engineering, Changchun University of Science and Technology, Changchun 130022, China
3
School of Electrical Engineering, Guangxi Technological College of Machinery and Electricity, Nanning 530007, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(6), 343; https://doi.org/10.3390/fractalfract8060343
Submission received: 21 May 2024 / Revised: 28 May 2024 / Accepted: 29 May 2024 / Published: 6 June 2024

Abstract

:
This study addresses the issue of nonfragile state estimation for memristor-based fractional-order neural networks with hybrid randomly occurring delays. Considering the finite bandwidth of the signal transmission channel, quantitative processing is introduced to reduce network burden and prevent signal blocking and packet loss. In a real-world setting, the designed estimator may experience potential gain variations. To address this issue, a fractional-order nonfragile estimator is developed by incorporating a logarithmic quantizer, which ultimately improves the reliability of the state estimator. In addition, by combining the generalized fractional-order Lyapunov direct method with novel Caputo–Wirtinger integral inequalities, a lower conservative criterion is derived to guarantee the asymptotic stability of the augmented system. At last, the accuracy and practicality of the desired estimation scheme are demonstrated through two simulation examples.

1. Introduction

The origin of fractional calculus can be traced back to a question raised by L’Hôpital in 1695. Until a few decades ago, the available literature on fractional calculus primarily concentrated on theoretical analysis [1]. Commencing in 1960, the exploration of fractional calculus expanded its application to the realms of physics, science, and bioengineering, which received considerable attention [2,3,4]. As it turns out, fractional calculus can describe real phenomena more accurately than integer-order calculus due to its properties of infinite memory and heritability [5,6]. In recent years, research on fractional-order systems has received considerable attention from numerous scholars. A plethora of novel findings have been published on stability analysis, pinning control, synchronization, and other related topics [7,8,9]. For instance, the design of a nonfragile controller has been addressed in [10] for a class of delayed fraction-order uncertain systems. In addition, the authors in [11] addressed the L -gain problem of incommensurate fractional-order systems with hybrid time delays. What is striking is that the authors introduced a notable approach in stability analysis that relied on the solution’s monotonicity and positivity rather than a Lyapunov–Krasovskii functional.
It is worth noting that neural networks have become increasingly popular over the last few decades due to their wide applications in fault diagnosis, image recognition, signal processing, and more [12,13,14]. State estimation (SE) plays an important role in these applications. So far, a substantial body of research results on SE issues has been presented in the existing literature [15,16,17,18,19]. It is worth pointing out that these network structures are often analyzed and designed with resistors to simulate neural synapses. Note, that Chua introduced the concept of memristor in 1971 [20]. Unfortunately, it was not until 2008 that the first memristor component was produced by the HP Lab (as seen in [21]). Unlike conventional resistors, this unique type of resistor offers several advantages, including lower energy consumption, faster operation speed, and reduced memory space requirements. Hence, memristors have been applied in many complex systems, especially in neural networks, see [22,23,24]. In comparison to traditional neural networks with n neurons, the number of equilibria of memristor-based fractional-order neural networks increases from 2 n to 2 2 n 2 + n , leading to a wide range of applications. Owing to these advantages, the dynamical analysis issues (e.g., dissipativity, stability, and synchronization) for fractional-order memristive neural networks (FOMNNs) have recently attracted considerable interest [25,26,27].
In contrast to the abundance of research findings on other dynamic analysis issues, there is a scarcity of literature addressing the SE issue specifically in the context of FOMNNs. Among the most available studies on the SE issue, the authors failed to consider the potential impact of gain variations in real-world scenarios [28,29,30]. The estimator gain perturbations from complex environments may lead to the fragility of the traditional estimator design. As a result, nonfragile techniques have drawn much attention for various types of network systems to withstand the influence of gain perturbations [31]. In [32], a nonfragile estimator was developed for delayed neural networks with randomly occurring nonlinearity. In [33], the study explored the nonfragile SE problem of delayed fractional-order neural networks under an event-triggered mechanism. The authors in [34] addressed the nonfragile SE issue of memristor-based fractional-order BAM neural networks with time-varying delays. However, the stability criterion derived is delay-independent. Quantitative processing has attracted significant attention as an efficient method for conserving network resources. In networked control systems, quantitative processing, such as compressing and decompressing sampled data, is frequently employed to minimize transmission load and preserve network resources. In [35], the authors addressed the problem of quantized SE for neural networks under cyber attacks. Despite this, there are few studies on designing a fractional-order nonfragile estimator for delayed FOMNNs, which serves as motivation for our research.
As is known, time delays always appear in real systems, which may impact the performance or stability [26,34]. Time delays typically result from various factors, such as limitations in the communication channel or bandwidth capacity. The common delays include discrete delay [11], distributed delay [36], leakage delay [25], and others, which have been addressed in numerous outstanding studies. For example, in [25], the Mittag–Leffler stability issue for neutral-type fractional-order neural networks with leakage delay was investigated. It is worth noting that in the context of random fluctuations in the real environment, time-varying delays may occur in a probabilistic manner, typically referred to as randomly occurring time-varying delays (ROTDs). For instance, the issue of partial-neurons-based SE for recurrent neural networks with ROTDs was examined in [15]. The discrete delay associated with a Bernoulli variable ϑ ( t ) was discussed. So far, there have been plenty of interesting findings on fractional-order neural networks with time delays. As far as we know, there is a lack of research on fractional-order neural networks with ROTDs, particularly in the context of neural networks based on memristors. Furthermore, the sensor output is often constrained by the inherent physical attributes of components, which may lead to saturated measurement outputs [37]. Furthermore, saturation may introduce nonlinear characteristics that could significantly impact the accuracy of the estimation algorithm. Considering the saturation as well as the time delay for FOMNNs is meaningful and practical and inspired by the aforementioned reasons, our aim is to investigate the nonfragile SE problem for a class of FOMNNs with ROTDs and sensor saturations. The key advantages of our investigation are outlined as follows:
(i) The nonfragile SE issue of memristor-based fractional-order neural networks is addressed subject to hybrid randomly occurring time-varying delays and sensor saturations.
(ii) In order to guarantee the asymptotic stability of the augmented system, a delay-dependent criterion has been derived using the Lyapunov theory. Different from the previous excellent results in [36,38,39], a Caputo–Wirtinger integral inequality is utilized to decrease conservatism.
(iii) Taking into account the finite bandwidth and potential gain variations, a fractional-order nonfragile estimator is developed with quantized measurements.
(iv) To validate the usefulness of the proposed estimation algorithm for FOMNNs, two numerical examples are provided.

2. Problem Formulation and Preliminaries

Several common definitions of fractional calculus have been presented, and some useful lemmas are recalled here.
Definition 1
([40]). The fractional integral operator of the function ( t ) is defined by
I α ( t ) = 1 Γ ( α ) t 0 t ( t σ ) α 1 ( σ ) d σ , α R +
where t t 0 and the Gamma function Γ ( z ) = 0 e t t z 1 d t .
Definition 2
([40]). The Caputo’s derivative form of ( t ) is
D t α t 0 C ( t ) = 1 Γ ( k α ) t 0 t ( t σ ) k α 1 ( k ) ( σ ) d σ ,
where t t 0 , and α ( k 1 , k ) , ( t ) C k ( [ t 0 , ) , R ) .
In the follow-up, D t α t 0 C with order α can be replaced by D α on [ t 0 , t ] . Then, consider the following FOMNNs model with hybrid time-varying delays:
D α ξ i ( t ) = c i ( ξ i ( t ) ) ξ i ( t ) + j = 1 n a i j ( ξ j ( t ) ) f j ( ξ j ( t ) ) + γ ( t ) j = 1 n b i j ( ξ j ( t ) ) f j ( ξ j ( t ϱ ( t ) ) ) + δ ( t ) j = 1 n e i j ( ξ j ( t ) ) t d ( t ) t f j ( ξ j ( s ) ) d s , ξ i ( t 0 ) = φ ˜ i ( t 0 ) , t 0 [ ρ ¯ , 0 ] , ρ ¯ = max ϱ , d ,
where 0 < α < 1 , ξ i ( t ) is the ith neuron state; c i > 0 , f j ( · ) represents the activation function, ϱ ( t ) , d ( t ) present time-varying transmission delays satisfying 0 ϱ ( t ) ϱ , 0 d ( t ) d and ϱ ˙ ( t ) ϱ ¯ < 1 in which ϱ , d are known real constants. The state feedback positive matrix c i ( ξ i ( t ) ) and the memristive connection weights a i j ( ξ j ( t ) ) , b i j ( ξ j ( t ) ) , e i j ( ξ j ( t ) ) are described as follows:
c i ( ξ i ( t ) ) = 1 C ˜ i j = 1 n ( W ˜ i j a + W ˜ i j b + W ˜ i j e ) × s g n i j + 1 R i , a i j ( ξ j ( t ) ) = W ˜ i j a C ˜ i × s g n i j , b i j ( ξ j ( t ) ) = W ˜ i j b C ˜ i × s g n i j , e i j ( ξ j ( t ) ) = W ˜ i j e C ˜ i × s g n i j
where W ˜ i j a , W ˜ i j b , W ˜ i j e are the memductances of memristors F a i j , F a i j satisfying W ˜ i j a = 1 F a i j , W ˜ i j b = 1 F b i j , C ˜ i stands for the capacitor. s g n i j = 1 if i j , otherwise 1 . According to the characteristics of d i ( ξ i ( t ) ) , z i j ( ξ j ( t ) ) , we have
c i ( ξ i ( t ) ) = c i , | ξ i ( t ) | T , c i , | ξ i ( t ) | > T , z i j ( ξ j ( t ) ) = z i j , | ξ j ( t ) | T , z i j , | ξ j ( t ) | > T ,
in which T > 0 represents the switching jump, c i , c i , z i j , z i j are constants, and c i ( ξ i ( t ) ) , z i j ( ξ j ( t ) ) are switching by the states. The choice of state-dependent parameters are shown in the following Algorithm 1:
Algorithm 1: The Switching of Memristance Parameters
Input:  The constant value n, the initial value i = 1 , j = 1 .
Output:  Obtain c i , a i j , b i j , e i j .
while  i n   do
while j n do if | ξ i ( t ) | T then c i = c i , a i j = a i j , b i j = b i j , e i j = e i j else c i = c i , a i j = a i j , b i j = b i j , e i j = e i j j = j + 1 ; i = i + 1 ;
    According to the differential inclusions and set-valued maps [41], system (3) can be rewritten as
D α ξ i ( t ) c o c i , c i ξ i ( t ) + j = 1 n c o a i j , a i j f j ( ξ j ( t ) ) + γ ( t ) j = 1 n c o b i j , b i j f j ( ξ j ( t ϱ ( t ) ) ) + δ ( t ) j = 1 n c o e i j , e i j t d ( t ) t f j ( ξ j ( s ) ) d s ,
where c o c i , c i = c ̲ i , c ¯ i , c o z i j , z i j = z ̲ i j , z ¯ i j , with c ̲ i = min c i , c i , c ¯ i = max c i , c i , z ̲ i j = min z ij , z ij , z ¯ ij = max z ij , z ij .
For presentation simplicity, we denote C ̲ , C ¯ = c ̲ i , c ¯ i n × n , Z ̲ , Z ¯ = z ̲ i j , z ¯ i j n × n , ξ ( t ) = col n ξ i ( t ) , f ( ξ ( t ) ) = col n f j ( ξ j ( t ) ) , f ( ξ ( t ϱ t ) ) = col n f j ( ξ j ( t ϱ ( t ) ) ) . Then, system (5) can be represented in matrix form as
D α ξ ( t ) = C ξ ( t ) + A g ( ξ ( t ) ) + γ ( t ) B f ( ξ ( t ϱ t ) ) + δ ( t ) E t d ( t ) t f ( ξ ( s ) ) d s ,
where C C ̲ , C ¯ , Z Z ̲ , Z ¯ are measurable functions. By means of Lemma 1 in [42], neural network model (6) is further rewritten as
D α ξ ( t ) = C ξ ( t ) + A f ( ξ ( t ) ) + γ ( t ) B f ( ξ ( t ϱ ( t ) ) ) + δ ( t ) E t d ( t ) t f ( ξ ( s ) ) d s ,
where C = C + Δ C , Z = Z + Δ Z , C = C ̲ + C ¯ 2 , Δ C = H c F c ( t ) N c , Z = Z ̲ + Z ¯ 2 , Z = H z F z ( t ) N z , with F c T ( t ) F c ( t ) I n 2 , F z T ( t ) F z ( t ) I n 2 , H c = H c 1 , H c 2 , , H cn , F c ( t ) = diag 0 , , 0 1 , F c ( t ) , 0 , , 0 n , H z = H z 1 , H z 2 , , H zn , F z ( t ) = F z 11 ( t ) , F z 12 ( t ) , , F z n n ( t ) , N c = N z = I n , I n , , I n n T .
Remark 1.
Taking the phenomena of RODs into consideration, two stochastic variables γ ( t ) , δ ( t ) which obey the Bernoulli distribution are employed and satisfy the following statistical properties: P r γ ( t ) = 1 = E γ ( t ) = γ ¯ , P r γ ( t ) = 0 = 1 γ ¯ , P r δ ( t ) = 1 = E δ ( t ) = δ ¯ , P r δ ( t ) = 0 = 1 δ ¯ . Furthermore, analyzing the dynamic behaviors of FOMNNs is challenging due to the state-dependent nature of memristive connection weights. As is it known that the traditional methods for addressing the stability and SE of NNs are not applicable to memristor-based FONNs. Different from the existing excellent results [43,44,45], in this paper, we transform FOMNNs (3) into a class of uncertain systems.
Assumption 1.
The function f ( · ) : R n R n satisfies f ( 0 ) = 0 and the following sector-bounded condition:
f ( ν 1 ) f ( ν 2 ) F 1 ( ν 1 ν 2 ) T f ( ν 1 ) f ( ν 2 ) F 2 ( ν 1 ν 2 ) 0 ,
in which ν 1 , ν 2 R n , matrices F 1 and F 2 are known.
The measurement outputs ϑ s ( t ) are as follows:
ϑ s ( t ) = S ( ϑ ( t ) ) ,
ϑ ( t ) = C ξ ( t )
where ϑ ( t ) represents the output vector. C is known constant matrices with appropriate dimensions. The function S ( · ) : R n R n is a saturation function defined as follows:
S ( ϑ ) S 1 T ( ϑ 1 ) , S 2 T ( ϑ 2 ) , S n T ( ϑ n ) T
where S ( ϑ ) sign ( ϑ ) min ϑ , max , | ϑ | ( = 1 , 2 , , n ) with ϑ , max being the th element of ϑ max (i.e., the saturation level).
In many practical problems, the estimator gains K may undergo certain adjustments or fluctuations due to the complex and changeable environment, which can result in system fragility [32]. Hence, it is necessary to design a fractional-order nonfragile estimator to reduce the influence of gain variation.
D α ξ ^ ( t ) = C ξ ^ ( t ) + A f ( ξ ^ ( t ) ) + γ ¯ B f ( ξ ^ ( t ϱ t ) ) + δ ¯ E t d ( t ) t f ( ξ ( s ) ) d s + ( K + Δ K ) ( ϑ s ( t ) ϑ ^ ( t ) ) , ϑ ^ ( t ) = C ξ ^ ( t ) ,
where ξ ^ ( t ) denotes the estimation of ξ ( t ) , and K is the estimator gain to be designed. Δ K signifies the fluctuation with H k F k ( t ) N k , F k T ( t ) F k ( t ) I . In addition, considering the effect of quantization in [35,46], we introduce the quantitative process to save the bandwidth and the logarithmic quantizer Q ( z ) = col Q 1 ( z 1 ) , Q 2 ( z 2 ) , , Q m ( z m ) is employed with
Q l ( ϰ l ) = υ i u 0 , υ i u 0 1 + ϵ < ϰ l υ i u 0 1 ϵ , i = 0 , ± 1 , ± 2 , , 0 , ϰ l = 0 , Q ( ϰ l ) , ϰ l < 0
where 0 < υ < 1 denotes the quantization density, u 0 is a scaling scalar, ϵ = 1 υ 1 + υ . As observed in [47], Q ( ϰ ) can be rewritten as
ϑ q ( t ) Q ( ϰ ) = ( I + Δ ι ) ϰ ,
where ϵ Δ ι i ϵ .
Next, define ν ( t ) = ξ ( t ) ξ ^ ( t ) and f ˜ ( ν ( t ) ) = f ( ξ ( t ) ) f ( ξ ^ ( t ) ) . The error dynamic is shown as
D α ν ( t ) = C ν ( t ) Δ C ξ ( t ) + A f ˜ ( ν ( t ) ) + Δ A f ( ξ ( t ) ) + γ ¯ B f ˜ ( ν ( t ϱ t ) ) + γ ¯ Δ B f ( ξ ( t ϱ t ) ) δ ¯ E t d ( t ) t f ˜ ( ν ( s ) ) d s + δ ¯ Δ E t d ( t ) t f ( ξ ( s ) ) d s ( K + Δ K ) ϑ q ( t ) C ξ ( t ) + C ν ( t ) + ς ( t ) ,
where ς ( t ) = γ ˜ ( B + Δ B ) f ( ξ ( t ϱ ( t ) ) ) + δ ˜ ( E + Δ E ) t d ( t ) t f ( ξ ( s ) ) d s , γ ˜ = γ ( t ) γ ¯ , δ ˜ = δ ( t ) δ ¯ .
Definition 3
([48]). A nonlinearity S ( · ) is said to satisfy a sector condition if
( S ( x ) G 1 x ) T ( S ( x ) G 2 x ) 0 , x R n .
for real matrices G 1 R n × n and G 2 R n × n with G 1 0 , G 2 0 , G = G 2 G 1 > 0 . In this case, the nonlinear function S ( · ) can be said to belong to the sector [ G 1 , G 2 ] .
From (15), the nonlinear function S ( · ) can be rewritten as
S ( C ξ ( t ) ) = G 1 C ξ ( t ) + χ ( C ξ ( t ) ) ,
Then, the nonlinearity χ ( · ) Y satisfies
Y χ : χ T ( C ξ ( t ) ) ( χ ( C ξ ( t ) ) G C ξ ( t ) ) 0 ,
In what follows, letting ν ( t ) col ξ ( t ) , ν ( t ) , φ f ( t ) col f ( t ) , f ˜ ( ν ( t ) ) , φ f ( t ϱ t ) col f ( t ϱ ( t ) ) , f ˜ ( t ϱ ( t ) ) , the augmented system can be obtained from (7) and (14):
D α ν ( t ) = C ˜ ν ( t ) + A ˜ φ f ( t ) + γ ¯ B ˜ φ f ( t ϱ t ) ) K ˜ ( I + Δ ι ) χ ( C ¯ ν ( t ) ) + δ ¯ E ˜ t d ( t ) t φ f ( s ) d s + ς ˜ ( t ) ,
where C ˜ = C Δ C 0 Δ C K ˜ ( I + Δ ι ) G 1 C K ˜ C C K ˜ G 1 C 1 , Z ˜ = Z + Δ Z 0 Δ Z Z , K ˜ = 0 K ˜ , B 1 ˜ = 0 0 B 0 , E 1 ˜ = 0 0 E 0 , ς ˜ ( t ) = γ ˜ B 1 φ f ( t ϱ t ) + δ ˜ E 1 t d ( t ) t φ f ( s ) d s , K ˜ = K + Δ K , C ¯ = [ C   0 ] .
Lemma 1
([49]). Let the function ν ( t ) R n be continuous and differential. Then, one has
1 2 D α ν T ( t ) Q ν ( t ) ν T ( t ) Q D α ν ( t ) , α ( 0 , 1 )
Lemma 2
([50]). Let ν : [ ϱ , ϱ 2 ] R + R n be differentiable. There exist positive symmetric matrix O > 0 , and matrices L 1 , L 2 , L 3 R 3 n × n satisfying the following relationship:
ϱ ϱ 2 ( D α ν ( ζ ) ) T O D α ν ( ζ ) d ζ Θ T Φ Θ , m 1 < α < m
where
Φ = ( ϱ 2 ϱ ) L 1 O 1 L 1 T + 1 3 L 2 O 1 L 2 T + 1 5 L 3 O 1 L 3 T + sym L 1 g 1 + L 2 ( g 1 2 g 2 ) + M 3 ( g 1 6 g 2 + 6 g 3 ) , Θ = col { ϱ ϱ 2 ( D α ν ( ζ ) ) d ζ , 1 ϱ 2 ϱ ϱ ϱ 2 ϱ ζ ( D α ν ( ρ ) ) d ρ d ζ , 2 ( ϱ 2 ϱ ) 2 ϱ ϱ 2 ϱ ζ ϱ r D α ν ( ρ ) d ρ d r d ζ } ,
Definition 4
([50]). Assume that a Lyapunov function V ( t , ν t ) and a class K functions δ i ( i = 1 , 2 , 3 ) satisfy
δ 1 ν V ( t , ν t ) δ 2 ν , D α 0 C V ( t , ν t ) δ 3 ν b + c t α ,
where 0 < α < 1 , c > 0 is an arbitrary constant. Then, the fractional-order system (18) is asymptotically stable.

3. Main Results

For brevity, we establish the following associated notations:
ζ ( t ) = col { ν ( t ) , ν ( t ϱ t ) , ν ( t ϱ ) , D t α 0 C ν ( t ) , φ f ( t ) , φ f ( t ϱ t ) , t d ( t ) t φ f ( s ) d s ϖ ( t ) , χ ( C ¯ ν ( t ) ) } , ϖ ( t ) = col { t ϱ t D t α 0 C ν ( ζ ) d ζ , t ϱ t t ϱ s D t α 0 C ν ( ζ ) d ζ d s , ϑ ( t ) } , ϑ ( t ) = t ϱ t t ϱ s t ϱ u D t α 0 C ν ( ζ ) d ζ d s d u ,
Theorem 1.
Let the estimator gain matrix K be given, and let Δ K be known. For given positive scalars ϱ , d , the augmented system (18) is stochastically asymptotically stable if there are definite matrices P , Q ( = 1 , 2 ) , O , R , any matrix L 1 , L 2 , L 3 , W l ( l = 1 , 2 ) and three positive scalars κ 1 , κ 2 , κ 3 such that
= Υ ϱ L ˜ 1 ϱ L ˜ 2 ϱ L ˜ 3 * O 0 0 * * 3 O 0 * * * 5 O < 0 ,
where Υ = Ξ 1 Ξ 2 1 * Ξ 3 2 * * Ξ 4 Ξ 1 = Π 1 , 1 0 0 Π 1 , 4 * Π 2 , 2 0 0 * * Π 3 , 3 0 * * * Π 4 , 4 , Ξ 2 = Π 1 , 5 Π 1 , 6 Π 1 , 7 0 Π 2 , 6 0 0 0 0 Π 4 , 5 Π 4 , 6 Π 4 , 7 , Ξ 3 = diag κ 1 I + d 2 R , κ 2 I , R , Π 1 , 1 = Q 1 + Q 2 κ 1 J 1 sym W 1 C ˜ , Π 1 , 9 = W 1 K ˜ ( I + Δ ι ) , Π 1 , 5 = W 1 A ˜ κ 1 J 1 , Π 1 , 6 = γ ¯ W 1 B ˜ , Π 1 , 7 = δ ¯ W 1 E ˜ , Π 1 , 4 = P W 1 + C ˜ T W 2 , Π 3 , 3 = Q 1 , Π 4 , 4 = ϱ O 2 W 2 , Π 4 , 7 = δ ¯ W 2 E , Π 4 , 5 = W 2 A ˜ , Π 4 , 6 = γ ¯ W 2 B ˜ , Π 4 , 9 = W 2 ( I + Δ ι ) , Π 2 , 2 = κ 2 J 1 ( 1 ϱ ¯ ) Q 2 , Π 2 , 6 = κ 2 J 2 , Π 6 , 6 = κ 2 I , Π 4 , 9 = W 2 K ˜ ( I + Δ ι ) , Π 9 , 9 = 2 κ 3 I , Π 1 , 9 = C ¯ T G T , 1 = 0 Ω 1 , 2 = 0 Ω 2 , Ω 1 = Π 1 , 9 T 0 0 T , Ω 2 = 0 Π 4 , 9 T 0 0 T , L ˜ i = 0 0 0 0 0 0 0 L i T T , Ξ 4 = ω 0 ; 0 Π 9 , 9 , ω = sym L 1 g 1 + L 2 ( g 1 2 g 2 ) + L 3 ( g 1 6 g 2 + 6 g 3 ) , Π 9 , 9 = 2 κ 3 I , J 1 = diag 2 I F 1 T F 2 + F 2 T F 1 2 , J 2 = diag 2 I F 1 T + F 2 T 2 , g = 0 2 n × ( 1 ) 2 n , I n , 0 2 n × ( 3 i ) 2 n ( = 1 , 2 , 3 ) .
Proof. 
Choose the following Lyapunov–Krasovskii functional:
V ( t , ν ( t ) ) = h = 1 4 V h t ,
where
V 1 t = I t ( 1 α ) 0 ν ( t ) T P ν ( t ) , V 2 t = t ϱ t ν T ( ζ ) Q 1 ν ( ζ ) d ζ + t ϱ t t ν T ( ζ ) Q 2 ν ( ζ ) d ζ , V 3 t = ϱ 0 t + θ t D ζ α 0 C ν ( ζ ) T O D ζ α 0 C ν ( ζ ) d ζ d θ , V 4 t = d d 0 t + θ t D ζ α 0 C φ f ( ζ ) T R D ζ α 0 C φ f ( ζ ) d ζ d θ ,
By fractionally differentiating V h t and taking the limit, we obtain
lim ε 1 D t ε 0 C V t = lim ε 1 D t ε 0 C V 1 t + lim ε 1 D t ε 0 C V 2 t + lim ε 1 D t ε 0 C V 3 t = d d t I t ( 1 α ) 0 ν T ( t ) P ν ( t ) + d d t V 2 t + d d t V 3 t = D t α 0 C ( ν T ( t ) P ν ( t ) ) + ν T ( 0 ) P ν ( 0 ) Γ ( 1 α ) t α + d d t V 2 t + d d t V 3 t ,
Based on Lemma 1, one has
D t α 0 C ν T ( t ) P ν ( t ) D t α 0 C ν ( t ) T P ν ( t ) + ν T ( t ) P 0 α D t α ν ( t ) , d d t V 2 t ν T ( t ) Q 1 + Q 2 ν ( t ) ν T ( t ϱ ) Q 1 ν ( t ϱ )
( 1 ϱ ˜ ) ν T ( t ϱ t ) Q 2 ν ( t ϱ t ) ,
Applying Lemma 2, one obtains
d d t V 3 t = ϱ 0 C D t α ν ( t ) O D t α 0 C ν ( t ) t ϱ t D t α 0 C ν T ( ζ ) O D t α 0 C ν ( ζ ) d ζ D t α 0 C ν ( t ) ϱ O D t α 0 C ν ( t ) + ϖ T ( t ) [ ϱ L 1 O 1 L 1 T + ϱ 3 L 2 O 1 L 2 T + ϱ 5 L 3 O 1 L 3 T + sym L 1 g 1 + L 2 ( g 1 2 g 2 ) + L 3 ( g 1 6 g 2 + 6 g 3 ) ] ϖ ( t ) ,
According to the Jessen’s inequality [51], we obtain
d d t V 4 t = d d 0 φ f T ( ζ ) R φ f ( ζ ) d ζ d d 0 φ f T ( t + ζ ) R φ f ( t + ζ ) d ζ = d 2 φ f T ( t ) R φ f ( t ) d t d t φ f T ( ζ ) R φ f ( ζ ) d ζ d 2 φ f T ( t ) R φ f ( t ) t d ( t ) t φ f T ( ζ ) d ζ R t d ( t ) t φ f ( ζ ) ζ
Based on Assumption 1, we have
ν ( t ) φ f ( t ) T J 1 J 2 * I ν ( t ) φ f ( t ) 0 ,
ν ( t ϱ t ) φ f ( t ϱ t ) T J 1 J 2 * I ν ( t ϱ t ) φ f ( t ϱ t ) 0 ,
Based on (16) and (17), one has
χ T ( C ¯ ν ( t ) ) χ ( C ¯ ν ( t ) ) G C ¯ ν ( t ) 0
Then, considering the system (18), for any matrix W 1 , W 2 , we have
0 = 2 ν T ( t ) W 1 + D t α 0 C ν T ( t ) W 2 [ D t α 0 C ν ( t ) + C ˜ ν ( t ) + A ˜ φ f ( t ) + γ ¯ B ˜ φ f ( t ϱ t ) + δ ¯ E ˜ t d ( t ) t φ f ( s ) d s K ˜ χ ( C ¯ ν ( t ) ) + α ˜ B ˜ 1 φ f ( t ϱ t ) + δ ˜ E ˜ 1 t d ( t ) t φ f ( s ) d s ] ,
Taking (21)–(29) into account, it is implied that
lim ε 1 E D t ε 0 C V ( t , ν ( t ) ) 2 D t α 0 C ν ( t ) T P W 1 + W 2 C ˜ ν ( t ) + ν T ( t ) [ Q 1 + Q 2 κ 1 J 1 + W 1 C ˜ + C ˜ T W 1 ] ν ( t ) ν T ( t ϱ ) Q 1 ν ( t ϱ ) + ϱ 0 C D t α ν ( t ) O × D t α 0 C ν ( t ) + ϖ T ( t ) [ ϱ L 1 O 1 L 1 T + ϱ 3 L 2 O 1 L 2 T + ϱ 5 L 3 O 1 L 3 T + sym L 1 g 1 + L 2 ( g 1 2 g 2 ) + L 3 ( g 1 6 g 2 + 6 g 3 ) ] ϖ ( t ) + 2 ν T ( t ) κ 1 J 2 + A ˜ φ f ( t ) κ 1 φ f T ( t ) φ f ( t ) κ 2 ν T ( t ϱ t ) J 1 × ν ( t ϱ t ) + 2 κ 2 ν T ( t ϱ t ) J 2 φ f ( t ϱ t ) 2 ν T ( t ) W 1 K ˜ 1 × ν ( t ϱ t ) 2 ν T ( t ) W 1 K ˜ χ ( C ¯ ψ ˜ ( t ) ) + 2 γ ¯ ν T ( t ) W 1 B ˜ φ f ( t ϱ t ) κ 3 χ T ( C ¯ ν ( t ) ) χ ( C ¯ ν ( t ) ) G C ¯ ν ( t ) D t α 0 C ν T ( t ) W 2 D t α 0 C ν ( t ) + D t α 0 C ν T ( t ) W 2 A ˜ φ f ( t ) + γ ¯ D t α 0 C ν T ( t ) W 2 B φ f ( t ϱ t ) D t α 0 C ν T ( t ) W 2 K ˜ χ ( C ¯ ν ( t ) ) φ f T ( t ϱ t ) φ f ( t ϱ t ) + 2 δ ¯ ν T ( t ) × W 1 E ˜ t d ( t ) t φ f ( s ) d s + 2 δ ¯ D t α 0 C ν T ( t ) W 2 t d ( t ) t φ f ( s ) d s + ν T ( 0 ) P ν ( 0 ) Γ ( 1 α ) t α ζ t T Υ + ϱ L ˜ O ^ 1 1 L ˜ T + ϱ 12 L O ^ 2 1 L T ζ t + ν T ( 0 ) P ν ( 0 ) Γ ( 1 α ) t α
If = Υ + ϱ L ˜ O ^ 1 L ˜ T < 0 , the following inequation can be inferred:
lim ε 1 E D t ε 0 C V t ζ T ( t ) ζ ( t ) + ν T ( 0 ) P ν ( 0 ) Γ ( 1 α ) t α λ min ( ) ν T ( t ) ν ( t ) + ν T ( 0 ) P ν ( 0 ) Γ ( 1 α ) t α
By utilizing the Schur complement to (19), (31) is satisfied. In light of the Definition 4, it holds that lim t E ν ( t ) = 0 . Then, the stability of the augmented system (18) is guaranteed. The proof has been completed. In light of the condition in Theorem 1, the estimator gain can be inferred from the following theorem.    □
Remark 2.
Distinct from [7,8,9] adopt Jessen’s inequality, this paper addresses the integral term t ϱ t D t α 0 C ν T ( ζ ) O D t α 0 C ν ( ζ ) d ζ using novel Caputo–Wirtinger integral inequalities. Three definite integral t ϱ t D t α 0 C ν ( ζ ) d ζ , t ϱ t t ϱ s D t α 0 C ν ( ζ ) d ζ d s , t ϱ t t ϱ s t ϱ u D t α 0 C ν ( ζ ) d ζ d s d u are introduced to reduce the conservatism of the stable condition.
Theorem 2.
Given the scalars ϱ > 0 , d > 0 , ϵ > 0 . Under Assumptions 1, the augmented system (18) is asymptotically stable if there are definite matrices P , Q 1 , Q 2 , O , R , any matrix W , L i and positive scalars κ ( = 1 , 2 , 3 ) , r , s , u , t such that
˜ = Υ ˜ ð 1 * ð 2 < 0 ,
where Υ ˜ = Υ ϱ L ˜ 1 ϱ L ˜ 2 ϱ L ˜ 3 * O 0 0 * * 3 O 0 * * * 5 O , Υ ¯ = Ξ ¯ 1 Ξ 2 ¯ 1 * Ξ 3 ¯ 2 * * Ξ 4 , Ξ ¯ 1 = Π ¯ 1 , 1 0 0 Π ¯ 1 , 4 * Π 2 , 2 0 0 * * Π 3 , 3 0 * * * Π 4 , 4 , X ˜ 1 = 0 0 0 X , X ˜ 2 = 0 X , ð = H ˜ , r N ˜ , T X ˜ 1 , s e 1 T G c 2 T , T H ¯ k , ϵ l e 1 T G c 2 T N ¯ k , T H ˜ k , u N ˜ k , T W H ¯ k , t N k , ð 2 = diag r ˜ I , s ˜ I , l ˜ I , u ˜ I , t ˜ I , s ˜ = diag s , s , l ˜ = diag l , l , u ˜ = diag u , u , t ˜ = diag t , t , r ˜ = diag r , r , Π ¯ 1 , 1 = Q 1 + Q 2 κ 1 J 1 sym W C ¯ + X ˜ 1 G c 1 , Π ¯ 1 , 9 = X ˜ 2 , Π ¯ 1 , 9 = X ˜ 2 , Π ¯ 4 , 9 = μ ˜ X ˜ 2 , ¯ 1 = 0 Ω ¯ 1 , ¯ 2 = 0 Ω ¯ 2 , Ω ¯ 1 = Π ¯ 1 , 9 T 0 0 T , Ω ¯ 2 = 0 Π ¯ 4 , 9 T 0 0 T , Π ¯ 4 , 9 = μ ˜ X ˜ 2 , e j = 0 2 n × ( 2 j 2 ) n I 2 n 0 2 n × ( 9 2 j ) n , = e 1 + μ ˜ e 4 . Then, if the LMI (32) is feasible, the estimator gain K is calculated by K = W 1 X .
Proof. 
Algorithm 2 illustrates the calculation process of the developed estimator gain K . Then, define W = W 1 and W 2 = μ ˜ W ( μ ˜ > 0 ) , W is a non-singular matrix. W = diag W ¯ , W . Then, Equation (29) can be converted into
0 = E { 2 Ξ T ( t ) W [ D t α 0 C ν ( t ) + C ¯ ν ( t ) + A ¯ φ f ( t ) + γ ¯ B ˜ φ f ( t ϱ t ) + δ ¯ E ˜ t d ( t ) t φ f ( s ) d s K ¯ 2 χ ( C ¯ ν ( t ) ) + H ˜ d F ˜ d ( t ) N ˜ d ν ( t ) + H ˜ a F ˜ a ( t ) N ˜ a φ f ( t ) + H ˜ b F ˜ b ( t ) N ˜ b φ f ( t ϱ t ) + H ˜ e F ˜ e ( t ) N ˜ e t d ( t ) t φ f ( s ) d s K ¯ 1 Δ ˜ ι G c 2 + H ¯ k F ¯ k ( t ) N ¯ k G c 1 + H ¯ k F ¯ k ( t ) N ¯ k Δ ˜ ι G ¯ c 2 ν ( t ) H ¯ k F ¯ k ( t ) N k Δ ι + H ¯ k F ¯ k ( t ) N k χ ( C ¯ ν ( t ) ) ] } ,
in which Ξ ( t ) = ν ( t ) + μ ˜ D t α 0 C ν T ( t ) ,   C ¯ = C 0 K ( G 1 C C ) C K C ,   K ¯ 1 = 0 0 0 K G 1 C 2 ,   K ¯ 2 = 0 K ,   A ¯ = A 0 0 A ,   B ¯ = B 0 0 B ,   H ˜ c = H c 0 0 H c ,   H ˜ z = H z 0 0 H z ,   N ˜ c = N c 0 N c 0 ,   N ˜ a = N a 0 N a 0 ,   N ˜ b = γ ¯ N b 0 γ ¯ N b 0 ,   N ˜ e = δ ¯ N e 0 δ ¯ N e 0 ,   H ¯ k = 0 0 0 H k ,   N ¯ k = 0 0 0 N k ,   N k = 0 N k ,   F ˜ c ( t ) = diag F c ( t ) , F c ( t ) ,   F ˜ z ( t ) = diag F z ( t ) , F z ( t ) ,   F ¯ k ( t ) = diag F k ( t ) , F k ( t ) ,   G c 1 = 0 0 C G 1 C C ,   G c 2 = 0 0 G 1 C 0 .
Algorithm 2: Gain Matrix K
Step I: Supply the matrix parameters with appropriate dimensions for the system model (7) and (11).
Step II: Choose scalars ρ , d , ϵ
Step III: By using the Matlab LMI Toolbox, seek a feasible solution of the LMI (32) based on the given scalars and matrices. If the feasible solution is not obtained, return to Step I and II and reset the relevant parameters and matrices.
Step IV: Combining the feasible solution for the LMI (32) and the setting X = W K , obtain the estimator gain K
For arbitrary scalars r > 0 , the following inequalities hold:
2 T W [ H ˜ c F ˜ c ( t ) N ˜ c e 1 + H ˜ a F ˜ a ( t ) N ˜ a e 5 + H ˜ b F ˜ b ( t ) N ˜ b e 6 + H ˜ e F ˜ e ( t ) N ˜ e e 7 ]                                                                       = H ˜ F ˜ ( t ) N ˜ r 1 H ˜ H ˜ T + r N ˜ T N ˜
where F ˜ ( t ) = diag F ˜ c ( t ) , F ˜ a ( t ) , F ˜ b ( t ) , F ˜ e ( t ) , H ˜ = W H ˜ c W H ˜ a W H ˜ b W H ˜ e 0 2 n × n 0 2 n × n μ ˜ W H ˜ c μ ˜ W H ˜ a μ ˜ W H ˜ b μ ˜ W H ˜ e 0 5 n × n 0 5 n × n , N ˜ = N ˜ c 0 0 0 0 0 0 0 0 0 0 0 0 N ˜ a 0 0 0 0 0 0 0 0 0 N ˜ b 0 0 0 0 0 0 0 0 0 N ˜ e 0 0 .
Analogously, for arbitrary positive scalars u , s , t , l , one obtains
2 T W K ¯ 1 Δ ˜ ι G c 2 e 1 s 1 T W K ¯ 1 K ¯ 1 T W + ϵ 2 s e 1 T G c 2 T G c 2 e 1 ,
2 T W H ¯ k F ¯ k ( t ) N ¯ k Δ ˜ ι G c 2 e 1 l 1 T W H ¯ k H ¯ k T W + ϵ 2 l e 1 T G c 2 T N ¯ k T N ¯ k G c 2 e 1 , 2 T W [ H ¯ k F ¯ k ( t ) N ¯ k G c 1 e 1 + H ¯ k F ¯ k ( t ) N k G c 1 e 9 ] = H ¯ k F ¯ ( t ) N ¯ k
                                                        u 1 T H ¯ k H ¯ k T + u N ˜ k T N ˜ k ,
2 T W H ¯ k F ¯ k ( t ) N k Δ ι e 9 T t 1 T H ¯ k H ¯ k T + ϵ 2 e 9 T t N k T N k e 9 ,
where H ¯ k = H ¯ k T W , 0 , 0 , μ ˜ H ¯ k T W , 0 , 0 , 0 , 0 , 0 T , N ¯ k = N ¯ k G c 1 , 0 0 0 0 0 0 0 0 , N k .
Merging Equations (21)–(28) and (35)–(38), we have
Υ + ϱ L ˜ 1 O 1 L ˜ 1 T + ϱ 3 L ˜ 2 O 1 L ˜ 2 T + ϱ 5 L ˜ 3 O 1 L ˜ 3 T + r 1 H ˜ H ˜ + r N ˜ T N ˜ + s 1 T W K ¯ 1 K ¯ 1 T W + ϵ 2 s e 1 T G c 2 T G c 2 e 1 + l 1 T W H ¯ k H ¯ k T W + ϵ 2 l e 1 T G c 2 T N ¯ ¯ k T N ¯ ¯ k G c 2 e 1 + u 1 T H ¯ k H ¯ k T + u N ˜ k T N ˜ k + t 1 T W H ¯ k H ¯ k T W + ϵ 2 e 9 T t N ¯ k T N ¯ k e 9 < 0
where Υ = Ξ 1 Ξ 2 1 * Ξ 3 2 * * Ξ 4 , Ξ 1 = Π 1 , 1 0 0 Π 1 , 4 * Π 2 , 2 0 0 * * Π 3 , 3 0 * * * Π 4 , 4 , Ξ 2 = Π 1 , 5 Π 1 , 6 Π 1 , 7 0 Π 2 , 6 0 0 0 0 Π 4 , 5 Π 4 , 6 Π 4 , 7 , Π 4 , 4 = ϱ O 2 μ ˜ W , F ˜ c ( t ) = diag F c ( t ) , F c ( t ) , F ˜ z ( t ) = diag F z ( t ) , F z ( t ) , F ˜ z ( t ) = diag F z ( t ) , F z ( t ) , Π 1 , 2 = W K ¯ 1 , Π 1 , 9 = W K ¯ 2 , Π 1 , 1 = Q 1 + Q 2 κ 1 J 1 sym W C ¯ , Π 1 , 4 = P W + μ ˜ C ¯ T W , Π 1 , 5 = W A ¯ κ 1 J 1 , Π 1 , 6 = γ ¯ W B ¯ , Π 1 , 7 = δ ¯ W E ¯ , Π 4 , 4 = ϱ O 2 μ ˜ W , Π 4 , 5 = μ ˜ W A ¯ , Π 4 , 6 = μ ˜ γ ¯ W B ¯ , Π 4 , 7 = μ ˜ δ ¯ W E ¯ , Π 4 , 9 = μ ˜ W ¯ K ¯ , 1 = 0 Ω 1 , 2 = 0 Ω 2 , Ω 1 = Π 1 , 9 T 0 0 T , Ω 2 = 0 Π 4 , 9 T 0 0 T . Other terms Π 2 , 2 , Π 2 , 6 , Π 3 , 3 , Ξ 4 are mentioned in Theorem 1.
Denoting X = W K and combining the Schur complement, it can be inferred that (39) is satisfied if (32) holds. Then, the augmented system (18) is stochastically asymptotically stable.
When γ ( t ) = 1 and δ ( t ) = 1 , and quantitative processing is not taken into account, system (3) will transform into a common FOMNNs with mixed time-varying delays. Then, the estimator (11) will degenerate into a traditional fractional-order nonfragile estimator as follows:
D α ξ ^ ( t ) = C ξ ^ ( t ) + A f ( ξ ^ ( t ) ) + B f ( ξ ^ ( t ϱ t ) ) + E t d ( t ) t f ( s ) d s + ( K + Δ K ) ( ϑ s ( t ) ϑ ^ ( t ) ) , ϑ ^ ( t ) = C ξ ^ ( t ) ,
In this case, the following corollary is easily accessible from Theorem 2. □
Corollary 1.
For the given ϱ > 0 , d > 0 , system (18) is asymptotically stable if there are symmetric matrices P , Q 1 , Q 2 , O , R , any matrix W = diag W ˜ , W and ten scalars κ l > 0 ( l = 1 , 2 , 3 ) , u > 0 , r > 0 such that
˜ = Υ ˜ T W H ˜ k u N ˜ k H ˜ r N ˜ T * u I 0 0 0 * * u I 0 0 * * * r I 0 * * * * r I < 0 ,
where Υ ˜ = Υ ¯ ϱ L ˜ 1 ϱ L ˜ 2 ϱ L ˜ 3 * O 0 0 * * 3 O 0 * * * 5 O , Υ ¯ = Ξ ¯ 1 Ξ 2 ¯ 1 * Ξ 3 ¯ 2 * * Ξ 4 , Ξ ¯ 2 = Π 1 , 5 Π ¯ 1 , 6 Π ¯ 1 , 7 0 Π 2 , 6 0 0 0 0 Π 4 , 5 Π ¯ 4 , 6 Π ¯ 4 , 7 , Ξ ¯ 1 = Π ¯ 1 , 1 0 0 Π 1 , 4 * Π 2 , 2 0 0 * * Π 3 , 3 0 * * * Π 4 , 4 , W d = W ¯ C 0 X ( G 1 C C ) X C , N ˜ b = N b 0 N b 0 , N ˜ e = N e 0 N e 0 , Π ¯ 1 , 1 = Q 1 + Q 2 κ 1 J 1 W d T + W d , Π ¯ 4 , 6 = μ ˜ W B ¯ , Π ¯ 4 , 7 = μ ˜ W E ¯ , Π ¯ 1 , 6 = W B ¯ , Π ¯ 1 , 7 = W E ¯ . The rest are defined in Theorem 2. The estimator gain K can be calculated by K = W 1 X .
Remark 3.
So far, this paper addresses the issue of nonfragile SE for FOMNNs with randomly occurring time-varying delays. Different from the published results in [15,38], the derived result in this paper is less conservative, utilizing a novel Caputo–Wirtinger integral inequality. In addition, taking the switched property of d i ( ξ ( t ) ) , a i j ( ξ ( t ) ) , b i j ( ξ ( t ) ) , e i j ( ξ ( t ) ) into consideration, we employ the switching functions to reconstruct the FOMNNs (3) into an uncertain system, which strikes a balance between conservatism and complexity.

4. Examples and Simulations

Two numerical simulations are offered to illustrate the effectiveness of the proposed estimator algorithm.
Example 1.
Consider the following parameters of FOMNNs (3) as
a 11 ( ξ 1 ) = 0.5 , | ξ 1 | 1 , 0.6 , | ξ 1 | > 1 ,       a 12 ( ξ 1 ) = 1 , | ξ 1 | 1 , 0.5 , | ξ 1 | > 1 ,
a 21 ( ξ 2 ) = 0.5 , | ξ 2 | 1 , 0.7 , | ξ 2 | > 1 ,       a 22 ( ξ 2 ) = 0.22 , | ξ 2 | 1 , 0.5 , | ξ 2 | > 1 ,
b 11 ( ξ 1 ) = 0.6 , | ξ 1 | 1 , 0.5 , | ξ 1 | > 1 ,       b 12 ( ξ 1 ) = 0.5 , | ξ 1 | 1 , 0.25 , | ξ 1 | > 1 ,
b 21 ( ξ 2 ) = 0.5 , | ξ 2 | 1 , 0.7 , | ξ 2 | > 1 ,       b 22 ( ξ 2 ) = 0.22 , | ξ 2 | 1 , 0.5 , | ξ 2 | > 1 ,
e 11 ( ξ 1 ) = 0.3 , | ξ 1 | 1 , 0.4 , | ξ 1 | > 1 ,       e 12 ( ξ 1 ) = 0.5 , | ξ 1 | 1 , 0.13 , | ξ 1 | > 1 ,
e 21 ( ξ 2 ) = 0.2 , | ξ 2 | 1 , 1 , | ξ 2 | > 1 ,       e 22 ( ξ 2 ) = 0.7 , | ξ 2 | 1 , 0.3 , | ξ 2 | > 1 ,
c 11 ( ξ 1 ) = 0.1 , | ξ 1 | 1 , 0.3 , | ξ 1 | > 1 ,       c 22 ( ξ 2 ) = 0.4 , | ξ 2 | 1 , 0.2 , | ξ 2 | > 1 ,
C = 0.1 0.3 0.25 0.4 , H = diag 1 , 1 , N = 0.3 0.4 ; 0.4 0.3 . We choose the distribute delay d ( t ) = 0.05 + 0.3 | c o s ( t ) | with d = 0.35 .
Assume that the occurring probability of the time-varying delays ϱ ( t ) , d ( t ) satisfy γ ¯ = E γ ( t ) = 0.7 , δ ¯ = E δ ( t ) = 0.9 . Set the activation function as
f ( ξ ( t ) ) = 0.4 ξ 1 ( t ) + tanh ( 0.2 ξ 1 ( t ) ) + 0.3 ξ 2 ( t ) 0.2 ξ 2 ( t ) + tanh ( 0.3 ξ 2 ( t ) ) ,
then,
F 1 = 0.4 0.3 0 0.2 , F 2 = 0.2 0.3 0 0.1
By employing the Matlab LMI Toolbox for the resolution of the LMIs (32), the following feasible solutions can be obtained:
W = 0.0374 0.0037 0.0037 0.0332 , K = 0.0688 0.2333 0.2146 0.2782 ,
and κ 1 = 1.1590 , κ 2 = 0.6043 , κ 3 = 0.2919 , r = 0.2031 , s = 0.3796 , u = 0.3448 , t = 0.3348 .
In this simulation, the fractional-order estimation system subject to sensor saturation is considered. According to the above parameters, all the simulation results with various orders are present in Figure 1, Figure 2 and Figure 3. Figure 1 and Figure 2 illustrate the state and corresponding estimates of neurons ξ 1 ( t ) , ξ 2 ( t ) , respectively. Figure 3 shows the errors with different orders ( α = 0.8 , 0.9 , 0.99 ) between ξ i ( t ) and ξ ^ i ( t ) . Therefore, the validity of the proposed theoretical results is verified in this numerical simulation.
Example 2.
In what follows, the following delayed FOMNNs model subject to sensor saturations is considered:
D α ξ ( t ) = C ( t ) ξ ( t ) + A ( t ) g ( ξ ( t ) ) + B ( t ) f ( ξ ( t ϱ ( t ) ) ) ,
In this example, the following parameters are chosen:
a 11 ( ξ 1 ) = 1.5 , | ξ 1 | 1 , 1 , | ξ 1 | > 1 ,       a 12 ( ξ 1 ) = 0.2 , | ξ 1 | 1 , 0.6 , | ξ 1 | > 1 ,
a 21 ( ξ 2 ) = 0.3 , | ξ 2 | 1 , 0.1 , | ξ 2 | > 1 ,       a 22 ( ξ 2 ) = 0.2 , | ξ 2 | 1 , 0.6 , | ξ 2 | > 1 ,
b 11 ( ξ 1 ) = 1 , | ξ 1 | 1 , 0.5 , | ξ 1 | > 1 ,       b 12 ( ξ 1 ) = 0.35 , | ξ 1 | 1 , 0.65 , | ξ 1 | > 1 ,
b 21 ( ξ 2 ) = 0.3 , | ξ 2 | 1 , 0.5 , | ξ 2 | > 1 ,       b 22 ( ξ 2 ) = 0.5 , | ξ 2 | 1 , 0.75 , | ξ 2 | > 1 ,
c 11 ( ξ 1 ) = 1.5 , | ξ 1 | 1 , 1.3 , | ξ 1 | > 1 ,       c 22 ( ξ 2 ) = 1.62 , | ξ 2 | 1 , 1.2 , | ξ 2 | > 1 ,
H = 1 1 ; 1 1 , N = 0.2 0.2 ; 0.2 0.2 , G 1 = diag 0.7 , 0.85 , G = diag 0.4 , 0.5 .
By means of the Matlab Tool to solve the inequalities (32), we have the following feasible solutions:
W 2 = 2.9114 3.2613 3.2613 8.9590 , K = 0.7373 0.4956 0.3563 1.6337 ,
and κ 1 = 0.201 , κ 2 = 0.1576 , κ 3 = 0.3506 , u = 0.13 , r = 0.3513 .
In this simulation, Figure 4, Figure 5 and Figure 6 show all the simulation results with different orders. Under sensor saturation, Figure 6 depicts the estimation error with mixed time-varying delays. Figure 4 and Figure 5 show the trajectories of neurons ξ 1 ( t ) , ξ 2 ( t ) and the corresponding estimation, respectively. Under the different orders ( α = 0.8 , 0.9 , 0.99 , 1 ), it is clear that the estimation errors converge to zeros finally, which verifies the effectiveness of the designed estimator scheme. In addition, from Table 1, the maximal allowable delay ϱ max and the number of decision variables (NDVs) can be obtained. This indicates that the allowable upper bound is superior to the previous methods. In this paper, we introduce double integrals and triple integrals, which require more decision variables than the methods discussed in [38]. The method proposed in this paper is less conservative.

5. Conclusions

This paper investigates the nonfragile SE for FOMNNs with ROTDs subject to sensor saturation. Considering the load on network bandwidth, a logarithmic quantizer is introduced to design the fraction-order estimator. Based on a novel Caputo–Wirtinger integral inequalities, a lower conversation criterion is established to guarantee the augmented system is stochastically asymptotically stable. In the end, two numerical simulations are shown to illustrate the validity of the proposed estimation scheme. Furthermore, it is possible to apply the proposed method and scheme to fractional-order uncertain systems or complex-valued neural networks with an event-triggered scheme [52,53,54].

Author Contributions

Conceptualization, Y.L. and J.Z.; Methodology, X.S.; Software, X.S., J.Z., M.L. and Y.Y.; Investigation, X.S. and Y.Y.; Writing—original draft, X.S.; Writing—review & editing, Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Notation

X T the transpose of matrix X
I / 0 the identity/zero matrix with appropriate order
R n n-dimensional Euclidean space
ν the Euclidean norm in R n
E mathematical expectation operator
*the symmetric term
z a , b , e

References

  1. Oldham, K.; Spanier, J. The Fractional Calculus Theory and Applications of Differentiation and Integration to Arbitrary Order; Elsevier: Amsterdam, The Netherlands, 1974. [Google Scholar]
  2. Alarifi, N.M.; Ibrahim, R.W. Specific Classes of Analytic Functions Communicated with a Q-Differential Operator Including a Generalized Hypergeometic Function. Fractal Fract. 2022, 6, 545. [Google Scholar] [CrossRef]
  3. Hilfer, R. Applications of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  4. El-Nabulsi, R.A.; Torres, D.F. Fractional actionlike variational problems. J. Math. Phys. 2008, 49, 053521. [Google Scholar] [CrossRef]
  5. Podlubny, I. Fractional-order systems and PI/sup/spl lambda//D/sup/spl mu//-controllers. IEEE Trans. Autom. Control 1999, 44, 208–214. [Google Scholar] [CrossRef]
  6. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; Wiley: Hoboken, NJ, USA, 1993. [Google Scholar]
  7. Cheng, Y.; Xu, W.; Jia, H.; Zhong, S. Stability analysis of fractional-order neural networks with time-varying delay utilizing free-matrix-based integral inequalities. J. Frankl. Inst. 2023, 360, 10815–10835. [Google Scholar] [CrossRef]
  8. Li, H.l.; Jiang, H.; Cao, J. Global synchronization of fractional-order quaternion-valued neural networks with leakage and discrete delays. Neurocomputing 2019, 385, 211–219. [Google Scholar] [CrossRef]
  9. Parvizian, M.; Khandani, K.; Majd, V.J. An H non-fragile observer-based adaptive sliding mode controller design for uncertain fractional-order nonlinear systems with time delay and input nonlinearity. Asian J. Control 2021, 23, 423–431. [Google Scholar] [CrossRef]
  10. Chen, L.; Li, T.; Wu, R.; Chen, Y.; Liu, Z. Non-fragile control for a class of fractional-order uncertain linear systems with time-delay. IET Control Theory Appl. 2020, 14, 1575–1589. [Google Scholar] [CrossRef]
  11. Qiu, H.; Shen, J.; Cao, J.; Liu, H. L-Gain of Fractional-Order Positive Systems with Mixed Time-Varying Delays. IEEE Trans. Circuits Syst. Regul. Pap. 2024, 71, 828–837. [Google Scholar] [CrossRef]
  12. Nassajian, G.; Balochian, S. Multi-model estimation using neural network and fault detection in unknown time continuous fractional order nonlinear systems. Trans. Inst. Meas. Control 2021, 43, 497–509. [Google Scholar] [CrossRef]
  13. Tong, P.; Xu, H.; Sun, Y.; Wang, Y.; Peng, J.; Liao, C.; Wang, W.; Li, Q. Lightweight and highly robust memristor-based hybrid neural networks for electroencephalogram signal processing. Chin. Phys. B 2023, 32, 078505. [Google Scholar] [CrossRef]
  14. Zhang, X.; Jiang, D.; Nkapkop, J.D.D.; Njitacke, Z.T.; Ahmad, M.; Zhu, L.; Tsafack, N. A memristive autapse-synapse neural network: Application to image encryption. Phys. Scr. 2023, 98, 035222. [Google Scholar] [CrossRef]
  15. Li, J.; Dong, H.; Wang, Z.; Bu, X. Partial-Neurons-Based Passivity-Guaranteed State Estimation for Neural Networks with Randomly Occurring Time Delays. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 3747–3753. [Google Scholar] [CrossRef]
  16. Xiao, J.; Li, Y.; Zhong, S.; Xu, F. Extended dissipative state estimation for memristive neural networks with time-varying delay. ISA Trans. 2016, 64, 113–128. [Google Scholar] [CrossRef]
  17. Nagamani, G.; Karnan, A.; Soundararajan, G. Delay-Dependent and Independent State Estimation for BAM Cellular Neural Networks with Multi-Proportional Delays. Circuits Syst. Signal Process. 2021, 40, 3179–3203. [Google Scholar] [CrossRef]
  18. Tan, Y.; Xiong, M.; Zhang, B.; Fei, S. Adaptive Event-Triggered Nonfragile State Estimation for Fractional-Order Complex Networked Systems with Cyber Attacks. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 2121–2133. [Google Scholar] [CrossRef]
  19. Li, Q.; Wang, Z.; Sheng, W.; Alsaadi, F.E.; Alsaadi, F.E. Dynamic event-triggered mechanism for H non-fragile state estimation of complex networks under randomly occurring sensor saturations. Inf. Sci. 2020, 509, 304–316. [Google Scholar] [CrossRef]
  20. Chua, L. Memristor-the missing circuit element. IEEE Trans. Circuit Theory 1971, 18, 507–519. [Google Scholar] [CrossRef]
  21. Strukov, D.B.; Snider, G.S.; Stewart, D.R.; Williams, R.S. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef]
  22. Guo, T.; Sun, B.; Ranjan, S.; Jiao, Y.; Wei, L.; Zhou, Y.N.; Wu, Y.A. From Memristive Materials to Neural Networks. ACS Appl. Mater. Interfaces 2020, 12, 54243–54265. [Google Scholar] [CrossRef]
  23. Tsafack, N.; Iliyasu, A.M.; De Dieu, N.J.; Zeric, N.T.; Kengne, J.; Abd-El-Atty, B.; Belazi, A.; Abd EL-Latif, A.A. A memristive RLC oscillator dynamics applied to image encryption. J. Inf. Secur. Appl. 2021, 61, 102944. [Google Scholar] [CrossRef]
  24. Duan, S.; Hu, X.; Dong, Z.; Wang, L.; Mazumder, P. Memristor-Based Cellular Nonlinear/Neural Network: Design, Analysis, and Applications. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1202–1213. [Google Scholar] [CrossRef]
  25. Popa, C.A. Mittag-Leffler stability and synchronization of neutral-type fractional-order neural networks with leakage delay and mixed delays. J. Frankl. Inst. 2023, 360, 327–355. [Google Scholar] [CrossRef]
  26. Jia, J.; Wang, F.; Zeng, Z. Global stabilization of fractional-order memristor-based neural networks with incommensurate orders and multiple time-varying delays: A positive-system-based approach. Nonlinear Dyn. 2021, 104, 2303–2329. [Google Scholar] [CrossRef]
  27. Hong, D.T.; Sau, N.H.; Thuan, M.V. New Criteria for Dissipativity Analysis of Fractional-Order Static Neural Networks. Circuits Syst. Signal Process. 2022, 41, 2221–2243. [Google Scholar] [CrossRef]
  28. Bao, H.; Cao, J.; Kurths, J. State estimation of fractional-order delayed memristive neural networks. Nonlinear Dyn. 2018, 94, 1215–1225. [Google Scholar] [CrossRef]
  29. Nagamani, G.; Shafiya, M.; Soundararajan, G. An LMI based state estimation for fractional-order memristive neural networks with leakage and time delays. Neural Process. Lett. 2020, 52, 2089–2108. [Google Scholar] [CrossRef]
  30. Li, R.; Gao, X.; Cao, J. Quasi-state estimation and quasi-synchronization control of quaternion-valued fractional-order fuzzy memristive neural networks: Vector ordering approach. Appl. Math. Comput. 2019, 362, 124572. [Google Scholar] [CrossRef]
  31. Dorato, P. Non-fragile controller design: An overview. In Proceedings of the 1998 American Control Conference, ACC 1998, Philadelphia, PA, USA, 24–26 June 1998; Volume 5, pp. 2829–2831. [Google Scholar]
  32. Zha, L.; Fang, J.-A.; Liu, J.; Tian, E. Event-triggered non-fragile state estimation for delayed neural networks with randomly occurring sensor nonlinearity. Neurocomputing 2018, 273, 1–8. [Google Scholar] [CrossRef]
  33. Shao, X.; Lyu, M.; Zhang, J. Nonfragile estimator design for fractional-order neural networks under event-triggered mechanism. Discret. Dyn. Nat. Soc. 2021, 2021, 6695353. [Google Scholar] [CrossRef]
  34. Bao, H.; Park, J.H.; Cao, J. Non-fragile state estimation for fractional-order delayed memristive BAM neural networks. Neural Netw. 2019, 119, 190–199. [Google Scholar] [CrossRef]
  35. Liu, J.; Xia, J.; Cao, J.; Tian, E. Quantized state estimation for neural networks with cyber attacks and hybrid triggered communication scheme. Neurocomputing 2018, 291, 35–49. [Google Scholar] [CrossRef]
  36. Zhang, H.; Ye, R.; Liu, S.; Cao, J.; Alsaedi, A.; Li, X. LMI-based approach to stability analysis for fractional-order neural networks with discrete and distributed delays. Int. J. Syst. Sci. 2018, 49, 537–545. [Google Scholar] [CrossRef]
  37. Shao, X.G.; Zhang, J.; Lu, Y.J. Event-based nonfragile state estimation for memristive recurrent neural networks with stochastic cyber-attacks and sensor saturations. Chin. Phys. B 2024. [Google Scholar] [CrossRef]
  38. Chen, S.; Song, Q.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Global asymptotic stability of fractional-order complex-valued neural networks with probabilistic time-varying delays. Neurocomputing 2021, 450, 311–318. [Google Scholar] [CrossRef]
  39. Ali, M.S.; Hymavathi, M.; Saroha, S.; Moorthy, R.K. Global asymptotic stability of neutral type fractional-order memristor-based neural networks with leakage term, discrete and distributed delays. Math. Methods Appl. Sci. 2021, 44, 5953–5973. [Google Scholar]
  40. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Elsevier: Amsterdam, The Netherlands, 1998. [Google Scholar]
  41. Aubin, J.P.; Frankowska, H. Set-Valued Analysis; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  42. Zhang, R.; Zeng, D.; Zhong, S.; Yu, Y. Event-triggered sampling control for stability and stabilization of memristive neural networks with communication delays. Appl. Math. Comput. 2017, 310, 57–74. [Google Scholar] [CrossRef]
  43. Cheng, J.; Liang, L.; Park, J.H.; Yan, H.; Li, K. A Dynamic Event-Triggered Approach to State Estimation for Switched Memristive Neural Networks with Nonhomogeneous Sojourn Probabilities. IEEE Trans. Circuits Syst. Regul. Pap. 2021, 68, 4924–4934. [Google Scholar] [CrossRef]
  44. Guo, M.; Zhu, S.; Liu, X. Observer-based state estimation for memristive neural networks with time-varying delay. Knowl.-Based Syst. 2022, 246, 108707. [Google Scholar]
  45. Wang, Z.; Ding, S.; Huang, Z.; Zhang, H. Exponential Stability and Stabilization of Delayed Memristive Neural Networks Based on Quadratic Convex Combination Method. IEEE Trans. Neural Netw. Learn. Syst. 2016, 27, 2337–2350. [Google Scholar] [CrossRef]
  46. Geng, H.; Wang, Z.; Hu, J.; Alsaadi, F.E.; Cheng, Y. Outlier-resistant sequential filtering fusion for cyber-physical systems with quantized measurements under denial-of-service attacks. Inf. Sci. 2023, 628, 488–503. [Google Scholar] [CrossRef]
  47. Fu, M.; Xie, L. The sector bound approach to quantized feedback control. IEEE Trans. Autom. Control 2005, 50, 1698–1711. [Google Scholar]
  48. Cao, Y.Y.; Lin, Z.; Chen, B.M. An output feedback/spl Hscr//sub/spl infin//controller design for linear systems subject to sensor nonlinearities. IEEE Trans. Circuits Syst. Fundam. Theory Appl. 2003, 50, 914–921. [Google Scholar]
  49. Zhang, S.; Yu, Y.; Yu, J. LMI conditions for global stability of fractional-order neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2016, 28, 2423–2433. [Google Scholar] [CrossRef]
  50. Yang, X.; Wu, X.; Song, Q. Caputo–Wirtinger integral inequality and its application to stability analysis of fractional-order systems with mixed time-varying delays. Appl. Math. Comput. 2024, 460, 128303. [Google Scholar] [CrossRef]
  51. Gu, K.; Chen, J.; Kharitonov, V.L. Stability of Time-Delay Systems; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  52. Jiang, Z.; Huang, F.; Shao, H.; Cai, S.; Lu, X.; Jiang, S. Time-varying finite-time synchronization analysis of attack-induced uncertain neural networks. Chaos Solitons Fractals 2023, 175, 113954. [Google Scholar] [CrossRef]
  53. Xu, B.; Li, B. Dynamic Event-Triggered Consensus for Fractional-Order Multi-Agent Systems without Intergroup Balance Condition. Fractal Fract. 2023, 7, 268. [Google Scholar] [CrossRef]
  54. Hymavathi, M.; Muhiuddin, G.; Syed Ali, M.; Al-Amri, J.F.; Gunasekaran, N.; Vadivel, R. Global Exponential Stability of Fractional Order Complex-Valued Neural Networks with Leakage Delay and Mixed Time Varying Delays. Fractal Fract. 2022, 6, 140. [Google Scholar] [CrossRef]
Figure 1. Responses of ξ i ( t ) and ξ ^ i ( t ) with α = 0.8 , 0.9 , 0.99 .
Figure 1. Responses of ξ i ( t ) and ξ ^ i ( t ) with α = 0.8 , 0.9 , 0.99 .
Fractalfract 08 00343 g001
Figure 2. Responses of ξ i ( t ) and ξ ^ i ( t ) with α = 0.8 , 0.9 , 0.99 .
Figure 2. Responses of ξ i ( t ) and ξ ^ i ( t ) with α = 0.8 , 0.9 , 0.99 .
Fractalfract 08 00343 g002
Figure 3. Estimation errors e i ( t ) under sensor saturation.
Figure 3. Estimation errors e i ( t ) under sensor saturation.
Fractalfract 08 00343 g003
Figure 4. Trajectories of ξ 1 ( t ) and ξ ^ 1 ( t ) with α = 0.8 , 0.9 , 0.99 , 1 .
Figure 4. Trajectories of ξ 1 ( t ) and ξ ^ 1 ( t ) with α = 0.8 , 0.9 , 0.99 , 1 .
Fractalfract 08 00343 g004
Figure 5. Trajectories of ξ 2 ( t ) and ξ ^ 2 ( t ) with α = 0.8 , 0.9 , 0.99 , 1 .
Figure 5. Trajectories of ξ 2 ( t ) and ξ ^ 2 ( t ) with α = 0.8 , 0.9 , 0.99 , 1 .
Fractalfract 08 00343 g005
Figure 6. The estimation errors e i ( t ) under sensor saturation.
Figure 6. The estimation errors e i ( t ) under sensor saturation.
Fractalfract 08 00343 g006
Table 1. Maximal allowable delay ϱ max with different ϱ ¯ ( α = 0.9 ) .
Table 1. Maximal allowable delay ϱ max with different ϱ ¯ ( α = 0.9 ) .
Method ϱ ¯ = 0.2 ϱ ¯ = 0.5 ϱ ¯ = 0.8 NDVs
[10]3.18022.85912.193476
[38]6.5416.06844.9716132
Theorem 16.71685.97545.0197188
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

Shao, X.; Lu, Y.; Zhang, J.; Lyu, M.; Yang, Y. Quantized Nonfragile State Estimation of Memristor-Based Fractional-Order Neural Networks with Hybrid Time Delays Subject to Sensor Saturations. Fractal Fract. 2024, 8, 343. https://doi.org/10.3390/fractalfract8060343

AMA Style

Shao X, Lu Y, Zhang J, Lyu M, Yang Y. Quantized Nonfragile State Estimation of Memristor-Based Fractional-Order Neural Networks with Hybrid Time Delays Subject to Sensor Saturations. Fractal and Fractional. 2024; 8(6):343. https://doi.org/10.3390/fractalfract8060343

Chicago/Turabian Style

Shao, Xiaoguang, Yanjuan Lu, Jie Zhang, Ming Lyu, and Yu Yang. 2024. "Quantized Nonfragile State Estimation of Memristor-Based Fractional-Order Neural Networks with Hybrid Time Delays Subject to Sensor Saturations" Fractal and Fractional 8, no. 6: 343. https://doi.org/10.3390/fractalfract8060343

Article Metrics

Back to TopTop