Adaptive Leader‐Following Consensus for Uncertain Nonlinear Multi‐Agent Systems

This paper is concerned with the adaptive leader‐following consensus for first‐ and second‐order uncertain nonlinear multi‐agent systems (NMASs) with single‐ and double‐integrator leader, respectively. Remarkably, the control coefficients of the followers need not belong to any known finite interval, which makes the systems in question essentially different from those in the related works. Moreover, parameterized unknowns exist in the nonlinearities of the followers, and unknown control input is imposed on the leader, which make the problems difficult to solve. To compensate for these uncertainties/unknowns, the leader‐following consensus protocols are constructed by employing adaptive technique for the first‐order and the second‐order NMASs. Under the designed adaptive consensus protocols and the connected graph, the leader‐following consensus is achieved. Finally, two examples are given to show the effectiveness of the proposed leader‐following consensus protocols.     

Distributed Adaptive Event‐Triggered Control for Leader‐Following Consensus of Multi‐Agent Systems

This paper studies the leader‐following consensus problem for Lipschitz nonlinear multi‐agent systems using novel event‐triggered controllers. A distributed adaptive law is introduced for the event‐based control strategy design such that the proposed controllers are independent of system parameters and only use the relative states of neighboring agents, and hence are fully distributed. Due to the introduction of an event‐triggered control scheme, the controller of the agent is only triggered at it's own event times, and thus reduces the amount of communication between controller and actuator and lowers the frequency of controller updates in practice. Based on a quadratic Lyapunov function, the event condition which uses only neighbor information and local computation at trigger instants is established. Infinite triggers within a finite time are also verified to be impossible. The effectiveness of the theoretical results are illustrated through simulation examples.     

Event‐Based Semiglobal Consensus of Homogenous Linear Multi‐Agent Systems Subject to Input Saturation

In this paper, we consider the semiglobal leader‐following consensus of general linear multi‐agent systems subject to input saturation. First, an event‐triggered control protocol is provided to ensure semiglobal consensus of the multi‐agent systems, in which the agents should continuously monitor the information of their neighbors. Second, a self‐triggered control protocol is proposed to guarantee the semiglobal consensus of the multi‐agent systems, in which the agents only have access to the information of their neighbors in discrete time instants. Moreover, both event‐triggered control protocol and self‐triggered control protocol are proved to be Zeno‐free, that is, the inter‐event times for such two protocols have positive lower bounds. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed event‐based semiglobal consensus protocols.     

Distributed Containment Control for Nonlinear Multi‐Agent Systems with Time‐Delayed Protocol

In this paper, the containment control problem is considered for nonlinear multi‐agent systems with directed communication topology. Under the guidance of designed distributed communication protocols with/without previous state information, the followers are expected to converge to a dynamic convex hull spanned by multiple leaders. Two multi‐step algorithms are proposed to construct the corresponding protocols, the state feedback protocol and the delay‐coupled protocol, under which the containment control can be achieved asymptotically. Furthermore, it is found that the delay‐coupled protocol is rather sensitive to time delays. That is, real‐time tracking will become impossible by only using long‐dated previous state information. Finally, a numerical example is given to demonstrate the applicability and efficiency of the proposed schemes.     

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

Event‐Triggered Control for Multi‐Agent Systems with General Directed Topology and Time Delays

Recent years have witnessed a growing interest in event‐triggered strategies for coordination and cooperative control of multi‐agent systems. However, the most previous works and developments focus on the interactive network that has no communication delays. This paper deals with the consensus problem of an agent system with event‐triggered control strategy under communication time delays. We first propose a time delays system model, then present a novel event triggering function that not only avoids continuous communication but also excludes the Zeno behavior. Furthermore, we provide the consensus analysis using an inequality technique instead of the traditional linear matrix inequality method, and we demonstrate that the inter‐event times for each agent are strictly positive, which implies that the Zeno behavior can be excluded. Finally, simulation results show the effectiveness of the proposed approach and illustrate the correctness of the theoretical results.     

Fixed‐Time Consensus of Multi‐Agent Systems with Directed and Intermittent Communications

This paper proposes a new class of nonlinear protocols for fixed‐time consensus in networked agents with directed and intermittent communications. First of all, based on the assumption of a common positive dwell time for all successful links, it is theoretically shown that the asymptotical consensus can be achieved if the interaction topology with some fixed length of time has a spanning tree. Then, if the length sum of time intervals, over which the directed interaction topology contains a spanning tree, is larger that a threshold value, which is independent of initial conditions, the system will solve a fixed‐time consensus problem. Furthermore, in light of the mirror operation principle of graph theory, the proposed protocol is extended to solve the fixed‐time consensus problem if a common positive dwell time for all active links is strongly connected without the detailed balanced condition. Finally, the effectiveness of the theoretical results is illustrated by simulation results.     

Leader‐Following Consensus of Multi‐Agent System with Diffusion

This paper is concerned with the leader‐following consensus problem for multi‐agent systems consisting of one stationary leader and multiple cooperative followers, where the controlling effect of each follower depends on its own state. It is noted that the influence of diffusion among followers is taken into account and the system is modeled by reaction‐diffusion equations. With the assumption of the followers' initial states, a linear control protocol is designed. Based on algebraic graph theory, the method of energy estimates, and Sobolev embedding theorem, the sufficient conditions guaranteeing the leader‐following consensus under the proposed control protocol are provided. Numerical examples illustrate the effectiveness of the theoretical results.     

Event‐Triggered Control for Couple‐Group Multi‐Agent Systems with Logarithmic Quantizers and Communication Delays

This paper mainly investigates the event‐triggered control for couple‐group multi‐agent systems with communication delay. Logarithmic quantization is considered in the communication channels. Event‐triggered control laws are adopted to reduce the frequency of individual actuation updating for discrete‐time agent dynamics. The proposed protocol is efficient as long as the quantization levels are dense enough, i.e. the density of quantization levels goes to infinity is a sufficient condition for the asymptotic consensus of the multi‐agent systems. It turns out that the bounded consensus depends on not only the density of quantization levels, but also the updating strategy of events. Finally, a simulation example is given to demonstrate the effectiveness of the proposed methods.     

NNs‐Based Event‐Triggered Consensus Control of a Class of Uncertain Nonlinear Multi‐Agent Systems

We are concerned with the consensus problem for a class of uncertain nonlinear multi‐agent systems (MASs) connected through an undirected communication topology via event‐triggered approaches in this paper. Two distributed control strategies, the adaptive centralized event‐triggered control one and adaptive distributed event‐triggered control one, are presented utilizing neural networks (NNs) and event‐driven mechanisms, where the advantages of the proposed control laws lie that they remove the requirement for exact priori knowledge about parameters of individual agents by taking advantage of NNs approximators and they save computing and communication resources since control tasks only execute at certain instants with respect to predefined threshold functions. Also, the trigger coefficient can be regulated adaptively with dependence on state errors to ensure not only the control performance but also the efficiency of the network interactions. It is proven that all signals in the closed‐loop system are bounded and the Zeno behavior is excluded. Finally, simulation examples are presented for illustration of the theoretical claims.     

Distributed Fixed‐Time Coordinated Tracking for Nonlinear Multi‐Agent Systems Under Directed Graphs

This paper is concerned with the fixed‐time coordinated tracking problem for a class of nonlinear multi‐agent systems under detail‐balanced directed communication graphs. Different from conventional finite‐time coordinated tracking strategies, the fixed‐time approach developed in this paper guarantees that a settling time bound is prescribed without dependence on initial states of agents. First, for the case of a single leader, a distributed protocol based on fixed‐time stability techniques is proposed for each follower to accomplish the consensus tracking in a fixed time. Second, in the presence of multiple leaders, a new distributed protocol is proposed such that states of followers converge to the dynamic convex hull spanned by those of leaders in a fixed time. In addition, for a class of linear multi‐agent systems, sufficient conditions that guarantee the fixed‐time coordinated tracking are provided. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results.     

Observer‐Based Consensus Tracking for Nonlinear Multi‐Agent Systems With Intermittent Communications

This paper addresses the observer‐based consensus tracking problem of multi‐agent systems with intermittent communications. The agent dynamics are modeled as general linear systems with Lipschitz nonlinearity. Under the assumption that each agent can intermittently share its relative output with neighbors, a class of an observer‐type protocol is proposed, and the consensus tracking problem can be converted further into the stability problem of the nonlinear switching systems. Using a combined tool from M matrix theory, switching theory and the averaging approach, a multi‐step algorithm is presented to construct the observer gains and protocol parameters, and the sufficient criteria established not only can ensure the state estimates convergence to the real values but also can guarantee the follower states synchronize to those of the leader. The obtained results reveal the relationships among the communication rate, the convergence rate, and the dwell time of switching topologies. Finally, the theoretical findings are validated by a numerical example.     

Distributed Consensus of Multi‐Agent Systems with Input Faults and Time‐Varying Delays

This work studies the consensus problem of multi‐agent systems with input faults and time‐varying delays. The assumed faults in the system are loss of effectiveness of actuator and nonlinear additive term mixed with nominal input. For system faults that are nonlinear, constraints of constant norm‐bounded, sector nonlinearity, and unbounded nonlinearity with known basis functions are considered. Employing a Lyapunov–Krasovskii functional method, delay dependent consensus criteria are established to show the exponential behavior of the system. Finally, one simulation example is solved to demonstrate the advantage of the obtained results.     

含通信延时及输入延时的线性多智能体的一致性

针对通信延时及输入延时并存的情况下,研究具有一般线性动态特性的高阶多智能体在固定且无向的网络拓扑下的一致性.通过将多智能体的特征方程分解为一系列低阶的因子,一致性问题转换为一系列低阶因子的稳定性分析问题,降低了问题的分析复杂度.进一步地,分析无延时情况下多智能体达到一致性的控制增益的取值范围,即增益的稳定区间.当从稳定区间选取一个固定的控制增益时,应用频率扫描高级聚类法分析多个因子在两延时参数空间中的稳定性,并由此获得多智能体延时无关及延时相关的一致性结论.一个说明性的例子验证了分析结论.     

L2 − L∞ Consensus Control for High‐Order Multi‐Agent Systems with Nonuniform Time‐Varying Delays

This paper considers consensus problem for high‐order multi‐agent systems with dynamically changing topologies and nonuniform time‐varying delays. By means of the tree‐type transformation approach, the model transformation is conducted and the consensus problem is converted into an L₂ ? L_∞ control problem of equivalent reduced‐order systems. Furthermore, a Lyapunov‐Krasovkii function is constructed for stability analysis and sufficient conditions in terms of linear matrix inequalities are derived to ensure the consensus with the prescribed L₂ ? L_∞ performance. A numerical simulation is provided to verify the correctness of the theoretical results.     

Consensus of Fractional Multi‐Agent Systems Using Distributed Adaptive Protocols

This paper is concerned with the adaptive consensus problem of fractional multi‐agent systems for both the linear and nonlinear cases. Distributed adaptive protocols are designed, respectively, for linear and nonlinear fractional multi‐agent systems, under which consensus is achieved for any undirected connected communication graph without using any global information. Furthermore, the leader‐following problem is studied as an extension. Finally, two numerical examples are given to demonstrate the effectiveness of the obtained results.     

Consensus Control in Linear Multi‐Agent Systems with Current and Sampled Partial Relative States

This paper studies consensus in linear multi‐agent systems with current and sampled partial relative states. A distributed linear consensus protocol is designed, where both current and sampled relative states are utilized. A necessary and sufficient condition for consensus in this setting is established. The notion of the consensus region is then introduced and analyzed for third‐order systems, provided that each agent can only know its relative positions and velocities. It is shown that the consensus regions are stable to control gains and sampling period. Additionally, how to choose the control gains and the sampling period is given for consensus in third‐order systems. Finally, an example is given to verify and illustrate the analysis.     

“Kronecker Basis” Based Average Consensus Analyses for High‐Order Linear Multi‐Agent Systems with Multiple Time Delays

This paper investigates the average consensus for multi‐agent systems governed by high‐order linear dynamics with multiple time delays. Necessary and sufficient conditions for high‐order average consensus under balanced communication topology are provided by using a newly defined mathematical concept – the Kronecker basis. Furthermore, previous studies for average consensus governed by first‐order, or high‐order integrator can be regarded as special cases of our results. Simulation results are employed to demonstrate the effectiveness of our results for high‐order average consensus.     

Fixed‐Time Synchronization of a Class of Second‐Order Nonlinear Leader‐Following Multi‐Agent Systems

The fixed‐time synchronization problem for a class of second‐order nonlinear multi‐agent systems with a leader‐follower architecture is investigated in this paper. To achieve the fixed‐time tracking task, the design procedure is divided into two steps. At the first step, a distributed fixed‐time observer is designed for each agent to estimate the leader's state in a fixed time. Then, at the second step, based on the technique of adding a power integrator, a fixed‐time tracking controller for each agent is proposed such that the estimate leader's state can be tracked in a fixed time. Finally, an observer‐based fixed‐time controller is developed such that the leader can be tracked by all the followers in a fixed time, which can be predetermined. Simulations are presented to verify the effectiveness of the proposed approach.     

Admissible Consensus of Multi‐Agent Singular Systems

Consensus problems are studied for both continuous‐time and discrete‐time multi‐agent singular systems with time‐invariant and directed communication topologies. Under restricted system equivalence of singular agents, sufficient and necessary conditions are obtained for admissible consensus ability with static protocols, which are based on both the relative information of the dynamic states and the absolute information of the static states. For a network of continuous‐time singular systems, the existence of admissible consensualization can be cast into strong stabilizability of the agent dynamics. Once discrete‐time multi‐agent singular systems satisfy the condition of reaching nontrivial final consensus states, strong stabilizability is a sufficient condition to achieve admissible consensualization. Two algorithms are proposed to construct two protocols, which are based on a linear matrix inequality and a modified Riccati equation, respectively. Finally, the algorithms are illustrated by two simulation examples.