This paper is concerned with the fixed-time consensus control problem for non-strict feedback multi-agent systems with asymmetric output constraints and full state constraints. Considering the feasibility of controlling execution, a novel practical virtual control signal is developed utilizing both saturation function and hyperbolic tangent function to ensure that this signal can remain within the same restricted range as the corresponding state variable throughout entire operation process. In backstepping steps, the design of ideal virtual control signal also adopts a different form of piecewise function than before, introducing high-order polynomial functions to avoid singularity problems in the derivation process. In addition, function approximation ability of radial basis function neural networks technique is applied to estimate uncertainties derived from the system functions and controller design procedure. Moreover, universal barrier Lyapunov function approach is improved for constructing an adaptive constrained synchronization control scheme. By fixed-time stability theory, it is shown that the tracking errors of the MAS converge to an adjustable region around the origin in a fixed time and the state variables always obey their constraints. And the upper bound of the settling time is merely dependent on design parameters, which is not affected by the initial states of MAS. The effectiveness of the proposed control strategy is shown by a numerical simulation example at last. Two scenarios are provided to demonstrate the advantages of the control protocol proposed in this paper.

In this brief, we consider the stability of inertial memristor-based neural networks with time-varying delays. First, delayed inertial memristor-based neural networks are modeled as continuous systems in the flux-current-voltage-time domain via the mathematical model of Hewlett-Packard (HP) memristor. Then, they are reduced to delayed inertial neural networks with interval parameters uncertainties. Quasi-equilibrium points and quasi-stability are proposed. Quasi-stability criteria of delayed inertial memristor-based neural networks are obtained by matrix measure method, the Halanay inequality, and uncertainty technologies. In the end, a numerical example is provided to show the validity of our results.

This article considers the adaptive synchronization problem of delayed chaotic memristor-based neural networks (MNNs). Note that MNNs are modeled as continuous systems in the flux-voltage-time (ϕ,x,t) domain where memristors are viewed as continuous systems based on HP memristors. New adaptive controllers of MNNs are proposed, where controllers are both on memristors in the flux-time (ϕ,t) domain and neurons in the voltage-time (x,t) domain. Based on the Lyapunov method, Barbalat's lemma, differential mean value Theorem, and other inequality techniques, completed synchronization criteria for delayed chaotic MNNs are derived. In the end, two examples are given to demonstrate the validity of the derived results.

Modeling and stability analysis of memristor-based neural networks (MNNs) are the premise of designs and applications. Different from most previous research, delayed MNNs are described by continuous differential equations with$2^{2n^{2}+n}$variables where the memductances of memristors are continuously dependent on the fluxes. Both system delays and input delays are considered, and the delays and their derivatives may vary in intervals whose lower bounds are not restricted to be zero. The systems are further reduced to continuous-time neural networks (NNs) with interval matrix uncertainties, and a unified method is developed to solve the stability of delayed NNs and MNNs. Stability criteria are obtained for delayed MNNs by augmented Lyapunov functionals, Wirtinger-based integral inequality, reciprocally convex approach, and linear matrix inequalities. In the end, two numerical simulations are used to demonstrate the validity of our theorems.

This article considers global exponential synchronization almost surely (GES a.s.) for a class of switched discrete-time neural networks (DTNNs). The considered system switches from one mode to another according to transition probability (TP) and evolves with mode-dependent average dwell time (MDADT), i.e., TP-based MDADT switching, which is more practical than classical average dwell time (ADT) switching. The logarithmic quantization technique is utilized to design mode-dependent quantized output controllers (QOCs). Noticing that external perturbations are unavoidable, actuator fault (AF) is also considered. New Lyapunov-Krasovskii functionals and analytical techniques are developed to obtain sufficient conditions to guarantee the GES a.s. It is discovered that the TP matrix plays an important role in achieving the GES a.s., the upper bound of the dwell time (DT) of unsynchronized subsystems can be very large, and the lower bound of the DT of synchronized subsystems can be very small. An algorithm is given to design the control gains, and an optimal algorithm is provided for reducing conservatism of the given results. Numerical examples demonstrate the effectiveness and the merits of the theoretical analysis.

This article investigates global exponential synchronization almost surely (GES a.s.) of complex networks (CNs) with node delay and switching topology. By introducing transition probability (TP) and mode-dependent average dwell time (MDADT) to the switching signal, the considered model is more practical than the systems with average dwell-time (ADT) switching. Controllers with both impulsive effects and actuator fault feedback are considered. New analytical techniques are developed to obtain sufficient conditions to guarantee the GES a.s. Different from the existing results on the synchronization of switched systems, our results show that the GES a.s. can still be achieved even in the case that the upper bound of the dwell time (DT) of uncontrolled nodes is very large and the lower bound of the DT of controlled nodes is very small. Numerical examples demonstrate the effectiveness and the merits of the theoretical analysis.

We study the problem of master-slave synchronization of two delayed memristive neural networks (MNNs). Different from most previous papers, memristors are regarded as uncertain continuous time-varying parameters, and MNNs are modeled by neural networks (NNs) with continuous time-varying parameters and polytopic uncertainty. Thus, synchronization of two delayed MNNs is converted into synchronization of delayed NNs with uncertain parameter mismatches. Quasi-synchronization criteria are derived by Lyapunov function and inequality technique. It is shown that, given a predetermined error bound, quasi-synchronization of two delayed chaotic MNNs can be achieved provided that the pinning strength is larger than a threshold. In the end, a numerical example is provided to illustrate the effectiveness of the derived results.