Distributed Fixed-time Optimization Control for Multi-agent Systems With Set Constraints

被引：0
作者：
Chen G. [1 ]
Li Z.-Y. [1 ]
机构：
[1] College of Automation, Chongqing University, Chongqing
来源：
Zidonghua Xuebao/Acta Automatica Sinica | 2022年 / 48卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Distributed optimization; fixed-time convergence; gradient method; multiagent systems; set constraints;
D O I：
10.16383/j.aas.c190416
中图分类号：
O24 [计算数学];
学科分类号：
070102 ;
摘要：
This paper studies a class of optimization problem with local constraints for multi-agent systems, and a distributed optimization algorithm with fixed-time convergence is proposed. The proposed distributed controller consists of local projection module, consensus module and gradient module. The local projection module is used to ensure that the states converge to the local constraint set in the fixed time; the consensus module with time-varying gain guarantees the fixed-time state consensus; the gradient module with time-varying gain ensures the states converge to the optimal solution in fixed-time. The fixed-time convergence of the proposed algorithm is analyzed by using the convex optimization and the fixed-time Lyapunov theory. Since the upper bound of convergence time for the proposed algorithm does not depend on the initial condition, it possible to predesign the convergence time according to the task requirements. Finally, numerical simulations verify the effectiveness of the theoretical results. © 2022 Science Press. All rights reserved.
引用
收藏
页码：2254 / 2264
页数：10
相关论文
共 35 条
  • [1] Nedic A, Olshevsky A, Rabbat M G., Network topology and communication-computation tradeoffs in decentralized optimization, Proceedings of the IEEE, 106, 5, pp. 953-976, (2018)
  • [2] Xie Pei, You Ke-You, Hong Yi-Guang, Xie Li-Hua, A survey of distributed convex optimization algorithms over networks, Control Theory and Applications, 35, 7, pp. 918-927, (2018)
  • [3] Nedic A, Ozdaglar A., Distributed subgradient methods for multiagent optimization, IEEE Transactions on Automatic Control, 54, 1, (2009)
  • [4] Nedic A, Ozdaglar A, Parrilo P A., Constrained consensus and optimization in multi-agent networks, IEEE Transactions on Automatic Control, 55, 4, (2010)
  • [5] Zhu M H, Martinez S., On distributed convex optimization under inequality and equality constraints, IEEE Transactions on Automatic Control, 57, 1, (2012)
  • [6] Zhang Y Q, Lou Y C, Hong Y G., An approximate gradient algorithm for constrained distributed convex optimization, IEEE/CAA Journal of Automatica Sinica, 1, 1, (2014)
  • [7] Guo F H, Wen C Y, Mao J F, Li G Q, Song Y D., A distributed hierarchical algorithm for multi-cluster constrained optimization, Automatica, 77, pp. 230-238, (2017)
  • [8] Tuck J, Hallac D, Boyd S., Distributed majorization-minimization for laplacian regularized problems, IEEE/CAA Journal of Automatica Sinica, 6, 1, (2019)
  • [9] Shi G D, Johansson K H, Hong Y G., Reaching an optimal consensus: Dynamical systems that compute intersections of convex sets, IEEE Transactions on Automatic Control, 58, 3, (2013)
  • [10] Lu J, Tang C Y., Zero-gradient-sum algorithms for distributed convex optimization: The continuous-time case, IEEE Transactions on Automatic Control, 57, 9, pp. 2348-2354, (2012)
1234