1. Introduction
Fractional derivatives are widely studied and applied, and there are various types of fractional derivatives with different properties. The main common property of fractional derivatives is connected with the memory, which differs from integer order derivatives. These types of derivatives are not only studied theoretically but are also applied in modeling; for example, they are used in the modeling of neural networks. One of the hot research topics in complex systems is synchronization (see, for example, [
1,
2]). When fractional derivatives are applied, the most appropriate type is Mittag–Leffler synchronization (MLS). We mention MLS [
3] for impulsive fractional-order neural networks with delays, Ref. [
4] for delayed fractional-order bidirectional associative memory neural networks, Ref. [
5] for variable-order fractional reaction-diffusion networks, Ref. [
6] for fractional neural networks with time-varying delays and reaction-diffusion terms, Ref. [
7] for MLS of fractional-order complex-valued memristive neural networks with time delay, Ref. [
8] for MLS of fractional neural networks with distributed delays, Ref. [
9] for fractional BAM neural networks with linear feedback controllers, Ref. [
10] for delayed fractional memristive neural networks.
One of the most useful models is the Cohen–Grossberg model of neural networks (CGM), which is studied in various forms when modeling the dynamics of neurons. The main difference between the Cohen–Grossberg neural network model (CGM) [
11] and other neural network models lies in the system of equations that describes neuronal dynamics. In CGN, the state is multiplied by a gain function, allowing modeling of biological neural saturation. Also, CGM is a generalization of some known models in the literature, such as the Hopfield neural network [
12]. Recently, many different generalizations of CGM have been presented, and their properties have been studied. For example, in [
13] MLS of fractional memristive CGM with state feedback and impulsive control is studied, and in [
14] a coupled delayed fractional reaction-diffusion (CGM) is investigated.
In this paper, we study the synchronization of a special model of Cohen–Grossberg neural network with a variable delay (CGNND). First, for modeling the dynamics of the neurons, we use a generalization of the fractional derivative, the so-called Caputo fractional derivative with respect to another function (studied theoretically in [
15] and applied to CGNND in [
16]) and its generalization introduced in [
17]. Second, we consider the case where a switching rule changes at certain times in the activation functions and in some of the applied coefficients (see, for example, [
18]). Note that synchronization of some types of switched fractional models is studied in [
19,
20]. In this paper, we consider a piecewise-constant switching rule with an initially specified set of CGNND and switching times. We present an algorithm for constructing a solution to the switched CGNND, define Mittag–Leffler synchronization for the model under study, and obtain sufficient conditions. The obtained results generalize several known results in the literature.
The main contributions of this paper could be summarized as follows:
- -
A generalization of the classical Cohen–Grossberg neural network model is considered in the case when
- -
there is a delay;
- -
the dynamic of the neurons is described by a Caputo fractional derivative with respect to another function;
- -
there is a switching rule which allows us to describe adequately the change of the dynamics of neurons at some initially given points;
- -
Switching times in the model could be finite or infinite;
- -
Short memories are considered, i.e., the lower limits of the applied fractional derivative are changing at any switching time;
- -
Mittag–Leffler synchronization of the model is studied, and some sufficient conditions are obtained.
- -
the basis of the study are quadratic Lyapunov functions and the Razumikhin method.
2. Preliminary Notes on Generalized Caputo Fractional Derivatives with Respect to Another Function
We will present results from the literature on the main definitions and on applied fractional derivatives.
Let
. We will use the following sets of functions:
and
Definition 1 ([
17])).
Let and the function . The generalized fractional integral with respect to another function (FIF) of the function is defined by (where the integral exists) Definition 2 ([
17]).
Let and the function . The generalized Caputo fractional derivative with respect to another function (GCFDF) of the function is defined by (where the integral exists) In the case of vector functions the integral FIF and the derivative GCFDF are defined component-wise.
In connection with Definition 2 we will introduce the following set of functions:
We will use the following results for GCFDF.
Lemma 1. Let . Thenwhere . Proof. Define the function
for
. Then
and
where
and
. □
From Lemma 1, we obtain the following result:
Corollary 1. Let and be a constant. Thenwhere is the Mittag–Leffler function with one parameter. Proof. We note that
Take the GCFDF on both sides of (3), use Lemma 1 for
, and obtain
□
From Corollary 1, we have the following result:
Lemma 2. Let and be a constant. The solution of the scalar linear fractional initial value problem with GCFDFis the function Lemma 3 ([
18]).
Let , , and there exists a point such that , and , for and the GCFDF exists. Then if we have . Remark 1 ([
18]).
In Lemma 3 if then L’Hopital’s rule guarantees thatNote that from and it follows that .We could also put other conditions (other than ), for example, instead one could assume exists and is a real number) to guarantee that this limit is zero.
We will prove some new results for scalar functions and their GCFDF, which will be applied in the proofs of the main results in the next sections. Also, they are of value any time GCFDF is studied.
Lemma 4. Let be such that . Thenwhere . Proof. For any fixed
we define the function
by
Note that , and , so v satisfies the assumptions of Lemma 3, and, therefore, .
□
In the case of non-negative scalar functions we have the following result:
Lemma 5. Assume the following:
- 1.
The function with .
- 2.
The function and for any such thatthe inequalityholds with .
Proof. Let
be an arbitrary number. We define
According to Condition 1 the function
and
Since , we get
We claim
Assume that (12) is not true on
, i.e., there exists a point
such that
Note that the function
satisfies the assumptions of Lemma 3 with
and
. According to Lemma 3, Remark 1 and the choice of the point
, we have
We need to consider the following two cases:
- Case 1.
Let
. Then for all
we have
and from
and (13) we have
and
Inequality (15) proves the Razumikhin-type condition (8) is satisfied for .
- Case 2.
Let . Then for any there are two possibilities: or .
If
similar to Case 1 and (15), we have
If
then applying
, we get
Therefore, the inequality (8) (the Razumikhin-type condition) holds for in this case.
Therefore,
. Then, applying (11) and Corollary 1, we get
Now (17) contradicts (14), proving (12). Since (12) is satisfied for an arbitrary
after taking the limit as
, we get
which implies (10). □
Remark 2. Condition 2 of Lemma 5 is a Razumikhin condition. Note, inequality (9) is not satisfied for all points but only for those satisfying the inequality (8). This is very important in the application of Lyapunov functions to study stability properties of any system with delays.
Denote .
Corollary 2. Assume the following:
- 1.
The function and where , , .
- 2.
The function is such that for any for whichthe inequalityholds.
Proof. Define the function for .
Then .
Let a point
be such that the inequality (18) holds (the Razumikhin-type condition), i.e.,
. According to inequality (19), we get
From Lemma 5 with it follows that for , i.e., inequality (20) holds. □
3. Description of the Switched Fractional Cohen–Grossberg Neural Networks Models
Let be a given number/infinity and and where m is the number of subsystems, and N is the number of neurons in the network.
Let the switching times be given such that and if then .
The switching rule (sometimes called a switching signal) for where are given constants.
Remark 3. If then the switching point .
Remark 4. The switching rule is discontinuous at points , and it is activated at time , when the -th subsystem is activated. Also, the applied fractional derivative changes its lower limit at the switching times .
Note that the presence of a switching rule in a system can significantly change the behavior of the state variable. We will illustrate the behavior of both the switching rule and the applied fractional derivative on a simple scalar example.
Example 1. Consider the Mittag–Leffler function , which is deeply connected with the solutions of linear fractional differential equations with GCFDF.
Let , and . The value of does not change significantly the behavior of . However the type of the function has a huge influence (see Figure 1 and Figure 2 with and , respectively). Consider the Mittag–Leffler function with , and . If the function , then the function approaches zero for any value of ρ (see Figure 3). If the function then the function decreases, but it does not approach zero (for example, if then , see Figure 4). Now consider the linear scalar fractional differential equation with GCFDF (5) with , . According to Lemma 2 its solution is The solutions are increasing functions (see Figure 1 and Figure 2) but in the case the solutions are approaching ∞. In the case , the solution is an increasing bounded function. Therefore, the applied function ψ in the fractional derivative has a huge influence on the behavior of the solutions. Consider (5) with . According to Lemma 2 its solution is The solutions are decreasing functions (see Figure 1 and Figure 2) but in the case the solutions are approaching 0. In the case , the solution is a decreasing function but not approaching 0. Now consider a switched linear scalar fractional differential equation with GCFDF. Let and the subsystems are defined by (5) with , and various where k is the number of the subsystem.
Let the switching times be , and the switching rule is .
Then the switching system will beConsider the function . The solution of the switched Equation (21) is given in Figure 5. It is seen that since the initial equation, defined by the first subsystem with is unstable, i.e., approaches infinity (see Figure 1), because of the switching rule, the solution could approach zero (see Figure 5). Consider the function . The solution of the switched Equation (21) is given in Figure 6. It is seen that since the initial equation, defined by the first subsystem with , is increasing bounded (see Figure 2), because of the switching rule, the solution could be decreasing (see Figure 6). Therefore, the above examples show that both the switching rule and the applied function in the fractional derivative can significantly change the behavior of the solution. It allows us to use the appropriate function ψ for the fractional derivative and the appropriate switching rule to adequately model the real situation studied in the neural network.
Remark 5. Note the classical Caputo derivative is a special case of GCFDF with whose behavior is similar to the function , considered in Example 1, and the behavior of the solutions when the classical Caputo derivative is applied is similar to the case of and Figure 1, Figure 3 and Figure 5. Now we will set up the switched studied model, and we will explain in detail its solution.
Consider the initial value problem (IVP) for the delay switched fractional Cohen–Grossberg neural network models with GCFDF (DSCDM):
where
denotes the variable neuron’s state at time
t;
is the amplification function of the
i-th neuron;
is a well-behaved function;
are the activation functions of the
j-th neuron;
are neural connection memristive weights,
is the number of the neural connection memristive weights and the activation functions acting on the interval
;
is the initial function;
is the external input;
is the delay.
Remark 6. If then the last interval in DSCDM (22) is changed to .
Remark 7. If at a point the equality holds, then the switching rule is not activated at the point , and the system is not changed, i.e., we have to ignore the point in DSCDM (22). By relabeling the points , we could obtain the case when for all and the switching rule is activated at all points
According to Remark 7, without loss of generality, we assume that for all .
In this paper, we will use the following assumption:
- (A).
For any
and any initial function
, the delay fractional Cohen–Grossberg neural networks model (DCDM)
has a solution
.
We will give a detailed description of the DSCDM (22), assuming condition (A) holds.
Let
. Since
, the DSCDM (22) reduces to the following DCDM
According to assumption (A) with and for DCDM (23) has a solution .
At time
, the switching rule
is activated and the system of equations is changed, i.e., since
on
, the DSCDM (22) is reduced to the following DCDM
According to assumption (A) with
and
for
DCDM (24) has a solution
.
From the second equation of (24), i.e., , it follows that . Therefore, the solution of DSCDM (22) is continuous at .
At time
, the switching rule
is activated, and the system of equations is changed, i.e., DSCDM (22) is reduced to the following DCDM
According to assumption (A) with
and
for
DCDM (25) has a solution
.
From the second equation of (25), i.e., , it follows that . Therefore, the solution of DSCDM (22) is continuous at .
Continue this process for any we obtain the solution of DSCDM (22)
Remark 8. The equalities show that . Therefore, the solution of DSCDM (22) is continuous at any switching time . Also, for any the equality holds for .
We consider the DSCDM (22) as a driven system and the following system as a response system (RDSCDM)
where
is the input continuous control on the interval
.
Let
and
be solutions of (22) and (28), respectively. Define the synchronization error
and the control gains
where
are constants.
We now introduce the following assumptions, which we will need in Theorem 1.
- (H1).
The functions and there exist positive numbers such that and for .
- (H2).
There exist positive constants
such that the amplification function satisfy the following:
- (H3).
For well behaved functions
and amplification functions
there exist positive constants
, such that
- (H4).
All activation functions
, are bounded, i.e., there exist constants
such that
and are Lipschitzian with constants
, i.e.,
- (H5)
Any solutions of DSFDE (22) and RDSFDE (28), respectively, are such that with .
Remark 9. Assumption (H1) guarantees the boundedness of the time variable coefficients of the activation functions, which is a natural restriction, and it does not allow the activation of neurons to be too big. Assumption (H2) concerns the amplification function, its positiveness, and the Lipschitz property (compare with [11]). Assumption (H3) is a standard assumption about well-behaved functions and amplification functions. Assumption (H4) concerns the activation functions. We consider the case of continuous, bounded, and Lipschitz activation functions. The strongest condition is (H5), which is connected with the application of the quadratic Lyapunov function. In most papers applying a quadratic Lyapunov function to study neural network models, this condition is missing, but not all solutions are quadratically differentiable, especially when a fractional derivative is used. 5. Example
Let .
Let the switching time be , , i.e., three Cohen–Grossberg neural network models with different neural-connection memristive weights and different activation functions are given. The switching rule for , will switch at initially given times between these three different models to describe the situation more adequately. Let , i.e., four neurons are in the network. Let and .
Let the delay
and the activation functions be
and
where
Therefore,
,
and
Let
.
Let and the functions .
Let , with , and . Then .
Case 1. Let be the function in the applied GCFDF.
Let the control gain be with .
Thus, the inequalities (35) are reduced to
with
.
Therefore, the conditions of Theorem 1 are satisfied and then the driven system (22) and its corresponding response system (28) in this special case are globally Mittag–Leffler synchronized under the defined above control, i.e., the inequality
holds where
is a solution of the driven system (22) and
is a solution of the corresponding response system (28).
The graph of the estimate (42) of
with
is given in
Figure 7.
Case 2. Let be the function in the applied GCFDF.
Then, similar to Case 1, the conditions of Theorem 1 are satisfied and then the driven system (22) and its corresponding response system (28) in this special case are globally Mittag–Leffler synchronized under the defined above control, i.e., the inequality
holds where
is a solution of the driven system (22) and
is a solution of the corresponding response system (28).
The graph of the estimate (43) of
with
is given in
Figure 8.