IEEE Transactions on Cybernetics最新文献

In this article, the ultimately bounded synchronization problem is investigated for a class of discrete-time stochastic complex networks under the pinning control strategy. Communication between system nodes and the remote controller is facilitated via wireless networks subject to bit rate constraints. The system model is distinguished by the inclusion of randomly occurring nonlinearities. A coding-decoding transmission mechanism under constrained bit rates is introduced to characterize the digital transmission process. To achieve synchronization of the network nodes with the unforced target node, a pinning controller is specifically devised based on the information from partially selected nodes. Through the application of the stochastic analysis method, a sufficient condition is derived for ensuring the mean-square boundedness of the synchronization error system. In addition, an optimization algorithm is introduced to address bit rate allocation and the design of desired controller gains. Within the presented theoretical framework, the correlation between the mean-square synchronization performance and bit rate allocation is further elucidated. To conclude, a simulation example is provided to substantiate the efficacy of the recommended pinning control approach.

This article studies the secure consensus control problem of multiagent systems (MASs) with a nonzero input leader subject to denial-of-service (DoS) attacks. The introduction of backup topologies makes it possible for MASs to actively defend against DoS attacks. Subsequently, a novel active defense method consisting of two types of state observers, an adaptive topology switching mechanism, and switching controllers is proposed, which can ensure the leader-follower bound consensus even if DoS attacks hinder the interaction between agents. Within such a defense framework, the switching mechanism, driven by the predefined performance index and designed monitoring function, can automatically search for a healthy communication graph among backup topologies. Concurrently, the observer-based switching control strategy will be modified to match the corresponding topology, in which the universal observer and controller parameters in different topologies are obtained by solving linear matrix inequalities. It should be highlighted that the developed defense scheme not only removes the limitations of existing results on the duration and frequency of DoS attacks but also ensures the same upper bound of consensus error before and after DoS attacks. Finally, several simulation examples for different systems illustrate the efficiency and superiority of the theoretical results.

In practical applications, sampled-data systems are often affected by unforeseen physical constraints that cause the sampling interval to deviate from the expected value and fluctuate according to a certain probability distribution. This probability distribution can be determined in advance through statistical analysis. Taking into account this stochastic sampling interval, this article focuses on addressing the leader-following sampled-data consensus problem for linear multiagent systems (MASs) with successive packet losses. First, the relationship of the equivalent sampling interval between two successive update instants is established, taking into account the double randomness introduced by both SPLs and stochastic sampling. Then, the equivalent discrete-time MAS is obtained, and the overall leader-following consensus problem is formulated as a stochastic stability problem of the equivalent system by incorporating the sampled-data consensus protocol and properties of the Laplacian matrix. Based on the equivalent the discrete-time system, a consensus criterion is derived under a directed graph by using the Lyapunov theory and leveraging a vectorization technique. By the introduction of a matrix reconstruction approach, the mathematical expectation of a product of three matrices, including the system matrix and its transpose, can be determined. Then, the consensus protocol gain is designed. Finally, an example is provided to validate our theoretical results.

A new type of containment maneuvering protocols for multiple marine surface vehicles (MSVs) is developed to follow a parameterized path in this work, where the tracking errors are constrained within finite time and the information needed to be transmitted is quantized during coordination. To achieve containment maneuvering of multiple MSVs, a two-objective coordinated control framework is proposed. For the geometric objective, by developing tan-type barrier Lyapunov functions (BLFs) and extended Lyapunov condition-based finite-time guidance laws, the performance of the parameterized line-of-sight guidance framework, including convergence speed and tracking error constraints, is improved. For the dynamic objective, based on quantized control strategy and smooth saturation functions, novel bounded containment maneuvering protocols are proposed to dramatically alleviate the burden of communications among MSVs and ensure more faster dynamic behavior on tracking the path updating speed. Both theoretical analysis and experimental tests with comparative studies illustrate the validity of the proposed containment maneuvering strategy.