Memory-based event-triggered leader-following consensus for T-S fuzzy multi-agent systems subject to deception attacks

In this paper, the problem of fuzzy model-based leader-following consensus control for multi-agent systems (MASs) under deception attacks is investigated. For the sake of alleviating the communication burden, a novel memory-based event-triggered scheme (METS) is first proposed for the considered MASs to reduce redundant data transmission, and the leader-following consensus can be achieved faster with a smaller adjustment error by applying the historical released packets. Considering the designed METS and upper-bounded attacks synthetically, the closed-loop fuzzy system model is well established. Furthermore, with the help of Lyapunov-Krasovskii technique, some sufficient conditions are derived to ensure the consensus of MASs subject to deception attacks. Finally, a simulation example is introduced to manifest the effectiveness of the proposed method.     

Consensus of multi-Agent systems with one-Sided lipschitz nonlinearity via nonidentical double event-Triggered control subject to deception attacks

As for the multi-agent systems (MASs) with time-varying switching subject to deception attacks, the leader-following consensus problem is studied in this article. The one-sided Lipschitz (OSL) condition is utilized for the nonlinear functions, which makes the results more general and relaxed than those obtained by Lipschitz condition. The nonidentical double event-triggering mechanisms (ETMs) are adopted for only a fraction of agents, and each agent transmits the data according to its own necessity. Semi-Markov process modeling with time-varying switching probability is adopted for switching topology and deception attacks occurring in transmission channel are considered. By using the cumulative distribution function (CDF) and the linear matrix inequality (LMI) technology, sufficient conditions for MASs to achieve consensus in mean square are obtained. An effective algorithm is presented to obtain the event-based control gains. The merits of the proposed control scheme are demonstrated via a simulation example.     

Stochastic leader-following consensus of discrete-time nonlinear multi-agent systems with multiplicative noises

This paper studies the stochastic leader-following consensus problem of discrete-time nonlinear multi-agent systems (MASs) with multiplicative noises. The measurement information obtained from agents’ neighbors is inevitably affected by communication uncertainties, where the multiplicative noise is one of the important communication uncertainties. Multiplicative noises together with the intrinsic nonlinear dynamics bring more difficulties in the consensus control design under the leader-following topology. To solve the problem, the parameter-dependent Lyapunov functions are constructed to analyze the consensus control of first-order and second-order MASs, respectively. Some sufficient conditions, explicitly related to control gains, intensity of multiplicative noises and the Lipschitz constant regarding nonlinear functions, are established for reaching the mean square (m.s.) and almost sure (a.s.) leader-following consensus. Specifically, the obtained conditions are some scalar inequalities, which are more convenient in engineering application. Numerical simulations are conducted to validate the theoretical results.     

Bipartite consensus of multi-agent systems with matched uncertainty via fully distributed edge-based event-triggered mechanism

The leader-following bipartite consensus of multi-agent systems (MASs) with matched uncertainty is investigated by using the fully distributed asynchronous edge-based event-triggered mechanism. Firstly, event-triggered mechanisms are constructed for each edge and the leader to decrease the consumption of system resources. The state feedback and output feedback control protocols are proposed, which do not depend on the global values of the communication graph. Secondly, sufficient conditions for the bipartite consensus of MASs are obtained by Lyapunov stability theory. Thirdly, the feasibility of the proposed event-triggered mechanisms is further verified by exclusion of Zeno phenomenon. Finally, the effectiveness of control protocol is illustrated by simulation.     

Switched observer-based dynamic event-triggered consensus of multi-agent systems under DoS attacks

This paper investigates the observer-based consensus control for high-order nonlinear multi-agent systems (MASs) under denial-of-service (DoS) attacks. When the DoS attacks appear, the communication channels are destroyed, and the blocked information may ruin the consensus of MASs. A switched state observer is designed for the followers to observe the leader’s state whether the DoS attacks occur or not. Then, a dynamic event-triggered condition is proposed to reduce the consumption of communication resources. Moreover, an observer-based and dynamic event-triggered controller is formulated to achieve leader-following consensus through the back-stepping method. Additionally, the boundedness of all closed-loop signals is obtained based on the Lyapunov stability theory. Finally, the simulation results demonstrate the effectiveness of the presented control strategy under DoS attacks.     

Consensus of discrete-time multi-agent systems over packet dropouts channels

In this paper, we investigate the consensus problem for discrete linear multi-agent systems (MASs) with Markovian packet dropouts. Both identical and nonidentical packet dropouts are studied. For the discrete-time MASs under identical packet dropouts, we present the expectation of the total sojourn time of packet dropouts and successful message transmission, the switching number from packet dropouts to successful message transmission, and the awaken number of packet dropouts and successful message transmission. Based on these expectations, a linear consensus controller is designed through analyzing the transient properties of the Markov process such that the MASs can reach consensus almost surely for any initial distribution of packet dropouts. When it comes to the nonidentical packet dropouts where all the packets are independent and stochastic, a Markovian-lossy-channel based switching model (MLCBS model) is proposed. Based on the MLCBS model, we also propose an easy-to-implement linear consensus controller such that the MASs with nonidentical packet dropouts can achieve consensus almost surely. Finally, the theoretical results are illustrated by simulation examples.     

Dynamic event-triggered adaptive semi-global bipartite consensus of linear multi-agent systems with input saturation under fixed and switching topologies

This paper investigates dynamic event-triggered adaptive leader-following semi-global bipartite consensus (SGBC) of multi-agent systems (MASs) with input saturation. A dynamic event-triggered adaptive control (DETAC) protocol is presented, where the triggering function can regulate its threshold value dynamically. It’s turned out that the SGBC can be achieved via the DETAC protocol under some inequalities. Then, the proposed DETAC protocol is extended to solve bipartite consensus under jointly connected topology. Furthermore, the Zeno behaviors will be avoided. Finally, the rationality of proposed DETAC protocols are tested by simulation results.     

Bounded average consensus for multi-agent systems with switching topologies by event-triggered persistent dwell time control

This paper is concerned with the consensus of multi-agent systems (MASs) with switching topologies. A norm-bounded event-trigger is designed where non-global information of the communication graph is involved. By directly employing the asynchronous event-triggered neighbor state information, a distributed persistent dwell time (PDT) based predictor-like consensus protocol is proposed. By the proposed scheme, the dynamics of local subsystems are allowed to be unstable during fast switching time intervals as well as the jump time instants, meanwhile, the bounded average consensus of overall MASs can be achieved. In addition, the Zeno-phenomena is naturally excluded. Numerical example is provided to demonstrate the effectiveness of the proposed method.     

Estimator design of discrete-time switched positive linear systems with average dwell time

This paper is concerned with the problem of state estimation for a class of discrete-time switched positive linear systems (SPLS) with average dwell time (ADT) switching. By utilizing the multiple linear copositive Lyapunov function (MLCLF) approach, the ADT switching is introduced to tackle the state estimation of the underlying system. Some sufficient conditions of the existence of the estimator are derived in terms of a set of linear matrix inequalities for the underlying systems with ADT switching. The results for the SPLS under arbitrary switching can be easily obtained by reducing MLCLF to the common linear copositive Lyapunov function used for the system in the literature. Finally, a numerical example is given to show the validity of the obtained theoretical results.     

Improved results on consensus of nonlinear MASs with nonhomogeneous Markov switching topologies and DoS cyber attacks

In this paper, the issue of leader-following consensus for nonlinear multi-agent systems (NMASs) suffered from uncertain nonhomogeneous Markov switching (UNMS) and denial-of-service (DoS) cyber attacks is studied. In contrast with the existing results on NMASs with a fixed topological structure, the communication topology is governed by an UNMS jump process, where the transition rates (TRs) of UNMS are considered to be partially known or completely unknown. Also, the changes of communication topologies caused by frequently DoS cyber attacks are taken into consideration, which will destroy the chains of communication and lead to network paralysis in NMASs. In view of this, based on the stochastic technique and multiple Lyapunov functional protocol, mean-square leader-following consensus conditions related to NMASs with the UNMS and DoS cyber attacks are proposed. Finally, the effectiveness of the presented theoretical results is validated by numerical example.     

Leader-following consensus considering effects of agents on each other via impulsive control: A topology dependent average dwell time approach

This paper intends to investigate the consensus problem of a nonlinear multi-agent system with new nonlinear terms added to the dynamics of each agent in the leader-following framework with impulsive control. The main contribution of this paper is introducing these new terms expressing the effect of each agent on neighbor agents. The new terms called effect terms (ETs) are considered with time-varying delay. Moreover, the communication interactions among all agents are addressed by a set of consensusable and unconsensusable switching topologies. In particular, the topology-dependent average dwell time (TDADT), one of the significant practical analysis methods for switched systems, has been calculated for each topology. The globally uniformly exponentially stability (GUES) for the consensus error dynamics is analyzed by employing algebraic graph theory and a multiple discontinuous Lyapunov function approach (MDLF) regarding separate Lyapunov functions for impulse instants. Furthermore, sufficient conditions in terms of linear matrix inequalities (LMIs) are derived to ensure that consensus can be achieved. Finally, the effectiveness of the theoretical analysis is corroborated by a numerical example.     

Leader-following consensus of multi-agent systems with connectivity-mixed attacks and actuator/sensor faults

This study investigates the leader-following consensus issue of multi-agent systems subject to simultaneous connectivity-mixed attacks, actuator/sensor faults and disturbances. Connectivity-mixed attacks are remodeled into connectivity-maintained and connectivity-paralyzed topologies in a switched version, and actuator/sensor faults are established with unified incipient-type and abrupt-type characteristics. Then, unknown input observer-based decoupling and estimation are incorporated to achieve unknown state and fault observations with the normalized technique, and the leader-following consensus-based compensation to faults, resilience to attacks and robustness to disturbances are also realized with the neighboring output information and sensor fault estimation through the distributed framework. Criteria of achieving exponential leader-following consensus of multi-agent systems under cyber-physical threats are derived with dual attack frequency and activation rate indicators. Simulation example is conducted to exemplify the validation and merits of the proposed leader-following consensus algorithm.     

Dynamic event-triggered leader-following consensus control of a class of linear multi-agent systems

We address the leader-following tracking consensus issue for a class of linear multi-agent systems (MASs) via dynamic event-triggered (DET) approaches in this paper. The DET communication mechanism is introduced by an additional internal dynamic variable, and is developed to schedule agents’ data transmission. State observers are also employed to tackle the scenario wherein inner information of follower agents are not available for measurement. And then, state-based and observer-based distributed control proposals are proposed on the basis of dynamic event-triggered mechanism (DETM), respectively. To avoid continuous measurement information monitor, we present a technical approach for generation of the combinational information from their own neighboring agents only at event instants. The stabilities of the resulting closed-loop systems, both state-feedback one and output-feedback one, are rigorously analyzed in theory, and it is proven that all signals in the closed-loop system are bounded and Zeno behavior is also excluded. Simulation examples are presented to illustrate the theoretical claims.     

Finite-time consensus of neutrally stable multi-agent systems in the presence of input saturation

The problem of finite-time consensus of linear multi-agent systems subject to input saturation is investigated and two control protocols are presented for leaderless and leader-following cases, respectively. The leaderless multi-agent systems with proposed non-smooth protocol can achieve consensus in finite time. The consensus protocol designed for leader-following case with directed topology can solve the finite-time consensus problem, where a priori constraint is adopted to deal with input saturation. Furthermore, the settling time is explicitly derived using finite-time Lyapunov theory. Finally, the effectiveness of the theoretical results is illustrated with several numerical simulations.     

Distributed optimal consensus protocol for high-order integrator-type multi-agent systems

Optimal consensus control of high-order multi-agent systems (MASs) modeled by multiple integrator-type dynamics is studied. A fully distributed optimal control protocol that achieves the specific consensus behavior is designed for MASs with linear dynamics, where topology-dependent conditions are removed. Further, a distributed consensus protocol for high-order nonlinear MASs with one-sided Lipschitz continuity is presented using the optimization approach, and the optimal solution can be obtained by solving a standard algebraic Riccati equation. Some numerical examples are finally provided to illustrate the effectiveness of the presented approaches.     

Quantized consensus in second-order multi-agent systems via event-trigger control with sampled data

This paper addresses the quantized consensus problem of second-order multi-agent systems (MASs) where the topology has a directed spanning tree. An event-trigger control protocol (ETCP) is proposed by designing a combined threshold. The combined threshold not only reduces more event triggers than the state-dependent threshold, but also is more practical than the time-dependent threshold. For further reducing computation resources and transmission cost, the sampled data, self-trigger scheme and data quantization are employed together. Under the proposed ETCP, the sufficient condition is derived to guarantee the quantized consensus of second-order MASs. Finally, the comparison experiments are conducted to demonstrate the superiority of ETCP based on the combined threshold.     

Event-triggered bipartite leader-following consensus of second-order nonlinear multi-agent systems under signed digraph

This paper investigates the bipartite leader-following consensus of second-order multi-agent systems with signed digraph topology. To significantly reduce the communication burden, an event-triggered control algorithm is proposed to solve the bipartite leader-following consensus problem, where a novel event-triggered function is designed. Under some mild assumptions on the network topology and node dynamics, a sufficient condition is derived using Lyapunov stability method and matrix theory to guarantee the bipartite consensus. In particular, it is shown that the continuous communication can be avoided and the Zeno-behavior can be excluded for the designed event-triggered algorithm. Numerical simulations are presented to illustrate the correctness of the theoretical analysis.     

Fixed-time bipartite consensus of nonlinear multi-agent systems under directed signed graphs with disturbances

This paper considers the fixed-time bipartite consensus of nonlinear multi-agent systems (MASs) subjected to external disturbances. Under the directed signed networks, several sufficient conditions are proposed to guarantee the fixed-time bipartite consensus of MASs with or without leaders, respectively. Some discontinuous control protocols are developed to realize fixed-time tracking bipartite consensus of MASs with a leader. Moreover, the fixed-time leaderless bipartite consensus under directed signed graph are discussed as well. Two numerical examples are given to verify the effectiveness of the theoretical results.     

Fixed-time consensus for stochastic multi-agent systems with discontinuous dynamics via quantized control

In this study, the fixed-time consensus (FDTC) for stochastic multi-agent systems (MASs) with discontinuous inherent dynamics is investigated via quantized control. Firstly, an improved lemma for fixed-time (FDT) stability is derived and several more precise estimations for settling time (SLT) are gained by using certain special functions. Secondly, a more general MAS containing discontinuous inherent dynamics and stochastic perturbations is considered, which is closer to practical life. Thirdly, to overcome the limitation of communication, two kinds of quantized control protocols are designed. Besides, in the light of the graph theory, non-smooth analysis, fixed-time (FDT) stability and stochastic analysis theory, some sufficient conditions are put forward to achieve FDTC of MASs. Finally, the validity of the derived theoretical results is testified by two numerical examples.     

Event-triggered learning consensus of networked heterogeneous nonlinear agents with switching topologies

In this work, a lifted event-triggered iterative learning control (lifted ETILC) is proposed aiming for addressing all the key issues of heterogeneous dynamics, switching topologies, limited resources, and model-dependence in the consensus of nonlinear multi-agent systems (MASs). First, we establish a linear data model for describing the I/O relationships of the heterogeneous nonlinear agents as a linear parametric form to make the non-affine structural MAS affine with respect to the control input. Both the heterogeneous dynamics and uncertainties of the agents are included in the parameters of the linear data model, which are then estimated through an iterative projection algorithm. On this basis, a lifted event-triggered learning consensus is proposed with an event-triggering condition derived through a Lyapunov function. In this work, no threshold condition but the event-triggering condition is used which plays a key role in guaranteeing both the stability and the iterative convergence of the proposed lifted ETILC. The proposed method can reduce the number of control actions significantly in batches while guaranteeing the iterative convergence of tracking error. Both rigorous analysis and simulations are provided and confirm the validity of the lifted ETILC.