Matrix-weighted consensus for multi-agent systems with sampled-data

This paper researches the consensus issue for multi-agent systems on matrix-weighted directed fixed and undirected switching network topologies by sampled data control method which saves resources and is more practical. Using the sampled information, the distributed control laws are designed under two network topologies, respectively. Under directed fixed network topology, the consensus conditions based on the sampling period and the eigenvalues of Laplacian matrix are deduced by matrix theory and analysis theory. Under undirected switching network topology, by using Lyapunov stability theory, the consensus conditions based on the sampling period and switched network topologies are built. Lastly, two simulation examples are offered to verify the validity of the obtained results.     

Distributed tracking control of second-order multi-agent systems with sampled data

This paper studies the leader–follower consensus problem of second-order multi-agent dynamical systems with fixed and stochastic switching topologies in a sampled-data setting. A distributed linear consensus protocol is designed to track an active leader, where the current position information of neighbor agents and self-velocity data are utilized. A necessary and sufficient condition is established under fixed and directed topology for reaching consensus, which depends on the sampling period and control gain parameters. A sufficient condition is obtained under the Markov switching topology case. Finally, some numerical simulations are provided to verify the effectiveness of the theoretical results.     

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.     

Event-triggered bipartite consensus for nonlinear multi-agent systems under switching topologies: A time-varying gain method

In this paper, the event-triggered bipartite consensus problem is investigated for nonlinear multi-agent systems under switching topologies, only part of topologies contain directed spanning tree rooted at the leader. First, a dynamic bipartite compensator is constructed based on relative output information to provide control signal. Then, the time-varying gain method is adopted to propose a compensator-based event-triggered control protocol without Zeno behavior. Notably, the control protocol proposed achieves the bipartite consensus while reducing update frequency effectively. Moreover, a low conservative switching law is designed by the topology-dependent average dwell time strategy, which fully considers the differences among topologies and provides an independent average dwell time for each topology. As an extension, the nonlinear multi-agent systems with non-zero input of leader are further studied. Finally, a practical example is presented to demonstrate the feasibility of proposed control protocol.     

Distributed dynamic event-triggered consensus control for multi-agent systems under fixed and switching topologies

This paper is devoted to the dynamic event-triggered consensus problem of general linear multi-agent systems under fixed and switching directed topologies. Two distributed dynamic event-triggered strategies, where internal dynamic variables are involved, are introduced for each agent to achieve consensus asymptotically. Compared with the existing static triggering strategies, the purposed dynamic triggering strategies result in larger inter-execution times and less communication energy among agents. In addition, neither controller updates nor triggering threshold detections require continuous communication in the purposed control strategies. It is also proven that the Zeno behavior is strictly ruled out under fixed and switching directed topologies. Finally, the effectiveness of the theoretical analysis is demonstrated by numerical simulations.     

Event-triggered consensus of nonlinear multi-agent systems with stochastic switching topology

This paper is concerned with a leader-follower consensus problem for networked Lipschitz nonlinear multi-agent systems. An event-triggered consensus controller is developed with the consideration of discontinuous state feedback. To further enhance the robustness of the proposed controller, modeling uncertainty and switching topology are also considered in the stability analysis. Meanwhile, a time-delay equivalent approach is adopted to deal with the discrete-time control problem. Particularly, a sufficient condition for the stochastic stabilization of the networked multi-agent systems is proposed based on the Lyapunov functional method. Furthermore, an optimization algorithm is developed to derive the parameters of the controller. Finally, numerical simulation is conducted to demonstrate the effectiveness of the proposed control algorithm.     

Event-triggered tracking control for couple-group multi-agent systems

This paper mainly investigates the event-triggered tracking control for couple-group multi-agent systems in a disturbance environment, where the topology of the agents is switching. Consensus protocol is designed for the case that some agents reach a consistent value, while the other agents reach another consistent value. Then, event-triggered control laws are designed to reduce the frequency of individual actuation updating for discrete-time agent dynamics. Moreover, by applying the Lyapunov function method, a sufficient condition of couple-group consensus is established in terms of a matrix inequality when the communication topology is switching. Finally, simulation examples are given to demonstrate the effectiveness of the proposed methods.     

Consensus analysis for multi-agent systems via periodic event-triggered algorithms with quantized information

In this article, a novel distributed event-triggered control protocol for the consensus of second-order multi-agent systems with undirected topology is studied. Based on the proposed control protocol, the event-triggered condition is evaluated only at every sampling instant. The control input for each agent will be updated with local information if and only if its condition is violated. Both ideal and quantized relative state measurements are considered under this framework. Some sufficient conditions for achieving consensus are derived using spectral properties of edge Laplacian matrix and the discrete-time Lyapunov function method. Finally, numerical examples are given to demonstrate the effectiveness of our theoretical results.     

Event-triggered leader-following consensus of multi-agent systems under semi-Markov switching topology with partially unknown rates

An event-triggered leader-following consensus problem for multi-agent systems with nonlinear dynamics was investigated in this study. The interaction topologies among the agents that we considered are randomly switched ones, governed by a semi-Markov process with partially unknown rates. By building the state error model between the leader and followers, the consensus problem is first converted into a stability problem. Moreover, an event-triggered transmission scheme based on sampling data was proposed to reduce communication redundancy. The consensus controller and event-triggered parameters can be designed effectively. By constructing a Lyapunov–Krasovskii functional (LKF) with a triple integral, the sufficient conditions required to guarantee the event-triggered consensus can be reached with respect to the linear matrix inequalities (LMIs). Ultimately, the validity of the theoretical results is demonstrated by a numerical example.     

A fully distributed approach for consensus of multi-agent systems under multiple state-variables-dependent interaction topologies

In this paper, the consensus problem of multi-agent systems with general linear dynamics is studied. Motivated by the MIMO communication technique, a general framework is considered in which different state variables are exchanged in different independent interaction topologies. This novel framework could improve the control system design flexibility and potentially improve the system performance. Fully distributed consensus control laws are proposed and analyzed for the settings of fixed and switching multiple topologies. The control law can be applied using only local information. And the control gain can be designed depending on the dynamics of the individual agent. By transforming the overall multi-agent systems into cascade systems, necessary and sufficient conditions are provided to guarantee the consensus of the overall systems under fixed and switching state variable dependent topologies, respectively. Two simulation examples are provided to illustrate the effectiveness of the proposed theoretical results.     

Neural-network-based consensus of multiple Euler-Lagrange systems with an event-triggered mechanism

This paper addresses the consensus problem for a class of multiple Euler-Lagrange systems, where agents communicate with neighbors under an event-triggered mechanism. Due to the more complex dynamical characteristics, the consensus problem of multiple Euler-Lagrange systems is more challenging than that of ordinary second-order multi-agent systems. In this study, we assume that the inertia matrix, the Coriolis and centrifugal term, and the gravitational torque are totally unknown, then a protocol is derived by integrating the Lyapunov functional method, neural network approximation and adaptive control techniques. In addition, the event-triggered mechanism effectively reduces the communication traffic, and the Zeno behavior is well excluded. By a demonstrative example, the effectiveness of the protocol is illustrated.     

Formation consensus for discrete-time heterogeneous multi-agent systems with link failures and actuator/sensor faults

In this paper, a distributed control protocol is presented for discrete-time heterogeneous multi-agent systems in order to achieve formation consensus against link failures and actuator/sensor faults under fixed and switching topologies. A model equivalent method is proposed to deal with the heterogeneous system consists of arbitrary order systems with different parameters. Based on graph theory and Lyapunov theory, stability conditions to solve formation consensus problem are developed for the underlying heterogeneous systems with communication link failures. In order to tolerate actuator/sensor faults, a distributed adaptive controller is proposed based on fault compensation. The desired control is designed by linear matrix inequality approach together with cone complementarity linearisation algorithm. After applying the new control scheme to heterogeneous systems under the directed topologies with link failures and faults, the resulting closed-loop heterogeneous system is validated to be stable. The effectiveness of the new formation consensus control strategy and its robustness are verified by simulations.     

Integral sliding-mode fixed-time consensus tracking for second-order non-linear and time delay multi-agent systems

In this paper, fixed-time consensus tracking problems under directed interaction topologies for second-order non-linear multi-agent systems with disturbance and second-order multi-agent systems with input delay are investigated. Two continuous integral terminal sliding modes are designed, which can effectively eliminate the singularity and chattering. Correspondingly, two fixed-time distributed control protocols are proposed based on the designed continuous ITSM to ensure that the consensus tracking are achieved in fixed-time. It is shown that the upper bounds of settling time are regardless of initial conditions. The rigorous proofs are given by employing Lyapunov stability theory and fixed-time stability theory. Simulations are provided to verify the effectiveness of the theoretical results.     

Event-triggered H∞ filtering control for a class of distributed parameter systems with Markovian switching topology

The H_∞ filtering problem for distributed parameter systems with stochastic switching topology is investigated in this paper based on event-triggered control scheme. The switching topology which subjects to a Markovian chain is considered in filter design because of the communication uncertainty of practical networks. An event-triggered mechanism as a sampling scheme is developed aiming at the benefit of reducing the computation load or saving the limited network resources. Based on some novel integral inequalities, the improved delayed method is proposed for the H_∞ filtering control problem with event-triggered scheme. Moreover, by employing stochastic stability theory, filters with Markovian jump parameters are designed to guarantee that the stochastically mean square stability and H_∞ performance of the underlying error system. Finally, in order to illustrate the applicability of the obtained results, numerical examples are presented.     

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.     

Event-triggered group consensus for multi-agent systems subject to input saturation

This paper investigates group consensus for leaderless multi-agent systems with non-identical dynamics. The consensus protocol is put forward in the form of the distributed event-triggered control subject to saturation, which depends on information from neighboring agents at event-triggered instants. In order to exclude the Zeno behavior and save resources, the given event-triggered condition is detected only at discrete sampling times, where the sampling intervals can be variable. Based on the graph theory, Lyapunov–Krasovskii functional method and by adopting the free-weighting matrix technique, some sufficient group consensus criteria in terms of linear matrix inequalities are derived. Furthermore, optimization problems aiming at maximizing the event-triggered parameter and the consensus region are proposed. Finally, numerical simulations illustrate the effectiveness of the theoretical results.     

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.     

A new class of fixed-time bipartite consensus protocols for multi-agent systems with antagonistic interactions

In this paper, we study the fixed-time consensus problem for multi-agent systems with structurally balanced signed graph. A new class of fixed-time nonlinear consensus protocols is designed by employing the neighbor’s information. By using Lyapunov stability method, states of all agents can be guaranteed to reach agreement in a fixed time under our presented protocols, and the consensus values are the same in modulus but different in sign. Moreover, it is shown that the settling time is not dependent on the initial conditions, and it makes a good convenience to estimate the convergence time by just knowing the graph topology and the information flow of the multi-agent systems. Finally, two numerical examples are given to demonstrate the effectiveness of the proposed consensus protocols.     

Finite-time consensus for the second-order leader-following nonlinear multi-agent system with event-triggered communication

This study discusses the finite-time consensus for the second-order leader-following nonlinear multi-agent system with event-triggered communication. An event-triggered control protocol is established to achieve finite-time consensus, which can effectively avoid the Zeno behavior. Due to the unevenness of an event-triggered controller and the occurrence of the event-triggered condition, it is more challenging to analyze the event-triggered finite-time consensus. Based on the knowledge of graph theory, all agents can achieve finite-time consensus via the proposed event-triggered control protocol. Different from homogeneity, a Lyapunov function is constructed to obtain the settling time. Finally, a simulation example illustrates the validity of the main 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.