Fixed/Preassigned-time synchronization of quaternion-valued neural networks via pure power-law control

Aperiodically intermittent quantized control-based exponential synchronization of quaternion-valued inertial neural networks

Inertial neural networks are proposed via introducing an inertia term into the Hopfield models, which make their dynamic behavior more complex compared to the traditional first-order models. Besides, the aperiodically intermittent quantized control over conventional feedback control has its potential advantages on reducing communication blocking and saving control cost. Based on these facts, we are mainly devoted to exploring of exponential synchronization of quaternion-valued inertial neural networks under aperiodically intermittent quantized control. Firstly, a compact quaternion-valued aperiodically intermittent quantized control protocol is developed, which can mitigate significantly the complexity of theoretical derivation. Subsequently, several concise criteria involving matrix inequalities are formulated through constructing a type of Lyapunov functional and employing a direct analysis approach. The correctness of the obtained results eventually is verified by a typical example.

Saturation function-based continuous control on fixed-time synchronization of competitive neural networks

Currently, through proposing discontinuous control strategies with the signum function and discussing separately short-term memory (STM) and long-term memory (LTM) of competitive artificial neural networks (ANNs), the fixed-time (FXT) synchronization of competitive ANNs has been explored. Note that the method of separate analysis usually leads to complicated theoretical derivation and synchronization conditions, and the signum function inevitably causes the chattering to reduce the performance of the control schemes. To try to solve these challenging problems, the FXT synchronization issue is concerned in this paper for competitive ANNs by establishing a theorem of FXT stability with switching type and developing continuous control schemes based on a kind of saturation functions. Firstly, different from the traditional method of studying separately STM and LTM of competitive ANNs, the models of STM and LTM are compressed into a high-dimensional system so as to reduce the complexity of theoretical analysis. Additionally, as an important theoretical preliminary, a FXT stability theorem with switching differential conditions is established and some high-precision estimates for the convergence time are explicitly presented by means of several special functions. To achieve FXT synchronization of the addressed competitive ANNs, a type of continuous pure power-law control scheme is developed via introducing the saturation function instead of the signum function, and some synchronization criteria are further derived by the established FXT stability theorem. These theoretical results are further illustrated lastly via a numerical example and are applied to image encryption.

Preassigned-time projective synchronization of delayed fully quaternion-valued discontinuous neural networks with parameter uncertainties

This paper concerns with the preassigned-time projective synchronization issue for delayed fully quaternion-valued discontinuous neural networks involving parameter uncertainties through the non-separation method. Above all, based on the existing works, a new preassigned-time stability theorem is established. Subsequently, to realize the control goals, two types of novel and simple chattering-free quaternion controllers are designed, one without the power-law term and the other with a hyperbolic-tangent function. They are different from the existing common power-law controller and exponential controller. Thirdly, under the Filippov discontinuity theories and with the aid of quaternion inequality techniques, some novel succinct sufficient criteria are obtained to ensure the addressed systems to achieve the preassigned-time synchronization by using the preassigned-time stability theory. The preassigned settling time is free from any parameter and any initial value of the system, and can be preset according to the actual task demands. Particularly, unlike the existing results, the proposed control methods can effectively avoid the chattering phenomenon, and the time delay part is removed for simplicity. Additionally, the projection coefficient is generic quaternion-valued instead of real-valued or complex-valued, and some of the previous relevant results are extended. Lastly, numerical simulations are reported to substantiate the effectiveness of the control strategies, the merits of preassigned settling time, and the correctness of the acquired results.

A novel framework of prescribed time/fixed time/finite time stochastic synchronization control of neural networks and its application in image encryption

In this paper, we investigate a novel framework for achieving prescribed-time (PAT), fixed-time (FXT) and finite-time (FNT) stochastic synchronization control of semi-Markov switching quaternion-valued neural networks (SMS-QVNNs), where the setting time (ST) of PAT/FXT/FNT stochastic synchronization control is effectively preassigned beforehand and estimated. Different from the existing frameworks of PAT/FXT/FNT control and PAT/FXT control (where PAT control is deeply dependent on FXT control, meaning that if the FXT control task is removed, it is impossible to implement the PAT control task), and different from the existing frameworks of PAT control (where a time-varying control gain such as μ(t)=T/(T-t) with t∈[0,T) was employed, leading to an unbounded control gain as t→T- from the initial time to prescribed time T), the investigated framework is only built on a control strategy, which can accomplish its three control tasks (PAT/FXT/FNT control), and the control gains are bounded even though time t tends to the prescribed time T. Four numerical examples and an application of image encryption/decryption are given to illustrate the feasibility of our proposed framework.

Resilient fixed-time stabilization of switched neural networks subjected to impulsive deception attacks

This article focuses on the resilient fixed-time stabilization of switched neural networks (SNNs) under impulsive deception attacks. A novel theorem for the fixed-time stability of impulsive systems is established by virtue of the comparison principle. Existing fixed-time stability theorems for impulsive systems assume that the impulsive strength is not greater than 1, while the proposed theorem removes this assumption. SNNs subjected to impulsive deception attacks are modeled as impulsive systems. Some sufficient criteria are derived to ensure the stabilization of SNNs in fixed time. The estimation of the upper bound for the settling time is also given. The influence of impulsive attacks on the convergence time is discussed. A numerical example and an application to Chua's circuit system are given to demonstrate the effectiveness of the theoretical results.

Fixed/prescribed-time synchronization of BAM memristive neural networks with time-varying delays via convex analysis

The synchronization problem of bidirectional associative memory memristive neural networks (BAMMNNs) with time-varying delays plays an essential role in the implementation and application of neural networks. Firstly, under the framework of the Filippov's solution, the discontinuous parameters of the state-dependent switching are transformed by convex analysis method, which is different from most previous approaches. Secondly, based on Lyapunov function and some inequality techniques, several conditions for the fixed-time synchronization (FXTS) of the drive-response systems are obtained by designing special control strategies. Moreover, the settling time (ST) is estimated by the improved fixed-time stability lemma. Thirdly, the driven-response BAMMNNs are investigated to be synchronized within a prescribed time by designing new controllers based on the FXTS results, where ST is irrelevant to the initial values of BAMMNNs and the parameters of controllers. Finally, a numerical simulation is exhibited to verify the correctness of the conclusions.

Predefined-time synchronization of coupled neural networks with switching parameters and disturbed by Brownian motion

This article focuses on predefined time synchronization problem for a class of signal switching neural networks with time-varying delays. In the network models, we not only consider the coupling characteristics in the following networks, but also consider the disturbance with standard Brownian motion. In the design of the controller, the control gain is designed as 1ɛ+T_p-t (t∈[T₀,T_p), ɛ is an optional smaller positive number), which avoids the infinite gain (the control gain is designed as 1T_p-t in other reference). In order to get the predefined time control law, a power function is multiplied to the Lyapunov functional, from which it can get an exponential upper bound function via the derivative and mathematical expectation operation. Utilizing the martingale theory and the method of Laplace matrix, some novel predefined time synchronization criteria are obtained for the leader-following neural networks, meanwhile the following networks can maintain the leader network after achieved synchronization. Based on the special network of the main system, five corollaries separately develop the predefined time synchronization results from different perspectives. An example with some simulation figures and computing results fully exhibits the effectiveness of the achieved synchronization scheme. In this case, although the error signal is disturbed by Brownian motion, the trace signal can still stably converge to zero by this control scheme, meanwhile the predefined-time control effect is achieved.

Fixed-time and prescribed-time synchronization of quaternion-valued neural networks: A control strategy involving Lyapunov functions

A control strategy containing Lyapunov functions is proposed in this paper. Based on this strategy, the fixed-time synchronization of a time-delay quaternion-valued neural network (QVNN) is analyzed. This strategy is extended to the prescribed-time synchronization of the QVNN. Furthermore, an improved two-step switching control strategy is also proposed based on this flexible control strategy. Compared with some existing methods, the main method of this paper is a non-decomposition one, does not contain a sign function in the controller, and has better synchronization accuracy. Two numerical examples verify the above advantages.

Strictly intermittent quantized control for fixed/predefined-time cluster lag synchronization of stochastic multi-weighted complex networks

This article addresses the fixed-time (F-T) and predefined-time (P-T) cluster lag synchronization of stochastic multi-weighted complex networks (SMWCNs) via strictly intermittent quantized control (SIQC). Firstly, by exploiting mathematical induction and reduction to absurdity, a novel F-T stability lemma is proved and an accurate estimation of settling time (ST) is obtained. Subsequently, by virtue of the proposed F-T stability, some simple conditions that ensure the F-T cluster lag synchronization of SMWCNs are derived by developing a SIQC strategy. Furthermore, the P-T cluster lag synchronization is also explored based on a SIQC design, where the ST can be predefined by an adjustable constant of the controller. Note that the designed controllers here are simpler and more economical than the traditional design whose the linear part is still activated during the rest interval. Finally, two numerical examples are provided to verify the effectiveness of the theoretical results.

Prespecified-time bipartite synchronization of coupled reaction-diffusion memristive neural networks with competitive interactions

In this paper, we investigate the prespecified-time bipartite synchronization (PTBS) of coupled reaction-diffusion memristive neural networks (CRDMNNs) with both competitive and cooperative interactions. Two types of bipartite synchronization are considered: leaderless PTBS and leader-following PTBS. With the help of a structural balance condition, the criteria for PTBS for CRDMNNs are derived by designing suitable Lyapunov functionals and novel control protocols. Different from the traditional finite-time or fixed-time synchronization, the settling time obtained in this paper is independent of control gains and initial values, which can be pre-set according to the task requirements. Lastly, numerical simulations are given to verify the obtained results.

Fin-TS and Fix-TS on fractional quaternion delayed neural networks with uncertainty via establishing a new Caputo derivative inequality approach

This paper investigates the finite time synchronization (Fin-TS) and fixed time synchronization (Fix-TS) issues on Caputo quaternion delayed neural networks (QDNNs) with uncertainty. A new Caputo fractional differential inequality is constructed, then Fix-TS settling time of the positive definite function is estimated, which is very convenient to derive Fix-TS condition to Caputo QDNNs. By designing the appropriate self feedback and adaptive controllers, the algebraic discriminant conditions to achieve Fin-TS and Fix-TS on Caputo QDNNs are proposed based on quaternion direct method, Lyapunov stability theory, extended Cauchy Schwartz inequality, Jensen inequality. Finally, the correctness and validity of the presented results under the different orders are verified by two numerical examples.

Fixed-time synchronization of discontinuous competitive neural networks with time-varying delays

In this article, the fixed-time (FXT) synchronization of discontinuous competitive neural networks (CNNs) involving time-varying delays is investigated. Firstly, two kinds of discontinuous FXT control schemes are proposed and two forms of Lyapunov function are constructed based on p-norm and 1-norm to discuss the FXT synchronization of CNNs. By means of nonsmooth analysis and some inequality techniques, some simple criteria are obtained to achieve FXT synchronization and the upper bound of the settling time with less conservativeness is provided. Furthermore, the effect of time scale on FXT synchronization of CNNs is considered. Lastly, some numerical results for an example are provided to demonstrate the derived theoretical results.