Search

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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]