A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems. (September 2018)

• Record Type: Journal Article
• Authors: Chen, Gang; Li, Zhiyong
• Is Part Of: Automatica. Volume 95(2018)
• Page Start: 539
• Page End: 543
• Publication Date: 2018-09
• Subjects: Distributed algorithm -- Convex optimization -- Equality constraint -- Fixed-time convergence -- Multi-agent system; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2018.05.032
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: This technical paper presents a distributed continuous-time algorithm to solve multi-agent optimization problem with the team objective being the sum of all local convex objective functions while subject to an equality constraint. The optimal solutions are achieved within fixed time which is independent of the initial conditions of agents. This advantage makes it possible to off-line preassign the settling time according to task requirements. The fixed-time convergence for the proposed algorithm is rigorously proved with the aid of convex optimization and fixed-time Lyapunov theory. Finally, the algorithm is valuated via an example.