Search

This studies distributed event‐triggered consensus of general linear multi‐agent systems subject to quantised relative state measurements, where both uniform quantisation and logarithmic quantisation are considered. First, a distributed event‐triggered controller with uniform quantised relative states is proposed, where the controller of each agent is updated by properly defined event trigger function, so that bounded consensus can be achieved in finite‐time and Zeno behaviour is excluded. Then, a computational method is proposed to calculate the continuous states in event trigger function. Thus, continuous communication between neighbouring agents can be avoided. The results are extended to the situation of logarithmic quantisation, and a sufficient condition is proposed to guarantee the complete consensus. Finally, a numerical example is given to verify the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a new hybrid control algorithm to achieve leader–follower flocking in multi-agent systems. In the algorithm, the position is transmitted continuously, whereas the velocity is utilized discretely, which is governed by a distributed event-triggered mechanism, and the neighbors’ velocity is not required to detect the event-triggered condition for each agent. It is shown that stable flocking is achieved asymptotically while the connectivity of networks is preserved. A numerical example is provided to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

In this study, the consensus problem of second‐order multi‐agent systems (MAS) with position‐only information is studied. Allowable sampling period for which second‐order consensus can be achieved is obtained with two impulsive consensus algorithms. It is shown that if there is at least one eigenvalue of the Laplcian matrix with a non‐zero imaginary part, consensus cannot be achieved for sufficiently small or large impulsive periods for both algorithms. Furthermore, the convergence performance of the MAS is optimised. Convergence speed, asymptotical decay factor and per‐step decay factor of the error energy are utilised to investigate the convergence performance, and the relationship among impulsive period, topology structure and convergence performance is derived. Finally, numerical examples are given to validate our theoretical results. [ABSTRACT FROM AUTHOR]