Prespecified-Time Cluster Synchronization of Complex Networks via a Smooth Control Approach

Effects of impulse on prescribed-time synchronization of switching complex networks

The specified convergence time, designated by the user, is highly attractive for many high-demand applications such as industrial robot control, missile guidance, and autonomous vehicles. For the application of neural networks in the field of secure communication and power systems, the importance of prescribed-time synchronization(PTs) and stable performance of the system is more prominent. This paper introduces a prescribed-time controller without the fractional power function and sign function, which can reach synchronization at a prescribed time and greatly reduce the chattering phenomenon of neural networks. Additionally, by constructing synchronizing/desynchronizing impulse sequences, the PTs of switching complex networks(SCN) is achieved with impulse effects, where the time sequences of switching and impulse occurrences in the networks are constrained by the average dwell time. This approach effectively reduces the impact of frequent mode switching on network synchronization, and the synchronization time can be flexibly adjusted within any physically allowable range to accommodate different application requirements. Finally, the effectiveness of the proposed control strategy is demonstrated by two examples.

Event-triggered impulsive cluster synchronization of coupled reaction-diffusion neural networks and its application to image encryption

This paper investigates the cluster synchronization of coupled neural networks with reaction-diffusion terms. With the help of impulsive control strategies, some cluster synchronization criteria are proposed by an appropriate event-triggered mechanism. A numerical example is given to verify the validity of the theoretical results. Additionally, the proposed event-triggered impulsive synchronization is successfully applied to image encryption with encouraging cryptanalysis results demonstrating its strong ability to efficiently encrypt images.

Preassigned-time synchronization for complex-valued memristive neural networks with reaction-diffusion terms and Markov parameters

This study addresses the preassigned-time synchronization for complex-valued memristive neural networks with reaction-diffusion terms and Markov parameters. Employing a preassigned-time stable control strategy, two distinct controllers with varying power exponent parameters are designed to ensure that synchronization can be achieved within a predefined time frame. Unlike existing finite/fixed-time results, a priori specification of the settling time is addressed. Furthermore, Green's formula and boundary conditions are efficiently applied to overcome potential symmetry loss. Additionally, the activation function's constraint range is more lenient compared to existing constraints. Finally, the effectiveness of the presented methods are demonstrated through two examples.

Multiple Mittag-Leffler Stability of Fractional-Order Complex-Valued Memristive Neural Networks With Delays

This article discusses the coexistence and dynamical behaviors of multiple equilibrium points (Eps) for fractional-order complex-valued memristive neural networks (FCVMNNs) with delays. First, based on the state space partition method, some sufficient conditions are proposed to guarantee that there are multiple Eps in one FCVMNN. Then, the Mittag-Leffler stability of those multiple Eps is proved by using the Lyapunov function. Simultaneously, the enlarged attraction basins are obtained to improve and extend the existing theoretical results in the previous literature. In addition, some existing stability results in the literature are special cases of a new result herein. Finally, two illustrative examples with computer simulations are presented to verify the effectiveness of theoretical analysis.

Event-Triggered Prescribed Settling Time Consensus Compensation Control for a Class of Uncertain Nonlinear Systems With Actuator Failures

For a class of uncertain nonlinear systems with actuator failures, the event-triggered prescribed settling time consensus adaptive compensation control method is proposed. The unknown form of actuator failures may occur in practical applications, resulting in system instability or even control failure. In order to effectively deal with the above problems, a neural network adaptive control method is developed to ensure that the system states rapidly converge in the event of failure and compensate for the failures of actuator. Meanwhile, a nonlinear transformation function is introduced to make sure that the tracking error converges for the predefined interval within a prescribed settling time, which makes that the convergence time can be preset. Furthermore, a finite-time event-triggered compensation control strategy is established by the backstepping technology. Under this strategy, the system not only can rapidly stabilize in finite time but also can effectively save network bandwidth. In addition, the states of the system are globally uniformly bounded. Finally, the theoretical analysis and simulation experiments validate the effectiveness of the proposed method.

Fixed/Preassigned-time stochastic synchronization of T-S fuzzy complex networks with partial or complete information communication

This paper is devoted to analyzing Fixed/Preassigned-time synchronization of T-S fuzzy complex networks (TSFCNs) with stochastic effects. Unlike the existing results, partial information communication and complete information communication are all considered according to a Bernoulli distribution. Furthermore, different controllers with quantization are structured to realize our synchronization goal, and one of control parameters can switch based on the error information. Besides, we derive sufficient conditions to guarantee Fixed-time(FDT) and Preassigned-time(PAT) synchronization of TSFCNs, and analyze the difference of FDT and PAT synchronization. Finally, numerical examples and comparisons show that our results are valid.

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.

Matrix Measure-Based Projective Synchronization on Coupled Neural Networks With Clustering Trees

This article mainly studies the projective quasisynchronization for an array of nonlinear heterogeneous-coupled neural networks with mixed time-varying delays and a cluster-tree topology structure. For the sake of the mismatched parameters and the mutual influence among distinct clusters, the exponential and global quasisynchronization within a prescribed error bound instead of complete synchronization for the coupled neural networks with clustering trees is investigated. A kind of pinning impulsive controllers is designed, which will be imposed on the selected neural networks with some largest norms of error states at each impulsive instant in different clusters. By employing the concept of the average impulsive interval, the matrix measure method, and the Lyapunov stability theorem, sufficient conditions for the realization of the cluster projective quasisynchronization are derived. Meanwhile, in terms of the formula of variation of parameters and the comparison principle for the impulsive systems with mixed time-varying delays, the convergence rate and the synchronization error bound are precisely estimated. Furthermore, the synchronization error bound is efficiently optimized based on different functions of the impulsive effects. Finally, a numerical experiment is given to prove the results of theoretical analysis.

Adaptive Appointed-Time Consensus Control of Networked Euler-Lagrange Systems With Connectivity Preservation

With consideration of motion control performance and efficient information communication, the synchronization problem on communication connectivity preservation and guaranteed consensus performance for networked mechanical systems has attracted considerable attention in recent years. Different from the existing works, this article investigates a brand-new appointed-time consensus control approach for uncertain networked Euler-Lagrange systems on a directed graph via exploring the prescribed performance control structure. First, a two-layer prescribed performance envelope is formulated via using an appointed-time convergent function for position-related and velocity-related consensus errors, respectively. Then, a simple state-feedback virtual controller with online adaptive performance adjustment is developed to preserve the communication connectivity. Moreover, to guarantee the velocity consensus of the networked systems and improve the position consensus accuracy, an appointed-time adaptive controller is designed by applying the norm inequality to the system uncertainties and external disturbances. Compared to the existing consensus control approaches, the prime advantage of the proposed one is that the constraints generated from the communication ranges are approximated by a time-varying contractive performance envelope, wherein, the appointed-time convergence and steady-state tracking accuracy are preassigned a priori. Meanwhile, no repeated logarithmic error transformations are required in the relevant controller design, which implies that the complexity of the devised control laws has decreased dramatically. Finally, two groups of illustrative examples are organized to validate the effectiveness of the proposed consensus control approach.

Transient Bipartite Synchronization for Cooperative-Antagonistic Multiagent Systems With Switching Topologies

This article aims at addressing the transient bipartite synchronization problem for cooperative-antagonistic multiagent systems with switching topologies. A distributed iterative learning control protocol is presented for agents by resorting to the local information from their neighbor agents. Through learning from other agents, the control input of each agent is updated iteratively such that the transient bipartite synchronization can be achieved over the targeted finite horizon under the simultaneously structurally balanced signed digraph. To be specific, all agents finally have the same output moduli at each time instant over the desired finite-time interval, which overcomes the influences caused by the antagonisms among agents and topology nonrepetitiveness along the iteration axis. As a counterpart, it is revealed that the stability can be achieved over the targeted finite horizon in the presence of a constantly structurally unbalanced signed digraph. Simulation examples are carried out to demonstrate the effectiveness of the distributed learning results developed among multiple agents.

Delay Compensation-Based State Estimation for Time-Varying Complex Networks With Incomplete Observations and Dynamical Bias

In this article, a delay-compensation-based state estimation (DCBSE) method is given for a class of discrete time-varying complex networks (DTVCNs) subject to network-induced incomplete observations (NIIOs) and dynamical bias. The NIIOs include the communication delays and fading observations, where the fading observations are modeled by a set of mutually independent random variables. Moreover, the possible bias is taken into account, which is depicted by a dynamical equation. A predictive scheme is proposed to compensate for the influences induced by the communication delays, where the predictive-based estimation mechanism is adopted to replace the delayed estimation transmissions. This article focuses on the problems of estimation method design and performance discussions for addressed DTVCNs with NIIOs and dynamical bias. In particular, a new distributed state estimation approach is presented, where a locally minimized upper bound is obtained for the estimation error covariance matrix and a recursive way is designed to determine the estimator gain matrix. Furthermore, the performance evaluation criteria regarding the monotonicity are proposed from the analytic perspective. Finally, some experimental comparisons are proposed to show the validity and advantages of the new DCBSE approach.

Recursive Minimum-Variance Filter Design for State-Saturated Complex Networks With Uncertain Coupling Strengths Subject to Deception Attacks

In this article, the recursive filtering problem is investigated for state-saturated complex networks (CNs) subject to uncertain coupling strengths (UCSs) and deception attacks. The measurement signals transmitted via the communication network may suffer from deception attacks, which are governed by Bernoulli-distributed random variables. The purpose of the problem under consideration is to design a minimum-variance filter for CNs with deception attacks, state saturations, and UCSs such that upper bounds on the resulting error covariances are guaranteed. Then, the expected filter gains are acquired via minimizing the traces of such upper bounds, and sufficient conditions are established to ensure the exponential mean-square boundedness of the filtering errors. Finally, two simulation examples (including a practical application) are exploited to validate the effectiveness of our designed approach.

A Dynamic Event-Triggered Approach to Recursive Nonfragile Filtering for Complex Networks With Sensor Saturations and Switching Topologies

In this article, the nonfragile filtering issue is addressed for complex networks (CNs) with switching topologies, sensor saturations, and dynamic event-triggered communication protocol (DECP). Random variables obeying the Bernoulli distribution are utilized in characterizing the phenomena of switching topologies and stochastic gain variations. By introducing an auxiliary offset variable in the event-triggered condition, the DECP is adopted to reduce transmission frequency. The goal of this article is to develop a nonfragile filter framework for the considered CNs such that the upper bounds on the filtering error covariances are ensured. By the virtue of mathematical induction, gain parameters are explicitly derived via minimizing such upper bounds. Moreover, a new method of analyzing the boundedness of a given positive-definite matrix is presented to overcome the challenges resulting from the coupled interconnected nodes, and sufficient conditions are established to guarantee the mean-square boundedness of filtering errors. Finally, simulations are given to prove the usefulness of our developed filtering algorithm.

Improved Results on Fixed-/Preassigned-Time Synchronization for Memristive Complex-Valued Neural Networks

This article concerns the problems of synchronization in a fixed time or prespecified time for memristive complex-valued neural networks (MCVNNs), in which the state variables, activation functions, rates of neuron self-inhibition, neural connection memristive weights, and external inputs are all assumed to be complex-valued. First, the more comprehensive fixed-time stability theorem and more accurate estimations on settling time (ST) are systematically established by using the comparison principle. Second, by introducing different norms of complex numbers instead of decomposing the complex-valued system into real and imaginary parts, we successfully design several simpler discontinuous controllers to acquire much improved fixed-time synchronization (FXTS) results. Third, based on similar mathematical derivations, the preassigned-time synchronization (PATS) conditions are explored by newly developed new control strategies, in which ST can be prespecified and is independent of initial values and any parameters of neural networks and controllers. Finally, numerical simulations are provided to illustrate the effectiveness and superiority of the improved synchronization methodology.

Finite-time H∞ synchronization for complex dynamical networks with time-varying delays based on adaptive control

This paper investigates the problem of finite-time H_∞ synchronization (H_∞FTS) for complex dynamical networks (CDNs) with time-varying delays(TVDs) and unknown internal coupling matrices. External disturbances are also considered into this model. By applying the adaptive control theory, this paper presents the adaptive control method to solve the H_∞FTS of CDNs with external disturbances and TVDs. Some criteria are obtained by utilizing appropriate adaptive controllers and devising a special Lyapunov-Krasovskii function (LKF), which ensure the H_∞FTS of CDNs based on passivity theory. Finally, using some effective mathematical techniques, comparative numerical example and Chua's circuit system are used to explain the advantages and applicability of the results and approaches.

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.

Finite-Time Passivity and Synchronization of Multi-Weighted Complex Dynamical Networks Under PD Control

This article focuses on finite-time passivity (FTP) and finite-time synchronization (FTS) for complex dynamical networks with multiple state/derivative couplings based on the proportional-derivative (PD) control method. Several criteria of FTP for complex dynamical networks with multiple state couplings (CDNMSCs) are formulated by utilizing the PD controller and constructing an appropriate Lyapunov function. Furthermore, FTP is further used to investigate the FTS in CDNMSCs under the PD controller. In addition, the FTP and FTS for complex dynamical networks with multiple derivative couplings (CDNMDCs) are also studied by exploiting the PD control method and some inequality techniques. Finally, two numerical examples are worked out to demonstrate the validity of the presented PD controllers.

Asymptotic Synchronization of Memristive Cohen-Grossberg Neural Networks with Time-Varying Delays via Event-Triggered Control Scheme

This paper investigates the asymptotic synchronization of memristive Cohen-Grossberg neural networks (MCGNNs) with time-varying delays under event-triggered control (ETC). First, based on the designed feedback controller, some ETC conditions are provided. It is demonstrated that ETC can significantly reduce the update times of the controller and decrease the computing cost. Next, some sufficient conditions are derived to ensure the asymptotic synchronization of MCGNNs with time-varying delays under the ETC method. Finally, a numerical example is provided to verify the correctness and effectiveness of the obtained results.

Improved Results on Finite-Time Passivity and Synchronization Problem for Fractional-Order Memristor-Based Competitive Neural Networks: Interval Matrix Approach

This research paper deals with the passivity and synchronization problem of fractional-order memristor-based competitive neural networks (FOMBCNNs) for the first time. Since the FOMBCNNs’ parameters are state-dependent, FOMBCNNs may exhibit unexpected parameter mismatch when different initial conditions are chosen. Therefore, the conventional robust control scheme cannot guarantee the synchronization of FOMBCNNs. Under the framework of the Filippov solution, the drive and response FOMBCNNs are first transformed into systems with interval parameters. Then, the new sufficient criteria are obtained by linear matrix inequalities (LMIs) to ensure the passivity in finite-time criteria for FOMBCNNs with mismatched switching jumps. Further, a feedback control law is designed to ensure the finite-time synchronization of FOMBCNNs. Finally, three numerical cases are given to illustrate the usefulness of our passivity and synchronization results.

Distributed Control of Time-Varying Signed Networks: Theories and Applications

Signed networks admitting antagonistic interactions among agents may polarize, cluster, or fluctuate in the presence of time-varying communication topologies. Whether and how signed networks can be stabilized regardless of their sign patterns is one of the fundamental problems in the network system control areas. To address this problem, this paper targets at presenting a self-appraisal mechanism in the protocol of each agent, for which a notion of diagonal dominance degree is proposed to represent the dominant role of agent's self-appraisal over external impacts from all other agents. Selection conditions on diagonal dominance degrees are explored such that signed networks in the presence of directed time-varying topologies can be ensured to achieve the uniform asymptotic stability despite any sign patterns. Further, the established stability results can be applied to achieve bipartite consensus tracking of time-varying signed networks and realize state-feedback stabilization of time-varying systems. Simulations are implemented to verify our uniform asymptotic stability results for directed time-varying signed networks.

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

The fixed-time synchronization and preassigned-time synchronization of quaternion-valued neural networks are concerned in this article. By developing fixed-time stability and proposing a pure power-law control scheme, some simple conditions are obtained to realize fixed-time synchronization of quaternion-valued neural networks and the upper bound of the synchronized time is provided. Furthermore, the preassigned-time synchronization of quaternion-valued neural networks is investigated based on pure power-law control design, where the synchronization time is preassigned in advance and the control gains are finite. Note that the designed controllers in this paper are the pure power-law forms, which are simpler and more effective compared with the traditional design composed of the linear part and power-law part. Eventually, an example is given to illustrate the feasibility and validity of the results obtained.

Finite-Time Output Synchronization and H∞ Output Synchronization of Coupled Neural Networks With Multiple Output Couplings

This article investigates the finite-time output synchronization and H_∞ output synchronization problems for coupled neural networks with multiple output couplings (CNNMOC), respectively. By choosing appropriate state feedback controllers, several finite-time output synchronization and H_∞ output synchronization criteria are proposed for the CNNMOC. Moreover, a coupling-weight adjustment scheme is also developed to guarantee the finite-time output synchronization and H_∞ output synchronization of CNNMOC. Finally, two numerical examples are given to verify the effectiveness of the presented criteria.

Further Results for Edge Convergence of Directed Signed Networks

The edge convergence problems have been explored for directed signed networks recently in 2019 by Du, Ma, and Meng, of which the analysis results, however, depend heavily on the strong connectivity of the network topologies. The question asked in this article is: whether and how can the edge convergence be achieved when the strong connectivity is not satisfied? The answer for the case of spanning tree is given. It is shown that if a signed network is either structurally balanced or r-structurally unbalanced, then the edge state can be ensured to converge to a constant vector. In contrast, if a signed network is both structurally unbalanced and r-structurally balanced, then its edge state does not converge to a constant vector any longer, but to a time-varying vector trajectory with a constant speed. Further, the dynamic behavior results of edges can be derived to address the node convergence problems of signed networks. The simulation examples are provided to illustrate the validity of the established edge convergence results.

Perturbation Analysis for Finite-Time Stability and Stabilization of Probabilistic Boolean Networks

This article analyzes the function perturbation impact on the finite-time stability and stabilization of the probabilistic Boolean networks (PBNs). First, the concept of stability in the distribution of PBNs is divided into two disjoint concepts, that is, finite-time stability with probability one (FTSPO) and asymptotical stability with probability one (ASPO), and a new criterion is proposed for the verification of ASPO. Second, by constructing a parameterized set, it is shown that PBNs subject to function perturbation keep FTSPO if and only if the perturbed point does not belong to the parameterized set, while PBNs become ASPO if and only if the perturbed point belongs to the parameterized set. Third, as an application of perturbed stability analysis, the robust state-feedback stabilization is discussed for probabilistic Boolean control networks (PBCNs) with function perturbation. Finally, the obtained results are applied to a WNT5A network and lac operon in the Escherichia coli, respectively.

A Unified Framework Design for Finite-Time and Fixed-Time Synchronization of Discontinuous Neural Networks

In this article, the problems of finite-time/fixed-time synchronization have been investigated for discontinuous neural networks in the unified framework. To achieve the finite-time/fixed-time synchronization, a novel unified integral sliding-mode manifold is introduced, and corresponding unified control strategies are provided; some criteria are established for selecting suitable parameters for solving the related issue, namely, the dynamics of neural network can reach the designed sliding-mode manifold in finite/fixed time, and stay on it thereafter. Moreover, the estimations of setting time are given out. The established unified framework can bring in various protocols by choosing the different parameters of controllers and sliding-mode manifold, which extend previous related results. Finally, some numerical examples are introduced to show the effectiveness and superiority of resulting conclusions.

Fixed/Preassigned-Time Synchronization of Complex Networks via Improving Fixed-Time Stability

This article is concerned with the problem of fixed-time (FXT) and preassigned-time (PAT) synchronization for discontinuous dynamic networks by improving FXT stability and developing simple control schemes. First, some more relaxed conditions for FXT stability are established and several more accurate estimates for the settling time (ST) are obtained by means of some special functions. Based on the improved FXT stability, FXT synchronization for discontinuous networks is discussed by designing a simple controller without a linear feedback term. Besides, the PAT synchronization is also explored by developing several nontrivial control protocols with finite control gains, where the synchronized time can be prespecified according to actual needs and is irrelevant with any initial value and any parameter. Finally, the improved FXT stability and the synchronization for complex networks are confirmed by two numerical examples.

Quasisynchronization of Discrete-Time Inertial Neural Networks With Parameter Mismatches and Delays

Contrary to many existing works based on the continuous-time inertial neural network, this article considers the quasisynchronization issue for the discrete-time inertial neural network. To obtain the main results, we adopt the generalized matrix-measure concept. A condition ensuring the quasisynchronization is attained at first. To make the result less conservative, further analysis based on the generalized matrix measure is proceeded. An example is given to demonstrate the validity and effectiveness of the main results.

Exponential Stabilization of Inertial Memristive Neural Networks With Multiple Time Delays

This article investigates the global exponential stabilization (GES) of inertial memristive neural networks with discrete and distributed time-varying delays (DIMNNs). By introducing the inertial term into memristive neural networks (MNNs), DIMNNs are formulated as the second-order differential equations with discontinuous right-hand sides. Via a variable transformation, the initial DIMNNs are rewritten as the first-order differential equations. By exploiting the theories of differential inclusion, inequality techniques, and the comparison strategy, the p th moment GES ( p ≥ 1 ) of the addressed DIMNNs is presented in terms of algebraic inequalities within the sense of Filippov, which enriches and extends some published results. In addition, the global exponential stability of MNNs is also performed in the form of an M-matrix, which contains some existing ones as special cases. Finally, two simulations are carried out to validate the correctness of the theories, and an application is developed in pseudorandom number generation.

Synchronization of Time-Delayed Complex Networks With Switching Topology Via Hybrid Actuator Fault and Impulsive Effects Control

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.