An Optimal Algorithm for High-order Multi-Agent Systems with Event-Triggered Communication

The paper mainly talks about the distributed optimal issue under the continuous-time high-order multi-agent system with event-triggered communication. Every agent possesses its local convex cost function only known by itself. and our aim is to minimize the sum of all the local cost functions and make the agents convergent to the optimal point through the communication between the agents. Utilizing the knowledge of convex analysis and graph theory, we propose a distributed protocol with event-triggered communication under a undirected graph for the high-order multi-agent system. Through Lyapunov method, the agents gradually converging to the optimal point is testified. In addition, we provide an example to validate the proposed protocol.