Jing-Wen Yi

Adaptive pinning cluster synchronization of fractional-order complex dynamical networks

The problem about cluster synchronization of fractional-order CDNs is studied via a pinning adaptive approach in this paper. Based on the stability theory of fractional differential equations, some sufficient criteria for local and global cluster synchronization of fractional-order CDNs are derived. In this paper, the coupling configuration matrix can be asymmetric as well as reducible and the inner coupling matrix can also be asymmetric. Moreover, the number of pinning nodes in each cluster can be evaluated. Especially, when the coupling strength is large enough and the coupling configuration matrix is symmetric, cluster synchronization can be achieved via pinning a single node in each cluster. Finally, some typical examples are given to illustrate the correctness and effectiveness of our results, a surprising finding is that the synchronization performance will become better as the fractional order decreases in this simulation.

Synchronisation of complex dynamical networks with additive stochastic time-varying delays

In this letter, a class of complex dynamical networks with additive stochastic time-varying delays is investigated. Two kinds of delays in complex dynamical networks are taken into consideration, one is called the nodes-induced delay in this paper, and the other is the network-induced delay. Both of the delays are assumed to obey different stochastic distributions. By utilising a novel Lyapunov–Krasovskii functional and stochastic analysis techniques, a sufficient criterion is obtained in the form of linear matrix inequalities to ensure the synchronisation of the complex dynamical networks. Finally, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method.

Reaching cluster consensus in multi-agent systems

In this paper, the cluster consensus problem of linearly coupled multi-agent systems in directed networks is studied by constructing a Laplacian of a directed graph. Different from the former work in which the clusters are divided artificially, in this paper, the relationship between the number of the clusters and the Laplacian is revealed. It is obtained that the number of clusters equals to the multiplicity of the zero eigenvalue of the Laplacian. Based on the Algebraic Graph Theory, the Matrix Theory and the Modern Control Theory, a sufficient and necessary condition about the global stability of the cluster consensus in multi-agent system is derived. A numerical example is proposed to illustrate the effectiveness of the method.

Stability and synchronization of directed complex dynamical networks with random packet loss: the continuous-time case and the discrete-time case

This paper presents models for both the continuous-time and discrete-time directed complex dynamical networks (CDNs) with random packet loss, respectively. The packet loss may take place in the communication between every two neighbor nodes. The exponential mean-square stability and the exponential mean-square synchronization for both the continuous-time and discrete-time CDNs with random packet loss are investigated, respectively, by defining the packet loss probability matrix. In addition, two special cases, the CDN with synchronous packet loss and the CDN with node-dependent packet loss, are discussed. Numerical examples are provided for illustrations. Copyright

Assignment-driven multi-consensus in second-order multi-agent systems via impulsive control with heterogeneous delays

An assignment-driven multi-consensus problem of multi-agent systems with heterogeneous delays is investigated in this paper. By introducing a concept of intelligent adjustment factor, a distributed impulsive protocol is designed, in which only the delayed sampled relative positions to neighbors and the relative position to the last sampling state are utilized. Combined with the characteristic of impulsive control, three steps of model transformation are performed, and the assignment-driven multi-consensus problem of the original continuous-time system is converted to the stability problem of a discrete-time expanded analogous error system. A necessary and sufficient criterion is derived to guarantee the assignment-driven multi-consensus of the multi-agent system. An interesting simulation is proposed to demonstrate the effectiveness of the theoretical result and reveal the effect of intelligent adjustment factors on the assignment-driven multi-consensus.