An adaptive exact-penalty-based distributed resource allocation algorithm

被引：0
作者：
Shi X.-S. [1 ]
Xu L. [2 ]
Yang T. [2 ]
机构：
[1] Engineering Research Center of Intelligent Control for Underground Space, Ministry of Education, China University of Mining and Technology, Jiangsu, Xuzhou
[2] The State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Liaoning, Shenyang
来源：
Kongzhi Lilun Yu Yingyong/Control Theory and Applications | 2022年 / 39卷 / 10期
关键词：
adaptive; distance function: non-smooth analysis; distributed resource allocation;
D O I：
10.7641/CTA.2022.10936
中图分类号：
学科分类号：
摘要：
Recently, the distributed resource allocation problem is one of the important issues in multi-agent systems. The distributed resource allocation problem aims to realize the optimal allocation of resources through the information interaction between agents. The local constraints of each agent bring great challenges to the algorithm design. First, an adaptive exact-penalty-based distributed resource allocation algorithm is proposed for the first-order multi-agent system, in which the local constraint is reformed by the distance function. Besides, the priori computation or knowledge of the global cost function is avoided based on the adaptive control scheme. Second, the above proposed first-order algorithm is modified for the second-order multi-agent system based on the tracking control technology. Then, by virtual of the nonsmooth analysis and convex function theory, the rigorous convergence analysis is given. Finally, the proposed algorithms are claimed effectively by the simulation examples. © 2022 South China University of Technology. All rights reserved.
引用
收藏
页码：1937 / 1945
页数：8
相关论文
共 46 条
  • [1] YANG T, YI X, WU J, Et al., A survey of distributed optimization, Annual Reviews in Control, 47, pp. 278-305, (2019)
  • [2] YANG T, YI X, LU S, Et al., Intelligent manufacturing for the process industry driven by industrial artificial intelligence, Engineering, 7, 9, pp. 1224-1230, (2021)
  • [3] YANG Tao, CHAI Tianyou, Research status and prospects of distributed collabotative optimization, Scientia Sinica Technologica, 50, 11, pp. 1414-1425, (2020)
  • [4] XU J, TIAN Y, SUN Y, Et al., Distributed algorithm for composite optimization: Unified framework and convergence analysis, IEEE Transactions on Signal Processing, 69, pp. 3555-3570, (2021)
  • [5] DING T, ZHU S, HE J, Et al., Differentially private distributed optimization via state and direction perturbation in multi-agent systems, IEEE Transactions on Automatic Control, 67, 2, pp. 722-737, (2022)
  • [6] DING T, ZHU S, CHEN C, Et al., Differentially private distributed resource allocation via deviation tracking, IEEE Transactions on Signal and Information Processing over Networks, 67, 2, pp. 222-235, (2021)
  • [7] KIA S S, CORTES J, MARTINEZ S., Distributed convex optimization via continous-time coordination algorithms with discrete-time communication, Automatica, 55, pp. 254-264, (2015)
  • [8] YANG Tao, XU Lei, YI Xinlei, Et al., Event-triggered distributed optimization algorithms, Acta Automatica Sinica, 48, 1, pp. 133-143, (2022)
  • [9] CHEN R J, YANG T, CHAI T Y., Distributed accelerated optimization algorithms: Insights from an ODE, Sicence China Technological Sciences, 63, 9, pp. 1647-1655, (2020)
  • [10] YI X, YAO L, YANG T, Et al., Distributed optimization for second-order multi-agent systems with dynamic event-triggered communication, Proceeding of the IEEE Conference on Decision and Control, pp. 3397-3402, (2018)
12345