Distributed edge-based event-triggered coordination control for multi-agent systems

This paper studies edge-based event-triggered strategies for the average consensus problem in multi-agent systems. To this end, a distributed event-triggered algorithm is presented based on edge information rather than neighbor information, where positive minimum inter-event times are guaranteed between all communication links in the network. Moreover, the triggering mechanism is constructed in a fully distributed way which uses only relative state differences based on local neighborhood information without any global graph topology information. This treatment greatly reduces the communication frequency compared with continuous-time average consensus algorithms. We show that the proposed algorithm makes all agents converge to the average of their initial states asymptotically, and the positive minimum inter-event time for each link is controllable by two corresponding agents through their triggering parameters.