New synchronization criteria for complex delayed dynamical networks with sampled-data feedback control

Set Stabilization of Probabilistic Boolean Control Networks: A Sampled-Data Control Approach

This article investigates the set stabilization of probabilistic Boolean control networks (PBCNs) under sampled-data (SD) state-feedback control within finite and infinite time, respectively. First, the algorithms are, respectively, proposed to find the sampled point set and the largest sampled point control invariant set (SPCIS) of PBCNs by SD state-feedback control. Based on this, a necessary and sufficient criterion is proposed for the global set stabilization of PBCNs by SD state-feedback control within finite time. Moreover, the time-optimal SD state-feedback controller is designed. It is interesting that if the sampled period (SP) is changed, the time of global set stabilization of PBCNs may also change or even the PBCNs cannot achieve set stabilization. Second, a criterion for the global set stabilization of PBCNs by SD state-feedback control within infinite time is obtained. Furthermore, all possible SD state-feedback controllers are obtained by using all the complete families of reachable sets. Finally, three examples are presented to illustrate the effectiveness of the obtained results.

Fixed-time synchronization criteria for complex networks via quantized pinning control

In this paper, fixed-time (FDT) synchronization of complex networks (CNs) is considered via quantized pinning controllers (QPCs). New control schemes with logarithmic quantization are designed, which not only can reduce control cost but also can save channel resources. The QPC with sign function can be used more generally than the QPC without sign function, but the QPC without sign function can be utilized to overcome the chattering phenomenon in some existing results. Based on designed Lyapunov function and different control schemes, several FDT synchronization criteria expressed by linear matrix inequalities (LMIs) are presented. Moreover, a numerical example is presented to illustrate the theoretical results.

Distributed synchronization control of complex networks with communication constraints

This paper is concerned with the distributed synchronization control of complex networks with communication constraints. In this work, the controllers communicate with each other through the wireless network, acting as a controller network. Due to the constrained transmission power, techniques such as the packet size reduction and transmission rate reduction schemes are proposed which could help reduce communication load of the controller network. The packet dropout problem is also considered in the controller design since it is often encountered in networked control systems. We show that the closed-loop system can be modeled as a switched system with uncertainties and random variables. By resorting to the switched system approach and some stochastic system analysis method, a new sufficient condition is firstly proposed such that the exponential synchronization is guaranteed in the mean-square sense. The controller gains are determined by using the well-known cone complementarity linearization (CCL) algorithm. Finally, a simulation study is performed, which demonstrates the effectiveness of the proposed design algorithm.