Distributed dynamic event-triggered algorithm with minimum inter-event time for multi-agent convex optimisation

In this paper, the distributed convex optimisation problem of the multi-agent system over an undirected network is investigated, in which the local objective function of each agent is only known by itself. To reduce the communication consumption between agents, a state-based dynamic event-triggered algorithm with positive minimum inter-event time (MIET) is provided, where the aperiodic information communication only occurs at some discrete triggering time instants. Moreover, the sampling control technology is combined into the previous event-triggered algorithm for verifying the event-triggered condition at every sampling time, instead of continuous access. Finally, several numerical simulations are presented for illustrating and verifying the proposed algorithms.

Automated summary

This paper investigates the distributed convex optimisation problem of multi-agent system over an undirected network. A state-based dynamic event-triggered algorithm is proposed to reduce communication consumption between agents. Sampling control technology is integrated into the event-triggered algorithm. Numerical simulations are presented to illustrate the effectiveness of the proposed algorithms.