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

Tracking Control of Heterogeneous Multiagent Systems With Intrinsic Nonlinear Dynamics in Noisy and Time-Delayed Environments

This article investigates the tracking control problem of heterogeneous multiagent systems (MASs) with intrinsic nonlinear dynamics in noisy and time-delayed environments. First, a stability criterion for nonlinear stochastic delay systems with multiplicative noise and time-varying delay is proposed by applying the appropriate Lyapunov-Krasovskii functional. Then, based on the proposed stability criterion, sufficient conditions are derived for mean square (m.s.) and almost sure (a.s.) tracking of heterogeneous MASs with intrinsic nonlinear dynamics. Afterward, the above sufficient conditions further degenerate to integrator heterogeneous MASs. In particular, when the time-delay vanishes, the explicit conditions are obtained for the integrator heterogeneous MASs in the form of scalar inequalities, which can intuitively reflect the relationship between noise intensity and control gains. Finally, simulation results validate the effectiveness of the proposed control protocol.

Pinning Synchronization for Stochastic Complex Networks With Randomly Occurring Nonlinearities: Tackling Bit Rate Constraints and Allocations

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.

Hierarchical prescribed-time bipartite consensus for multiple Euler-Lagrange systems with input-to-output redundancy and directed matrix-weighted signed graph

This paper studies the prescribed-time bipartite consensus problem for multiple Euler-Lagrange systems (MELSs) under directed matrix-weighted signed graph, in which input-to-output redundancy, external disturbances and uncertain dynamic terms have been taken into consideration. Firstly, this paper proposes the prescribed-time hierarchical control (PTHC) algorithm to tackle the aforesaid issue. It is worth pointing out that the convergence time can be arbitrarily prescribed based on actual engineering needs. Then, the corresponding sufficient conditions for achieving the prescribed-time bipartite consensus are obtained by invoking Lyapunov stability analysis. Eventually, the numerical simulation results are performed, which vividly reflect the effectiveness and feasibility of the developed control algorithm.

Fully Distributed Adaptive Event-Triggered Control of Networked Systems With Actuator Bias Faults

In this article, the problem of distributed synchronization of networked systems with actuator bias faults is investigated. To effectively use the limited network bandwidth and avoid the requirement of global information, a novel adaptive event-triggered state feedback controller and a dynamic triggering law are designed jointly by employing a projection operator approach. The proposed synchronization scheme is different from existing ones that have focused on designing controllers and triggering laws independently. Besides, our scheme is extended to design an observer-based distributed adaptive event-triggered controller and corresponding dynamic triggering law when the system states are unmeasurable. Theoretical analysis shows that under the two different distributed event-triggered synchronization schemes, the following three results can be obtained: 1) fully distributed synchronization can be achieved without knowing global information associated with the underlying communication topology and node's scale; 2) continuous communication among adjacent nodes can be avoided for both designed controllers and dynamic triggering laws; and 3) exclusion of Zeno phenomenon is shown by contradiction. Finally, the effectiveness of the proposed algorithms is verified through three numerical examples.

Couple-Group Consensus of Cooperative-Competitive Heterogeneous Multiagent Systems: A Fully Distributed Event-Triggered and Pinning Control Method

This article discusses the couple-group consensus for heterogeneous multiagent systems via event-triggered and pinning control methods. Considering cooperative-competitive interaction among the agents, a novel group consensus protocol is designed. As inducing the time-correlation threshold function, a class of fully distributed event-triggered conditions without depending on any global information is proposed. Utilizing the Lyapunov stability theory, some sufficient conditions are obtained. Under hybrid event triggered and pinning control, pinning control strategies are first introduced. It is shown that under the proposed strategies, all agents can asymptotically achieve pinning couple-group consensus with discontinuous communication in a fully distributed way. Furthermore, the Zeno behavior for each agent is overcome. Finally, the reduction of the systems' controller update frequency and the correctness of our conclusions are illustrated by some simulations.

Bit-Rate Conditions for the Consensus of Quantized Multiagent Systems Based on Event Triggering

This article investigates the asymptotic consensus problem for multiple discrete-time agents with general dynamics under event-triggered sampling. In such multiagent systems (MASs), the information exchanged between neighboring agents is quantized and transmitted through a digital communication network. Due to the limited bandwidth, it is impossible for agents to capture the precise states of neighbors and only their quantized version can be received, which may degrade or even break the consensus of these MASs. In order to ensure the desired consensus and save the occupied network bandwidth, a model-based event-triggering strategy is well co-designed with a dynamic quantization method. Under the proposed strategy, the error between the real state and its estimated version at neighbors is always bounded by an event-triggering function, which is also taken to compute an upper bound on the control inputs of all agents. We derive a sufficient bit-rate condition required for the desired asymptotic consensus. That condition is mainly determined by the dynamics and communication network topology of agents. Since our event-triggering strategy takes advantage of the extra information extracted from the event-triggering time instants of all feedback packets, the derived bit rate can be lower than that of the conventional periodic sampling strategies, while still ensuring the consensus of the concerned MAS. Simulations are done to illustrate the advantages of the derived bit-rate condition.