Global synchronization of complex dynamical networks through digital communication with limited data rate

State Estimation for Markovian Jump Neural Networks Under Probabilistic Bit Flips: Allocating Constrained Bit Rates

In this article, the state estimation problem is studied for Markovian jump neural networks (MJNNs) within a digital network framework. The wireless communication channel with limited bandwidth is characterized by a constrained bit rate, and the occurrence of bit flips during wireless transmission is mathematically modeled. A transmission mechanism, which includes coding-decoding under bit-rate constraints and considers probabilistic bit flips, is introduced, providing a thorough characterization of the digital transmission process. A mode-dependent remote estimator is designed, which is capable of effectively capturing the internal state of the neural network. Furthermore, a sufficient condition is proposed to ensure the estimation error to remain bounded under challenging network conditions. Within this theoretical framework, the relationship between the neural network's estimation performance and the bit rate is explored. Finally, a simulation example is provided to validate the theoretical findings.

Finite-time cluster synchronization for complex dynamical networks under FDI attack: A periodic control approach

In this paper, the finite-time cluster synchronization problem is addressed for complex dynamical networks (CDNs) with cluster characteristics under false data injection (FDI) attacks. A type of FDI attack is taken into consideration to reflect the data manipulation that controllers in CDNs may suffer. In order to improve the synchronization effect while reducing the control cost, a new periodic secure control (PSC) strategy is proposed in which the set of pinning nodes changes periodically. The aim of this paper is to derive the gains of the periodic secure controller such that the synchronization error of the CDN remains at a certain threshold in finite time with the presence of external disturbances and false control signals simultaneously. Through considering the periodic characteristics of PSC, a sufficient condition is obtained to guarantee the desired cluster synchronization performance, based on which the gains of the periodic cluster synchronization controllers are acquired by resolving an optimization problem proposed in this paper. A numerical case is carried out to validate the cluster synchronization performance of the PSC strategy under cyber attacks.

Non-Fragile H∞ Synchronization for Markov Jump Singularly Perturbed Coupled Neural Networks Subject to Double-Layer Switching Regulation

This work explores the H_∞ synchronization issue for singularly perturbed coupled neural networks (SPCNNs) affected by both nonlinear constraints and gain uncertainties, in which a novel double-layer switching regulation containing Markov chain and persistent dwell-time switching regulation (PDTSR) is used. The first layer of switching regulation is the Markov chain to characterize the switching stochastic properties of the systems suffering from random component failures and sudden environmental disturbances. Meanwhile, PDTSR, as the second-layer switching regulation, is used to depict the variations in the transition probability of the aforementioned Markov chain. For systems under double-layer switching regulation, the purpose of the addressed issue is to design a mode-dependent synchronization controller for the network with the desired controller gains calculated by solving convex optimization problems. As such, new sufficient conditions are established to ensure that the synchronization error systems are mean-square exponentially stable with a specified level of the H_∞ performance. Eventually, the solvability and validity of the proposed control scheme are illustrated through a numerical simulation.

Passivity and Finite-Time Passivity for Multi-Weighted Fractional-Order Complex Networks With Fixed and Adaptive Couplings

This article presents several new α -passivity and α -finite-time passivity ( α -FTP) concepts for the fractional-order systems with different input and output dimensions, which are distinct from the concepts for integer-order systems and extend the existing passivity and FTP definitions to some extent. On one hand, we not only develop some sufficient conditions for ensuring the α -passivity of the multi-weighted fractional-order complex dynamical networks (MWFOCDNs) with fixed and adaptive couplings, but also discuss the synchronization for the MWFOCDNs based on the α -output-strict passivity ( α -OSP). On the other hand, the α -FTP for the MWFOCDNs with fixed and adaptive couplings are also studied on the basis of the designed state feedback controller, and the relationship between finite-time synchronization (FTS) and α -FTP for the MWFOCDNs is also illustrated. Finally, two numerical examples with simulation results are used to demonstrate the validity of the obtained criteria.

H∞Bipartite Synchronization of Double-Layer Markov Switched Cooperation-Competition Neural Networks: A Distributed Dynamic Event-Triggered Mechanism

In this article, the H_∞ bipartite synchronization issue is studied for a class of discrete-time coupled switched neural networks with antagonistic interactions via a distributed dynamic event-triggered control scheme. Essentially different from most current literature, the topology switching of the investigated signed graph is governed by a double-layer switching signal, which integrates a flexible deterministic switching regularity, the persistent dwell-time switching, into a Markov chain to represent the variation of transition probability. Considering the coexistence of cooperative and antagonistic interactions among nodes, the bipartite synchronization of which the dynamics of nodes converge to values with the same modulus but the opposite signs is explored. A distributed control strategy based on the dynamic event-triggered mechanism is utilized to achieve this goal. Under this circumstance, the information update of the controller presents an aperiodic manner, and the frequency of data transmission can be reduced extensively. Thereafter, by constructing a novel Lyapunov function depending on both the switching signal and the internal dynamic nonnegative variable of the triggering mechanism, the exponential stability of bipartite synchronization error systems in the mean-square sense is analyzed. Finally, two simulation examples are provided to illustrate the effectiveness of the derived results.

H∞ Pinning Control of Complex Dynamical Networks Under Dynamic Quantization Effects: A Coupled Backward Riccati Equation Approach

In this article, a pinning control strategy is developed for the finite-horizon H_∞ synchronization problem for a kind of discrete time-varying nonlinear complex dynamical network in a digital communication circumstance. For the sake of complying with the digitized data exchange, a feedback-type dynamic quantizer is introduced to reflect the transformation from the raw signals into the discrete-valued ones. Then, a quantized pinning control scheme takes place on a small fraction of the network nodes with the hope of cutting down the control expenses while achieving the expected global synchronization objective. Subsequently, by resorting to the completing-the-square technique, a sufficient condition is established to ensure the finite-horizon H_∞ index of the synchronization error dynamics against both quantization errors and external noises. Moreover, a controller design algorithm is put forward via an auxiliary H₂ -type criterion, and the desired controller gains are acquired in terms of two coupled backward Riccati equations. Finally, the validity of the presented results is verified via a simulation example.

Finite-Time Passivity and Synchronization of Complex Dynamical Networks With State and Derivative Coupling

In this article, two kinds of complex dynamical networks (CDNs) with state and derivative coupling are investigated, respectively. First, some important concepts about finite-time passivity (FTP), finite-time output strict passivity, and finite-time input strict passivity are introduced. By making use of state-feedback controllers and adaptive state-feedback controllers, several sufficient conditions are given to guarantee the FTP of these two network models. On the other hand, based on the obtained FTP results, some finite-time synchronization criteria for the CDNs with state and derivative coupling are gained. Finally, two simulation examples are proposed to verify the availability of the derived results.

Ultimately Bounded Filtering for Time-Delayed Nonlinear Stochastic Systems with Uniform Quantizations under Random Access Protocol

This paper investigates the ultimately bounded filtering problem for a kind of time-delay nonlinear stochastic systems with random access protocol (RAP) and uniform quantization effects (UQEs). In order to reduce the occurrence of data conflicts, the RAP is employed to regulate the information transmissions over the shared communication channel. The scheduling behavior of the RAP is characterized by a Markov chain with known transition probabilities. On the other hand, the measurement outputs are quantized by the uniform quantizer before being transmitted via the communication channel. The objective of this paper is to devise a nonlinear filter such that, in the simultaneous presence of RAP and UQEs, the filtering error dynamics is exponentially ultimately bounded in mean square (EUBMS). By resorting to the stochastic analysis technique and the Lyapunov stability theory, sufficient conditions are obtained under which the desired nonlinear filter exists, and then the filter design algorithm is presented. At last, two simulation examples are given to validate the proposed filtering strategy.

Variance-Constrained Recursive State Estimation for Time-Varying Complex Networks With Quantized Measurements and Uncertain Inner Coupling

In this paper, a new recursive state estimation problem is discussed for a class of discrete time-varying stochastic complex networks with uncertain inner coupling and signal quantization under the error-variance constraints. The coupling strengths are allowed to be varying within certain intervals, and the measurement signals are subject to the quantization effects before being transmitted to the remote estimator. The focus of the conducted topic is on the design of a variance-constrained state estimation algorithm with the aim to ensure a locally minimized upper bound on the estimation error covariance at every sampling instant. Furthermore, the boundedness of the resulting estimation error is analyzed, and a sufficient criterion is established to ensure the desired exponential boundedness of the state estimation error in the mean square sense. Finally, some simulations are proposed with comparisons to illustrate the validity of the newly developed variance-constrained estimation method.

Leader-following consensus of nonlinear discrete-time multi-agent systems with limited bandwidth and switching topologies

This paper considers the leader-following consensus problem of discrete-time nonlinear multi-agent systems over switching topologies with limited bandwidth. Through the encoding-decoding data, we design a distributed feedback control protocol which is closely associated with the connectivity of relevant channel at each time step. An adaptive communication mechanism is presented to ensure fewer bits of information transmission at each time step under the premise that the quantizer for encoding and decoding is not saturated. Although the nonlinear model over switching topologies introduces a cumulative error with respect to consensus error at previous time steps, the convergence rate of the system can be characterized. Through a rigorous convergence analysis, we illustrate that if the jointly connected condition of communication networks is satisfied, consensus issues will be resolved. A numerical simulation example shows that based on the designed distributed control law, all states of the follower agents are ultimately the same as the leader's state.

Finite-Time Synchronization and H∞ Synchronization of Multiweighted Complex Networks With Adaptive State Couplings

In this paper, two kinds of multiweighted and adaptive state coupled complex networks (CNs) with or without coupling delays are presented. First, we develop the appropriate state feedback controller and adaptive law for the sake of guaranteeing that the proposed network models without coupling delays can be finite-timely synchronized and H_∞ synchronized. Furthermore, for the multiweighted CNs with coupling delays and adaptive state couplings, some finite-time synchronization and H_∞ synchronization criteria are presented by choosing the appropriate adaptive law and controllers. Eventually, we give two numerical simulations to verify the validity of the theoretical results.

Finite-Time Passivity and Synchronization of Coupled Reaction-Diffusion Neural Networks With Multiple Weights

In this paper, two multiple weighted coupled reaction-diffusion neural networks (CRDNNs) with and without coupling delays are introduced. On the one hand, some finite-time passivity (FTP) concepts are proposed for the spatially and temporally system with different dimensions of output and input. By choosing appropriate Lyapunov functionals and controllers, several sufficient conditions are presented to ensure the FTP of these CRDNNs. On the other hand, the finite-time synchronization (FTS) problem is also discussed for the multiple weighted CRDNNs with and without coupling delays, respectively. Finally, two numeral examples with simulation results are provided to verify the effectiveness of the obtained FTP and FTS criteria.

Model-Free Fault Tolerant Control for a Class of Complex Dynamical Networks With Derivative Couplings

This paper studies the fault tolerant synchronization control for a class of derivative coupled complex dynamical networks (CDNs). Different from the existing results, each subsystem model is assumed to be completely unknown and the coupling terms are mismatched with the control input. Within this framework, a novel model-free fault tolerant controller is designed. Under the proposed control law, the synchronization errors of CDNs are proved to asymptotically converge to zero, which means that the synchronization is successfully achieved. Especially, by combining an important spectral decomposition technique and some properties of Laplacian matrix, a data-based algorithm is provided to derive the controller parameter. In addition, the proposed method is also valid for the CDNs with unknown coupling weights. Finally, examples on circuit systems are given to verify the theoretical results, and some circuit realizations of the proposed control law are implemented based on the circuit theory.

Synchronization Control for A Class of Discrete Time-Delay Complex Dynamical Networks: A Dynamic Event-Triggered Approach

This paper is concerned with the synchronization control problem for a class of discrete time-delay complex dynamical networks under a dynamic event-triggered mechanism. For the efficiency of energy utilization, we make the first attempt to introduce a dynamic event-triggering strategy into the design of synchronization controllers for complex dynamical networks. A new discrete-time version of the dynamic event-triggering mechanism is proposed in terms of the absolute errors between control input updates. By constructing an appropriate Lyapunov functional, the dynamics of each network node combined with the introduced event-triggering mechanism are first analyzed, and a sufficient condition is then provided under which the synchronization error dynamics is exponentially ultimately bounded. Subsequently, a set of the desired synchronization controllers is designed by solving a matrix inequality. Finally, a simulation example is provided to verify the effectiveness of the proposed dynamic event-triggered synchronization control scheme.

Partial-Nodes-Based State Estimation for Complex Networks With Unbounded Distributed Delays

In this brief, the new problem of partial-nodes-based (PNB) state estimation problem is investigated for a class of complex network with unbounded distributed delays and energy-bounded measurement noises. The main novelty lies in that the states of the complex network are estimated through measurement outputs of a fraction of the network nodes. Such fraction of the nodes is determined by either the practical availability or the computational necessity. The PNB state estimator is designed such that the error dynamics of the network state estimation is exponentially ultimately bounded in the presence of measurement errors. Sufficient conditions are established to ensure the existence of the PNB state estimators and then the explicit expression of the gain matrices of such estimators is characterized. When the network measurements are free of noises, the main results specialize to the case of exponential stability for error dynamics. Numerical examples are presented to verify the theoretical results.

Asynchronous State Estimation for Discrete-Time Switched Complex Networks With Communication Constraints

This paper is concerned with the asynchronous state estimation for a class of discrete-time switched complex networks with communication constraints. An asynchronous estimator is designed to overcome the difficulty that each node cannot access to the topology/coupling information. Also, the event-based communication, signal quantization, and the random packet dropout problems are studied due to the limited communication resource. With the help of switched system theory and by resorting to some stochastic system analysis method, a sufficient condition is proposed to guarantee the exponential stability of estimation error system in the mean-square sense and a prescribed performance level is also ensured. The characterization of the desired estimator gains is derived in terms of the solution to a convex optimization problem. Finally, the effectiveness of the proposed design approach is demonstrated by a simulation example.

Compressive-Sensing-Based Structure Identification for Multilayer Networks

The coexistence of multiple types of interactions within social, technological, and biological networks has motivated the study of the multilayer nature of real-world networks. Meanwhile, identifying network structures from dynamical observations is an essential issue pervading over the current research on complex networks. This paper addresses the problem of structure identification for multilayer networks, which is an important topic but involves a challenging inverse problem. To clearly reveal the formalism, the simplest two-layer network model is considered and a new approach to identifying the structure of one layer is proposed. Specifically, if the interested layer is sparsely connected and the node behaviors of the other layer are observable at a few time points, then a theoretical framework is established based on compressive sensing and regularization. Some numerical examples illustrate the effectiveness of the identification scheme, its requirement of a relatively small number of observations, as well as its robustness against small noise. It is noteworthy that the framework can be straightforwardly extended to multilayer networks, thus applicable to a variety of real-world complex systems.

Exponential Synchronization for Markovian Stochastic Coupled Neural Networks of Neutral-Type via Adaptive Feedback Control

In this paper, we investigate the adaptive exponential synchronization in both the mean square and the almost sure senses for an array of N identical Markovian stochastic coupled neural networks of neutral-type with time-varying delay and random coupling strength. The generalized Lyapunov theorem of the exponential stability in the mean square for the neutral stochastic Markov system with the time-varying delay is first established. The time-varying delay in the system is assumed to be a bounded measurable function. Then, sufficient conditions to guarantee the exponential synchronization in the mean square for the underlying system are developed under an adaptive feedback controller, which are given in terms of the M -matrix and the algebraic inequalities. Under the same conditions, the almost sure exponential synchronization is also presented. A numerical example is given to show the effectiveness and potential of the proposed theoretical results.

High-Performance Consensus Control in Networked Systems With Limited Bandwidth Communication and Time-Varying Directed Topologies

Communication data rates and energy constraints are two important factors that have to be considered in the coordination control of multiagent networks. Although some encoder-decoder-based consensus protocols are available, there still exists a fundamental theoretical problem: how can we further reduce the update rate of control input for each agent without the changing consensus performance? In this paper, we consider the problem of average consensus over directed and time-varying digital networks of discrete-time first-order multiagent systems with limited communication data transmission rates. Each agent has a real-valued state but can only exchange binary symbolic sequence with its neighbors due to bandwidth constraints. A class of novel event-triggered dynamic encoding and decoding algorithms is proposed, based on which a kind of consensus protocol is presented. Moreover, we develop a scheme to select the numbers of time-varying quantization levels for each connected communication channel in the time-varying directed topologies at each time step. The analytical relation among system and network parameters is characterized explicitly. It is shown that the asymptotic convergence rate is related to the scale of the network, the number of quantization levels, the system parameter, and the network structure. It is also found that under the designed event-triggered protocol, for a directed and time-varying digital network, which uniformly contains a spanning tree over a time interval, the average consensus can be achieved with an exponential convergence rate based on merely 1-b information exchange between each pair of adjacent agents at each time step.

Leader-follower H∞ consensus of linear multi-agent systems with aperiodic sampling and switching connected topologies

This paper is concerned with the distributed H_∞ consensus of leader-follower multi-agent systems with aperiodic sampling interval and switching topologies. Under the assumption that the sampling period takes values from a given set, a new discrete-time model is proposed for the tracking error system. For the multi-agent systems with time-varying sampling period, switching topologies and external disturbance, the considered tracking problem is converted to a robust H_∞ control problem. With help of the Lyapunov stability theory, a sufficient condition for the existence of mode-dependent controller is established and it guarantees the exponential stability of tracking error system and a prescribed H_∞ disturbance attenuation level. The influence of sampling period on the overall control performance is also discussed. Two simulation examples are given to show the effectiveness of the proposed control algorithm.

Collective Motion in a Network of Self-Propelled Agent Systems

Collective motions of animals that move towards the same direction is a conspicuous feature in nature. Such groups of animals are called a self-propelled agent (SPA) systems. Many studies have been focused on the synchronization of isolated SPA systems. In real scenarios, different SPA systems are coupled with each other forming a network of SPA systems. For example, a flock of birds and a school of fish show predator-prey relationships and different groups of birds may compete for food. In this work, we propose a general framework to study the collective motion of coupled self-propelled agent systems. Especially, we study how three different connections between SPA systems: symbiosis, predator-prey, and competition influence the synchronization of the network of SPA systems. We find that a network of SPA systems coupled with symbiosis relationship arrive at a complete synchronization as all its subsystems showing a complete synchronization; a network of SPA systems coupled by predator-prey relationship can not reach a complete synchronization and its subsystems converges to different synchronized directions; and the competitive relationship between SPA systems could increase the synchronization of each SPA systems, while the network of SPA systems coupled by competitive relationships shows an optimal synchronization for small coupling strength, indicating that small competition promotes the synchronization of the entire system.