Distributed finite-time optimization for networked Euler–Lagrange systems under a directed graph

Abstract

In this paper, we investigate the finite-time distributed optimization problem for multiple Euler–Lagrange systems. A new distributed optimization control scheme is presented to achieve the state agreement in finite time while minimizing the sum of each agent’s local cost function. The proposed algorithm has the advantage of being able to achieve distributed finite-time optimization consensus under general unbalanced connected directed communication graphs. By virtue of finite-time Lyapunov theory and convex optimization, the finite-time convergence for the algorithm is analyzed. A numerical example is also presented to illustrate the effectiveness of the obtained results.