A Consensus Algorithm Based on Delay Independent/Dependent Two Methods
Keywords:
Multi-agent systems; Finite-time consensus; Communication delay; Lyapunov-Razumikhin theorem; Delay-dependent consensus.Abstract
In this paper, we study the distributed finite time event triggered two-part consistent control for multi-agent systems on networks. It is proved that when the adversarial network is balanced by a spanning tree, a sufficient and necessary condition is established to ensure that all agents reach the same size but opposite sign consistent value, and a consensus algorithm based on the delay independent/dependent methods is proposed. This algorithm can be used when the agent part accesses its neighbor's signal. Compared with the asymptotic control algorithm, the proposed control method has better anti-interference performance and convergence speed. The simulation results verify the validity of the theoretical results.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.