Output Consensus of Heterogeneous Linear Multiagent Systems With Directed Graphs via Adaptive Dynamic Event-Triggered Mechanism

This article investigates the output consensus problem of heterogeneous linear multiagent systems under directed communication graphs. A novel adaptive dynamic event-triggered mechanism is proposed, intending to further save system resources consumed in communication between agents and controller update of agents themselves, and remove the assumption that the global information associated with the communication topology should be known in advance for the design of control parameters. Unlike the existing related adaptive event-triggered algorithms, the proposed algorithm could theoretically guarantee the existence of a strictly positive constant on the interevent time intervals for both communication between agents and controller update. Furthermore, it is shown by the simulation that the addition of a dynamic variable has the potential to further optimize the control cost when compared to the addition of exponential function signal or L1 signal usually adopted in existing adaptive event-triggered mechanisms. Then, the obtained results are extended from the strongly connected graph to the directed communication graph only containing a spanning tree. Finally, numerical simulation results are conducted to demonstrate the effectiveness of the proposed mechanism.