Pinning Synchronization of Directed Networks With Switching Topologies: A Multiple Lyapunov Functions Approach

Finite-time synchronization for coupled neural networks with time-delay jumping coupling

The finite-time synchronization problem is studied for coupled neural networks (CNNs) with time-delay jumping coupling. Markovian switching topologies, imprecise delay models, uncertain parameters and the unavailable of topology modes are considered in this work. A mode-dependent delay with pre-known conditional probability is built to handle the imprecise delay model problem. A hidden Markov model with uncertain parameters is introduced to describe the mode mismatch problem, and an asynchronous controller is designed. Besides, a set of Bernoulli processes models the random packet dropouts during data communication. Based on Markovian switching topologies, mode-dependent delays, uncertain probabilities and packet dropout, a sufficient condition that guarantees the CNNs reach finite-time synchronization (FTS) is derived. Finally, a numerical example is derived to demonstrate the efficiency of the proposed synchronous technique.

Quantized Synchronization Control of Networked Nonlinear Systems: Dynamic Quantizer Design With Event-Triggered Mechanism

This article investigates the quantized control issue for synchronizing a networked nonlinear system. Due to limited energy and channel resources, the event-triggered control (ETC) method and input quantization are simultaneously taken into account in this article. First, a dynamic quantizer, which discretely adjusts its parameters online and possesses a finite quantization range, is introduced to achieve exact synchronization, rather than quasisynchronization. Next, a new distributed Zeno-free ETC strategy is proposed based on the dynamic quantizer. Then, two different situations, that is, the quantizer is designed with/without the network topology information, are, respectively, discussed. Synchronization criteria are, respectively, derived under such two circumstances by using the Lyapunov method. Finally, numerical examples are provided to show the effectiveness of the theoretical results.

Distributed Observer Design for Linear Systems to Achieve Omniscience Asymptotically Under Jointly Connected Switching Networks

The distributed observer problem is motivated by the case where the output information of the system is decentralized in different subsystems. In this scene, all the subsystems form an observer network, and each of them has access to only a part of output information and the information exchanged via the given communication networks. Due to the limitation of communication conditions among subsystems, the communication network is often time varying and disconnected. However, the existing research about the aforementioned scene is still not enough to solve this problem. To this end, this article is concerned with the challenge of the distributed observer design for linear systems under time-variant disconnected communication networks. The design method is successfully established by fixing both completely decentralized output information and incompletely decentralized output information into account. Our work overcomes the limitation of the existing results that the distributed observer can only reconstruct the full states of the underlying systems by means of fast switching. In the case of completely decentralized output information, a group of sufficient conditions is put forward for the system matrix, and it is proved that the asymptotical omniscience of the distributed observer could be achieved as long as anyone of the developed conditions is satisfied. Furthermore, unlike similar problems in multiagent systems, the systems that can meet the proposed conditions are not only stable and marginally stable systems but also some unstable systems. As for the case where the output information is not completely decentralized, the results show with the observable decomposition and states reorganization technology that the distributed observer could achieve omniscience asymptotically without any constraints on the system matrix. The validity of the proposed design method is emphasized in two numerical simulations.

Edge-Based Decentralized Adaptive Pinning Synchronization of Complex Networks Under Link Attacks

This article studies the pinning synchronization problem with edge-based decentralized adaptive schemes under link attacks. The link attacks considered here are a class of malicious attacks to break links between neighboring nodes in complex networks. In such an insecure network environment, two kinds of edge-based decentralized adaptive update strategies (synchronous and asynchronous) on coupling strengths and gains are designed to realize the security synchronization of complex networks. Moreover, by virtue of the edge pinning technique, the corresponding secure synchronization problem is considered under the case where only a small fraction of coupling strengths and gains is updated. These designed adaptive strategies do not require any global information, and therefore, the obtained results in this article are developed in a fully decentralized framework. Finally, a numerical example is provided to verify the availability of the achieved theoretical outcomes.

Networked Multiagent Systems: Antagonistic Interaction, Constraint, and its Application

In this article, we study the consensus problem in the framework of networked multiagent systems with constraint where there exists antagonistic information. A major difficulty is how to characterize the communication among the interacting agents in the presence of antagonistic information without resorting to the signed graph theory, which plays a central role in the Altafini model. It is shown that the proposed control protocol enables us to solve the consensus problem in a node-based viewpoint where both cooperative and antagonistic interactions coexist. Moreover, the proposed setup is further extended to the case of input saturation, leading to the semiglobal consensus. In addition, the consensus region associated with antagonistic information among participating individuals is also elaborated. Finally, the deduced theoretical results are applied to the task distribution problem via unmanned ground vehicles.

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.

Exponential synchronization of coupled neural networks under stochastic deception attacks

In this paper, the issue of synchronization is investigated for coupled neural networks subject to stochastic deception attacks. Firstly, a general differential inequality with delayed impulses is given. Then, the established differential inequality is further extended to the case of delayed stochastic impulses, in which both the impulsive instants and impulsive intensity are stochastic. Secondly, by modeling the stochastic discrete-time deception attacks as stochastic impulses, synchronization criteria of the coupled neural networks under the corresponding attacks are given. Finally, two numerical examples are provided to demonstrate the correctness of the theoretical results.

Cluster consensus of nonlinear multi-agent systems with Markovian switching topologies and communication noises

This paper focuses on the mean square cluster consensus of nonlinear multi-agent systems with Markovian switching topologies and communication noise via pinning control technique. Network topology can take weaker conditions in each cluster but an extra balanced condition is also needed. A time-varying control gain will be introduced to eliminate the effect of stochastic noise. For the case of fixed topology, if the induced digraph of each cluster has a directed spanning tree, the sufficient conditions for the mean square cluster consensus can be obtained. For the case of Markovian switching topologies, if the induced digraph of union of the Laplacian matrix of each mode has a directed spanning tree, the mean square cluster consensus conclusion can be derived. Particularly, if the elements of transition probability of Markov chain are partly unknown, we can also obtain the same conclusion under the same conditions. Finally, two examples are given to illustrate our results.

Target Controllability in Multilayer Networks via Minimum-Cost Maximum-Flow Method

In this article, to maximize the dimension of controllable subspace, we consider target controllability problem with maximum covered nodes set in multiplex networks. We call such an issue as maximum-cost target controllability problem. Likewise, minimum-cost target controllability problem is also introduced which is to find minimum covered node set and driver node set. To address these two issues, we first transform them into a minimum-cost maximum-flow problem based on graph theory. Then an algorithm named target minimum-cost maximum-flow (TMM) is proposed. It is shown that the proposed TMM ensures the target nodes in multiplex networks to be controlled with the minimum number of inputs as well as the maximum (minimum) number of covered nodes. Simulation results on Erdős-Rényi (ER-ER) networks, scale-free (SF-SF) networks, and real-life networks illustrate satisfactory performance of the TMM.

Synchronization Control for Discrete-Time-Delayed Dynamical Networks With Switching Topology Under Actuator Saturations

This article is concerned with the synchronization control problem for a class of discrete-time dynamical networks with mixed delays and switching topology. The saturation phenomenon of physical actuators is specifically considered in designing feedback controllers. By exploring the mixed-delay-dependent sector conditions in combination with the piecewise Lyapunov-like functional and the average-dwell-time switching, a sufficient condition is first established under which all trajectories of the error dynamics are bounded for admissible initial conditions and nonzero external disturbances, while the l₂ - l_∞ performance constraint is satisfied. Furthermore, the exponential stability of the error dynamics is ensured for admissible initial conditions in the absence of disturbances. Second, by using some congruence transformations, the explicit condition guaranteeing the existence of desired controller gains is obtained in terms of the feasibility of a set of linear matrix inequalities. Then, three convex optimization problems are formulated regarding the disturbance tolerance, the l₂ - l_∞ performance, and the initial condition set, respectively. Finally, two simulation examples are given to show the effectiveness and merits of the proposed results.

Synchronization for stochastic coupled networks with Lévy noise via event-triggered control

This paper addresses the realization of almost sure synchronization problem for a new array of stochastic networks associated with delay and Lévy noise via event-triggered control. The coupling structure of the network is governed by a continuous-time homogeneous Markov chain. The nodes in the networks communicate with each other and update their information only at discrete-time instants so that the network workload can be minimized. Under the framework of stochastic process including Markov chain and Lévy process, and the convergence theorem of non-negative semi-martingales, we show that the Markovian coupled networks can achieve the almost sure synchronization by event-triggered control methodology. The results are further extended to the directed topology, where the coupling structure can be asymmetric. Furthermore, we also proved that the Zeno behavior can be excluded under our proposed approach, indicating that our framework is practically feasible. Numerical simulations are provided to demonstrate the effectiveness of the obtained theoretical results.

PID Control for Synchronization of Complex Dynamical Networks With Directed Topologies

Over the past decades, the synchronization of complex networks with directed topologies has received considerable attention owing to its extensive applications in the realistic world. Design of proportional-integral-derivative (PID) control protocols for achieving synchronization with directed networks is known to be a challenging task. The purpose of this paper is to establish a connection between the PID control protocols and synchronization of complex dynamical networks with directed topologies. Based on the classical complex network model, we investigate global synchronization with PD controller of a balanced strongly connected directed network and global synchronization with PI controller of a strongly connected directed network, and a directed network containing a spanning tree, respectively. Several sets of sufficient conditions are established under which the network reaches global synchronization. The simulation examples are presented to verify the efficiency of the theoretical results.

Synchronization of Coupled Time-Delay Neural Networks With Mode-Dependent Average Dwell Time Switching

In the literature, the effects of switching with average dwell time (ADT), Markovian switching, and intermittent coupling on stability and synchronization of dynamic systems have been extensively investigated. However, all of them are considered separately because it seems that the three kinds of switching are different from each other. This article proposes a new concept to unify these switchings and considers global exponential synchronization almost surely (GES a.s.) in an array of neural networks (NNs) with mixed delays (including time-varying delay and unbounded distributed delay), switching topology, and stochastic perturbations. A general switching mechanism with transition probability (TP) and mode-dependent ADT (MDADT) (i.e., TP-based MDADT switching in this article) is introduced. By designing a multiple Lyapunov-Krasovskii functional and developing a set of new analytical techniques, sufficient conditions are obtained to ensure that the coupled NNs with the general switching topology achieve GES a.s., even in the case that there are both synchronizing and nonsynchronizing modes. Our results have removed the restrictive condition that the increment coefficients of the multiple Lyapunov-Krasovskii functional at switching instants are larger than one. As applications, the coupled NNs with Markovian switching topology and intermittent coupling are employed. Numerical examples are provided to demonstrate the effectiveness and the merits of the theoretical analysis.

Observer-Based Impulsive Synchronization for Neural Networks With Uncertain Exchanging Information

This article investigates synchronization for a group of discrete-time neural networks (NNs) with the uncertain exchanging information, which is caused by the uncertain connection weights among the NNs nodes, and they are transformed into a norm-bounded uncertain Laplacian matrix. Distributed impulsive observers, which possess the advantage of reducing the communication load among NNs nodes, are designed to observe the NNs state. The impulsive controller is proposed to improve the efficiency of the controller. An impulsive augmented error system (IAES) is obtained based on the matrix Kronecker product. A sufficient condition is established to ensure synchronization of the group of NNs by proving the stability of the IAES. An iterative algorithm is given to obtain a suboptimal allowed interval of the impulsive signal, and the corresponding gains of the observer and the controller are derived. The developed result is illustrated by a numerical example.

Quasi-Synchronization of Heterogeneous Networks With a Generalized Markovian Topology and Event-Triggered Communication

We consider the quasi-synchronization problem of a continuous time generalized Markovian switching heterogeneous network with time-varying connectivity, using pinned nodes that are event-triggered to reduce the frequency of controller updates and internode communications. We propose a pinning strategy algorithm to determine how many and which nodes should be pinned in the network. Based on the assumption that a network has limited control efficiency, we derive a criterion for stability, which relates the pinning feedback gains, the coupling strength, and the inner coupling matrix. By utilizing the stochastic Lyapunov stability analysis, we obtain sufficient conditions for exponential quasi-synchronization under our stochastic event-triggering mechanism, and a bound for the quasi-synchronization error. Numerical simulations are conducted to verify the effectiveness of the proposed control strategy.

Invariant set based distributed protocol for synchronization of discrete-time heterogeneous systems with nonlinear dynamics

We in this paper propose an invariant set based distributed control protocol for synchronization of discrete-time heterogeneous multiagent systems. Starting with the assumption that the distributed control input will vanish once a multiagent system achieves synchronization, we attain an easily verifiable method for the nonexistence of synchronous trajectories through characterizing the vector fields of agents. Then, we introduce an invariant set to analyze the limit behaviors of all the synchronous trajectories. Afterwards, based on the assumption that the above invariant set can be characterized by the graph of a function, we design a distributed control protocol to transform the heterogeneous system into an equivalent one, which is composed of two lower dimensional systems. Moreover, for this equivalent system, we provide a synchronization criterion via constructing corresponding Lyapunov-type functions for these two lower dimensional systems, arriving at a synchronization criterion for the original heterogeneous system. Especially, we further improve the applicability of this synchronization criterion by using multiple Lyapunov-type functions. Finally, three examples are presented to demonstrate the validity of the corresponding theoretical results.

Quasi-Synchronization of Discrete-Time Lur'e-Type Switched Systems With Parameter Mismatches and Relaxed PDT Constraints

This paper investigates the problem of quasi-synchronization for a class of discrete-time Lur'e-type switched systems with parameter mismatches and transmission channel noises. Different from the previous studies referring to the persistent dwell-time (PDT) switching signals, the average dwell-time (ADT) constraints combined with the PDT are considered simultaneously in this paper to relax the limitation of dwell-time requirements and to improve the flexibility of the PDT switching signal design. By virtue of the semi-time-varying (STV) Lyapunov function, the synchronization criteria for transmitter-receiver systems in a switched version are obtained to satisfy a prescribed synchronization error bound. An estimate of the synchronization error bound is provided via the reachable set approach and, further, an explicit description of the error bounds is given. Then, sufficient conditions on the existence of STV observers are derived with a predetermined error bound, and the corresponding observer gains are calculated via solving a group of linear matrix inequalities. Finally, the effectiveness and validness of the developed theoretical results are demonstrated via a numerical example.

Trajectory Tracking on Uncertain Complex Networks via NN-Based Inverse Optimal Pinning Control

A new approach for trajectory tracking on uncertain complex networks is proposed. To achieve this goal, a neural controller is applied to a small fraction of nodes (pinned ones). Such controller is composed of an on-line identifier based on a recurrent high-order neural network, and an inverse optimal controller to track the desired trajectory; a complete stability analysis is also included. In order to verify the applicability and good performance of the proposed control scheme, a representative example is simulated, which consists of a complex network with each node described by a chaotic Lorenz oscillator.

Consensus Tracking Control of Switched Stochastic Nonlinear Multiagent Systems via Event-Triggered Strategy

In this paper, the consensus tracking problem is investigated for a class of continuous switched stochastic nonlinear multiagent systems with an event-triggered control strategy. For continuous stochastic multiagent systems via event-triggered protocols, it is rather difficult to avoid the Zeno behavior by the existing methods. Thus, we propose a new protocol design framework for the underlying systems. It is proven that follower agents can almost surely track the given leader signal with bounded errors and no agent exhibits the Zeno behavior by the given control scheme. Finally, two numerical examples are given to illustrate the effectiveness and advantages of the new design techniques.

Cooperative Tracking Control of Multiagent Systems: A Heterogeneous Coupling Network and Intermittent Communication Framework

This paper proposes a heterogeneous coupling network framework to address the cooperative tracking control problem for multiagent systems with dynamic interaction topology and bounded intermittent communication. By considering the underlying dynamic interaction topology and introducing the adjustable heterogeneous coupling weighting parameters, a bounded consensus condition of cooperative tracking control is proposed. With considering a bounded intermittent communication condition, a class of intermittent cooperative tracking control protocol is designed based on the combination of the individual agent dynamic and the exchange of information among the agents under an appropriate consensus speed constraint. It is proved in the sense of Lyapunov that the cooperative tracking control for the closed-loop multiagent systems can be achieved under the dynamic interaction topology, an appropriate feedback gain matrix, and the intermittent communication information of all agents. The results are further extended to the information consensus protocol with intermittent coordinated constraint information. Finally, two examples are presented to verify the effectiveness.

Global Synchronization of Coupled Fractional-Order Recurrent Neural Networks

This paper presents new theoretical results on the global synchronization of coupled fractional-order recurrent neural networks. Under the assumptions that the coupled fractional-order recurrent neural networks are sequentially connected in form of a single spanning tree or multiple spanning trees, two sets of sufficient conditions are derived for ascertaining the global synchronization by using the properties of Mittag-Leffler function and stochastic matrices. Compared with existing works, the results herein are applicable for fractional-order systems, which could be viewed as an extension of integer-order ones. Two numerical examples are presented to illustrate the effectiveness and characteristics of the theoretical results.

Finite-Time Distributed Average Tracking for Second-Order Nonlinear Systems

This paper studies the distributed average tracking (DAT) problem for multiple reference signals described by the second-order nonlinear dynamical systems. Leveraging the state-dependent gain design and the adaptive control approaches, a couple of DAT algorithms are developed in this paper, which are named finite-time and adaptive-gain DAT algorithms. Based on the finite-time one, the states of the physical agents in this paper can track the average of the time-varying reference signals within a finite settling time. Furthermore, the finite settling time is also estimated by considering a well-designed Lyapunov function in this paper. Compared with asymptotical DAT algorithms, the proposed finite-time algorithm not only solve finite-time DAT problems but also ensure states of physical agents to achieve an accurate average of the multiple signals. Then, an adaptive-gain DAT algorithm is designed. Based on the adaptive-gain one, the DAT problem is solved without global information. Thus, it is fully distributed. Finally, numerical simulations show the effectiveness of the theoretical results.

Distributed output-feedback consensus control of multi-agent systems with dynamically changing directed interaction topologies

This paper considers the distributed output-feedback consensus control problem for a multi-agent system with higher order linear dynamics and subject to external disturbance, under dynamically changing directed topologies and weighting factors. An extended state observer (ESO) is first designed to estimate not only the unmeasurable agent states but also the external disturbance. Based on the output of the ESO, a novel distributed control protocol is proposed. We show that, with the application of the proposed control protocol, the consensus can be achieved asymptotically by the group of agents if the union of the directed interaction graphs contains a spanning tree frequently enough. A numerical example is given to verify the effectiveness of the theoretical results.

Consensus Problems Over Cooperation-Competition Random Switching Networks With Noisy Channels

In this paper, distributed iterative algorithms for consensus problems are considered for multiagent networks. Each agent randomly contacts with other agents at each instant and receives corrupted information due to the noisy channel from its neighborhood. Neighbors of each agent are cooperative or competitive, i.e., the elements in the adjacent weight matrix may be positive or negative. In such a framework, asymptotic consensus and mean square consensus problems are investigated, based on random graph theory and stochastic stability theory. The control gains have been designed such that cooperation-competition random multiagent networks can reach almost sure consensus and mean square consensus. Simulation examples are finally given to illustrate the effectiveness of the obtained results.

Swarming Behavior of Multiple Euler-Lagrange Systems With Cooperation-Competition Interactions: An Auxiliary System Approach

In this paper, the swarming behavior of multiple Euler-Lagrange systems with cooperation-competition interactions is investigated, where the agents can cooperate or compete with each other and the parameters of the systems are uncertain. The distributed stabilization problem is first studied, by introducing an auxiliary system to each agent, where the common assumption that the cooperation-competition network satisfies the digon sign-symmetry condition is removed. Based on the input-output property of the auxiliary system, it is found that distributed stabilization can be achieved provided that the cooperation subnetwork is strongly connected and the parameters of the auxiliary system are chosen appropriately. Furthermore, as an extension, a distributed consensus tracking problem of the considered multiagent systems is discussed, where the concept of equi-competition is introduced and a new pinning control strategy is proposed based on the designed auxiliary system. Finally, illustrative examples are provided to show the effectiveness of the theoretical analysis.

Nonfragile State Estimation of Quantized Complex Networks With Switching Topologies

This paper considers the nonfragile $H_\infty $ estimation problem for a class of complex networks with switching topologies and quantization effects. The network architecture is assumed to be dynamic and evolves with time according to a random process subject to a sojourn probability. The coupled signal is to be quantized before transmission due to power and bandwidth constraints, and the quantization errors are transformed into sector-bounded uncertainties. The concept of nonfragility is introduced by inserting randomly occurred uncertainties into the estimator parameters to cope with the unavoidable small gain variations emerging from the implementations of estimators. Both the quantizers and the estimators have several operation modes depending on the switching signal of the underlying network structure. A sufficient condition is provided via a linear matrix inequality approach to ensure the estimation error dynamic to be stochastically stable in the absence of external disturbances, and the $H_\infty $ performance with a prescribed index is also satisfied. Finally, a numerical example is presented to clarify the validity of the proposed method.

Recursive Adaptive Sparse Exponential Functional Link Neural Network for Nonlinear AEC in Impulsive Noise Environment

Recently, an adaptive exponential trigonometric functional link neural network (AETFLN) architecture has been introduced to enhance the nonlinear processing capability of the trigonometric functional link neural network (TFLN). However, it suffers from slow convergence speed, heavy computational burden, and poor robustness to noise in nonlinear acoustic echo cancellation, especially in the double-talk scenario. To reduce its computational complexity and improve its robustness against impulsive noise, this paper develops a recursive adaptive sparse exponential TFLN (RASETFLN). Based on sparse representations of functional links, the robust proportionate adaptive algorithm is deduced from the robust cost function over the RASETFLN in impulsive noise environments. Theoretical analysis shows that the proposed RASETFLN is stable under certain conditions. Finally, computer simulations illustrate that the proposed RASETFLN achieves much improved performance over the AETFLN in several nonlinear scenarios in terms of convergence rate, steady-state error, and robustness against noise.

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.

Model Approximation for Switched Genetic Regulatory Networks

The model approximation problem is studied in this paper for switched genetic regulatory networks (GRNs) with time-varying delays. We focus on constructing a reduced-order model to approximate the high-order GRNs considered under the switching signal subject to certain constraints, such that the approximation error system between the original and reduced-order systems is exponentially stable with a disturbance attenuation performance. The stability conditions and the disturbance attenuation performance are established by utilizing two integral inequality bounding techniques and the average dwell-time method for the approximation error system. Then, the solvability conditions for the reduced-order models for the GRNs are also established using the projection method. Furthermore, the model approximation problem can be transferred into a sequential minimization problem that is subject to linear matrix inequality constraints by using the cone complementarity algorithm. Finally, several examples are provided to illustrate the effectiveness and the advantages of the proposed methods.

Avoiding Congestion in Cluster Consensus of the Second-Order Nonlinear Multiagent Systems

In order to avoid congestion in the second-order nonlinear leader-following multiagent systems over capacity-limited paths, an approach called cluster lag consensus is proposed, which means that the agents in different clusters will pass through the same positions with the same velocities but lag behind the leader at different times. Lyapunov functionals and matrix theory are applied to analyze such cluster lag consensus. It is shown that when the graphic roots of clusters are influenced by the leader and the intracoupling of cluster agents is larger than a threshold, the cluster lag consensus can be achieved. Furthermore, the cluster lag consensus with a time-varying communication topology is investigated. Finally, an illustrative example is presented to demonstrate the effectiveness of the theoretical results. In particular, when the physical sizes of the agents are taken into consideration, it is shown that with a rearrangement and a position transformation, the multiagent system will reach cluster lag consensus in the new coordinate system. This means that all agents in the same cluster will reach consensus on the velocity, but their positions may be different and yet their relative positions converge to a constant asymptotically.

Cooperative Output Regulation of LTI Plant via Distributed Observers With Local Measurement

Over the last decades, distributed output regulation problems have received much consideration due to its extensively applications in real world practices. Traditionally, it is assumed that each node obtains the same signal. However, an important observation is that each agent possesses different measurement due to the observability or configuration of the systems. To solve the output regulation problem in this case, we proposed a cooperative output regulation network, where each agent obtains a part of system output measurement on states of plant and exosystem. Distributed state observers and disturbance observers are designed in order to fuse the observed data. Different from traditional literatures, our design shows that even none of the agents can locally reconstruct the state of exosystem, it is still possible to design a networked system to track the reference signal properly. Conditions that guarantee the existence of parameters are given in the cases, where the network topologies are fixed and time-varying, respectively. The simulation results verify our method very effectively.

Synchronization of Coupled Reaction-Diffusion Neural Networks With Directed Topology via an Adaptive Approach

This paper investigates the synchronization issue of coupled reaction-diffusion neural networks with directed topology via an adaptive approach. Due to the complexity of the network structure and the presence of space variables, it is difficult to design proper adaptive strategies on coupling weights to accomplish the synchronous goal. Under the assumptions of two kinds of special network structures, that is, directed spanning path and directed spanning tree, some novel edge-based adaptive laws, which utilized the local information of node dynamics fully are designed on the coupling weights for reaching synchronization. By constructing appropriate energy function, and utilizing some analytical techniques, several sufficient conditions are given. Finally, some simulation examples are given to verify the effectiveness of the obtained theoretical results.

Global Pinning Synchronization of Complex Networks With Sampled-Data Communications

This paper investigates the global pinning synchronization problem for a class of complex networks with aperiodic samplings. Combined with the Writinger-based integral inequality, a new less conservative criterion is presented to guarantee the global pinning synchronization of the complex network. Furthermore, a novel condition is proposed under which the complex network is globally pinning synchronized with a given performance index. It is shown that the performance index has a positive correlation with the upper bound of the sampling intervals. Finally, the validity and the advantage of the theoretic results obtained are verified by means of the applications in Chua's circuit and pendulum.

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.

Adaptive Antisynchronization of Multilayer Reaction-Diffusion Neural Networks

In this paper, an antisynchronization problem is considered for an array of linearly coupled reaction-diffusion neural networks with cooperative-competitive interactions and time-varying coupling delays. The interaction topology among the neural nodes is modeled by a multilayer signed graph. The state evolution of a neuron in each layer of the coupled neural network is described by a reaction-diffusion equation (RDE) with Dirichlet boundary conditions. Then, the collective dynamics of the multilayer neural network are modeled by coupled RDEs with both spatial diffusion coupling and state coupling. An edge-based adaptive antisynchronization strategy is proposed for each neural node to achieve antisynchronization by using only local information of neighboring nodes. Furthermore, when the activation functions of the neural nodes are unknown, a linearly parameterized adaptive antisynchronization strategy is also proposed. The convergence of the antisynchronization errors of the nodes is analyzed by using a Lyapunov-Krasovskii functional method and a structural balance condition. Finally, some numerical simulations are presented to demonstrate the effectiveness of the proposed antisynchronization strategies.

Analysis and Design of Synchronization for Heterogeneous Network

In this paper, we investigate the synchronization for heterogeneous network subject to event-triggering communication. The designed controller for each node includes reference generator (RG) and regulator. The predicted value of relative information between intermittent communication can significantly reduce the transmitted information. Based on the event triggering strategy and time-dependent threshold, all RGs can exponentially track the target trajectory. Then by the action of regulator, each node synchronizes with its RG. Meanwhile, a positive lower bound is obtained for the interevent intervals. Numerical example is given to demonstrate the effectiveness of the proposed event triggering strategy.