location: Current position: Englishhomepage >> Scientific Research >> Paper Publications

Exponential convergence rate of distributed optimisation for multi-agent systems with constraints set over a directed graph

Hits:

Indexed by:期刊论文

Date of Publication:2018-06-12

Journal:IET CONTROL THEORY AND APPLICATIONS

Included Journals:SCIE

Volume:12

Issue:9

Page Number:1201-1207

ISSN No.:1751-8644

Key Words:optimisation; multi-agent systems; directed graphs; Lyapunov methods; exponential convergence rate; distributed optimisation; multi-agent systems; directed graph; novel distributed continuous-time algorithm; identity transformation; Lypaunov stability theory

Abstract:In this study, the authors propose a novel distributed continuous-time algorithm based on projection and gradient to solve the optimisation problem of a multi-agent system under any initialisation manner over a directed graph. The considered cost function is a summation of all local cost functions with local constraints set. The point of the proposed protocol is that a new scheme is proposed to offset the non-zero local gradients of local cost functions at the minimiser. The optimal solution of the proposed algorithm is shown using the variational inequality under some conditions. Moreover, exponential convergence rate of the designed algorithm is verified with the help of the identity transformation and Lypaunov stability theory. Finally, a numerical example and a comparison are provided to demonstrate the effectiveness of the theoretical results obtained.

Pre One:An event-triggered protocol for distributed optimal coordination of double-integrator multi-agent systems

Next One:Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph