Stochastic consensus of discrete-time second-order multi-agent systems with measurement noises and time delays

We study the consensus control of discrete-time second-order multi-agents systems with time delays and multiplicative noises, where the consensus protocol is designed by both the local relative position measurements and each agent’s absolute velocity. Due to the existence of time delays and multiplicative noises, the classical methods for deterministic models with time delays cannot work. In this paper, we apply stochastic stability theorem of discrete-time stochastic delay equations to find some explicit sufficient conditions for both mean square and almost sure consensus. It is proven that for any given noise intensities and time delays, the second-order multi-agent consensus can be achieved by choosing appropriate control gains in the relative position measurement and absolute velocity, respectively. Numerical simulation is given to demonstrate the effectiveness of the proposed protocols as well as the theoretical results.     

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.     

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.     

Prescribed performance bipartite consensus for nonlinear agents with antagonistic interactions: A PI transformation approach

The leaderless, prescribed performance consensus problem for groups of agents with antagonistic interactions is addressed for the first time in this paper. We consider agents modeled by pure feedback nonlinear systems with unknown dynamics and an agent communication network described by a signed digraph with a directed spanning tree. A new proportional and integral (PI) variable transformation is proposed that enables the solution of the problem of leaderless bipartite consensus with prescribed performance by recasting it into a regulation problem with prescribed performance, which in turn we solve by a low complexity distributed control law. The algorithm guarantees uniform boundedness of all closed-loop signals and prescribed performance for the bipartite consensus error. Simulations verify the validity of our theoretical analysis.     

Adaptive bipartite output consensus for heterogeneous multi-agent systems with quantized information: A fixed-time approach

This paper researches the output consensus problem of heterogeneous linear multi-agent systems with cooperative and antagonistic interactions. Two fixed-time state compensator control approaches, one static dynamic and the other distributed adaptive dynamic, are considered for heterogeneous systems subject to logarithmic quantization. Then, a fixed-time output regulation control protocol is constructed to cope with the problem of bipartite output consensus and adaptive fixed-time output consensus of heterogeneous systems which is fully distributed without any global information. Besides, the fully distributed adaptive algorithm is employed to calculate the system matrix of leader and it’s also effectively eliminated the harmful chattering. Finally, two simulations are carried out to testify the feasibility of theoretical results.     

Mean-square consensus of heterogeneous multi-agent systems with communication noises

This paper addresses the mean-square consensus problems of continuous-time heterogeneous multi-agent systems with communication noises. First, in order to attenuate the communication noises, time-varying consensus gains are applied in the consensus algorithm. Then, by using the tools of algebraic graph theory and stochastic analysis, sufficient conditions for the mean-square consensus are given for the cases with and without a leader. Finally, simulations are provided to demonstrate the effectiveness of the proposed algorithms.     

Interventional bipartite consensus on coopetition networks with unknown dynamics

In this paper, an interventional bipartite consensus problem is considered for a high-order multi-agent system with unknown disturbance dynamics. The interactions among the agents are cooperative and competitive simultaneously and thus the interaction network (just called coopetition network in sequel for simplicity) is conveniently modeled by a signed graph. When the coopetition network is structurally balanced, all the agents are split into two competitive subgroups. An exogenous system (called leader for simplicity) is introduced to intervene the two competitive subgroups such that they can reach a bipartite consensus. The unknown disturbance dynamics are assumed to have linear parametric models. With the help of the notation of a disagreement state variable, decentralized adaptive laws are proposed to estimate the unknown disturbances and a dynamic output-feedback consensus control is designed for each agent in a fully distributed fashion, respectively. The controller design guarantees that the state matrix of the closed-loop system can be an arbitrary predefined Hurwitz matrix. Under the assumption that the coopetition network is structurally balanced and the leader is a root of the spanning tree in an augmented graph, the bipartite consensus and the parameter estimation are analyzed by invoking a common Lyapunov function method when the coopetition network is time-varying according to a piecewise constant switching signal. Finally, simulation results are given to demonstrate the effectiveness of the proposed control strategy.     

Distributed bipartite consensus for multi-agent systems with dynamic event-triggered mechanism

This paper address the distributed bipartite consensus problem of multi-agent systems (MASs) under undirected and directed topologies with dynamic event-triggered (DET) mechanism. The relationship among agents not only collaborative interaction but also competitive interaction are taken into account. A novel DET control protocol is raised with internal dynamic variables to guarantee that each agent can reach the bipartite consensus. Compared with the existing static triggering laws, the introduced DET strategy can significantly enlarge the interval time between two triggering instants. In addition, continuous information transmission in either controller updating or between agent and its neighbors is not demanded, which implies that the communication frequency can be extremely decreased. It is also proven that Zeno behavior does not occur. Finally, two numerical examples verify the validity of the presented theoretical results.     

Event-based bipartite consensus of second-order discrete-time multi-agent systems with matrix-weighted signed networks

This article researches the bipartite consensus for discrete-time second-order multi-agent systems on matrix-weighted signed networks, which can describe the inter-dependencies of multidimensional states among states. So as to save limited communication resources, based on the matrix-weighted combined measurements of the position and velocity states, a matrix-weighted event-triggered control algorithm is designed. With the help of the stability theory, variable transformation and the inequality technique, the bipartite consensus conditions which are based on coupling gains, discrete interval, the parameters in the event-triggered rule and communication topology are obtained. Furthermore, the conditions to avoid the controller updating in each discrete-time are supplied. At last, a simulation example is offered to demonstrate the theoretical results.     

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.     

Event-triggered bipartite consensus of second-order multi-agent systems under DoS attacks

This paper is concerned with the secure bipartite consensus of second-order multi-agent systems under denial-of-service (DoS) attacks. The communication network is an antagonistic network, in which there is cooperative or competitive relationship between neighboring agents. Meanwhile, information cannot be transmitted when the system is attacked. A novel event-triggered control algorithm based on sampled data is proposed to save limited resources and exclude the Zeno behavior. By applying the convergence of monotone sequences, graph theory as well as the discrete-time Lyapunov function method, some sufficient conditions on threshold parameters, frequency and duration of DoS attacks, and sampling period are derived to ensure the bipartite consensus under DoS attacks. Finally, the correctness and advantages of theoretical results are demonstrated by a numerical simulation.     

Fixed-time bipartite consensus of nonlinear multi-agent systems using event-triggered control design

This paper focuses on designing a leader-following event-triggered control scheme for a category of multi-agent systems with nonlinear dynamics and signed graph topology. First, an event-triggered controller is proposed for each agent to achieve fixed-time bipartite consensus. Then, it is shown that the Zeno-behavior is rejected in the proposed algorithm. To avoid intensive chattering due to the discontinuous controller, the control protocol is improved by estimating the sign function. Moreover, a triggering function is proposed which avoids continuous communication in the event-based strategy. Finally, numerical simulations are given to show the accuracy of the theoretical results.     

A variable gain impulsive observer for Lipschitz nonlinear systems with measurement noises

This paper investigates the variable gain impulsive observer design problem for Lipschitz nonlinear systems. It is assumed that the measurements are contaminated by noise and received by observer at aperiodic instants. To establish a tractable design condition for impulsive observers, the piecewise linear interpolation method is used to construct the variable gain function. To quantify the impact of the measurement noises and exogenous disturbance on the estimation error, a Lyapunov-based condition for establishing exponential input-to-state stability (EISS) property of the observation error dynamics is presented. Then it is shown that the EISS condition can be expressed as a set of linear matrix inequalities (LMIs) by introducing a piecewise quadratic Lyapunov function. A convex optimization problem is proposed in which the EISS gain is minimized. Comparisons with the existing methods show the effectiveness of the proposed design technique.     

Output consensus of heterogeneous linear systems with quantized information

In this paper, we design two distributed output consensus controllers for heterogeneous linear systems based on internal model principle and then study the quantization effect on the controllers when uniform quantizers are used in the communication channels. The first controller considers the general situation when the internal model state matrix of the system may be unstable and the communication graphs are strongly connected directed graphs. We prove that the bound of the consensus error is proportional to the quantizer parameter with a coefficient related to the size of the network and the property of the communication graphs. The second controller considers the situation when the internal model state matrix is neutrally stable and the communication graphs are undirected connected graphs. In this case, we derive a better bound of the consensus error which is proportional to the quantizer parameter and the coefficient is unrelated to the size of the network when the linear systems are homogeneous. Simulation examples are provided to illustrate the theoretical results.     

Output feedback tracking control for polynomial nonlinear systems with measurement noises and mismatched disturbances

In this paper, the output feedback tracking control problem is investigated for polynomial nonlinear systems (PNSs) with measurement noises and mismatched disturbances. First, in order to suppress measurement noises, a polynomial observer is introduced to simultaneously estimate states and mismatched disturbances. Next, based on the idea of backstepping control, a novel output feedback controller is designed for PNSs to compensate mismatched disturbances. Command filters are employed to avoid the repeated derivatives of virtual control and measurement noises in the recursive controller design. Then, a sufficient condition in terms of the parameter-dependent linear matrix inequality (PDLMI) is derived to guarantee the boundedness of tracking errors and estimation errors. By utilizing the sum of squares (SOS) decomposition technique, the PDLMI is solved to obtain desired controller parameters. Finally, an example of dynamic point-the-bit rotary steerable drilling tool system is performed to demonstrate the effectiveness and feasibility of the proposed strategy.     

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.     

Finite-time and fixed-time bipartite consensus of multi-agent systems under a unified discontinuous control protocol

This paper investigates the issue of finite/fixed-time bipartite consensus (FFTBC) of multi-agent systems with signed graphs. A new unified framework of finite-time and fixed-time bipartite consensus is built via some discontinuous control protocols based on the theory of differential inclusion and set-valued Lie derivative. Under the structurally balanced or unbalanced signed graphs, the goal of FFTBC is reached by a common discontinuous controller with different control gains, which fills the gap in studying FFTBC issues with discontinuous protocols. Some numerical examples with comparisons are given to demonstrate the effectiveness of our designs.     

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.     

Sampled-data-based event-triggered secure bipartite tracking consensus of linear multi-agent systems under DoS attacks

This paper investigates secure bipartite consensus tracking of linear multi-agent systems under denial-of-service(DoS) attacks by using event-triggered control mechanism with data sampling. Both bipartite leader-following and containment tracking consensus are considered in this paper. The event-triggered control protocol using sampled-data information is designed to save limited resources. The communication channels are interrupted by intermittent DoS attacks. Sufficient conditions on the sampling periods, attack frequency and attack duration are obtained to ensure secure bipartite tracking consensus of the multi-agent systems. Finally, simulation example is provided to illustrate the effectiveness of the theoretical results.     

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.