Distributed nonsmooth resource allocation algorithms over second-order multi-agent systems

被引：0
|
作者：
Shi X.-S. [1 ,2 ]
Sun J.-Y. [3 ]
Xu L. [3 ]
Yang T. [3 ]
机构：
[1] School of Artificial Intelligence, Anhui University, Hefei
[2] Key Laboratory of Intelligent Control and Optimization for Industrial Equipment, Ministry of Education, Dalian University of Technology, Dalian
[3] The State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang
来源：
Kongzhi yu Juece/Control and Decision | 2023年 / 38卷 / 05期
关键词：
adaptive; initialization-free; nonsmooth; resource allocation; second-order systems;
D O I：
10.13195/j.kzyjc.2022.1262
中图分类号：
学科分类号：
摘要：
The distributed resource allocation problem aims to allocate a mount of resources under some local constraints while minimizing the total cost function. First, based on the Karush-Kuhn-Tucker conditions, an initialization-free distributed optimization algorithm is proposed for second-order multi-agent systems over an undirected connected network. The global equality constraint dual variable is developed with a proportional-integral control, and the local convex function inequality constraint dual variable is sought adaptively. Based on the set-value LaSalle’s invariance principle, it is shown that the designed algorithm asymptotically converges to the optimal point if the global cost function is nonsmooth convex. Then, the proposed algorithm is extended to Euler-Lagrange multi-agent systems over an undirected connected network. Furthermore, by virtual of the Barbalat’s lemma, it is shown that the proposed algorithm asymptotically converges to the optimal solution if the global cost function is nonsmooth convex. Finally, several numerical examples are used to illustrate the performance of the proposed algorithms. © 2023 Northeast University. All rights reserved.
引用
收藏
页码：1336 / 1344
页数：8
相关论文
共 53 条
  • [41] Zou Y, Meng Z Y, Hong Y G., Adaptive distributed optimization algorithms for Euler-Lagrange systems, Automatica, 119, (2020)
  • [42] Zhang Y Q, Deng Z H, Hong Y G., Distributed optimal coordination for multiple heterogeneous Euler-Lagrangian systems, Automatica, 79, pp. 207-213, (2017)
  • [43] Deng Z H, Liang S., Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems, Automatica, 99, pp. 246-252, (2019)
  • [44] An L W, Yang G H., Collisions-free distributed optimal coordination for multiple Euler-Lagrangian systems, IEEE Transactions on Automatic Control, 67, 1, pp. 460-467, (2022)
  • [45] Zou Y, Huang B M, Meng Z Y., Distributed continuous-time algorithm for constrained optimization of networked Euler-Lagrange systems, IEEE Transactions on Control of Network Systems, 8, 2, pp. 1034-1042, (2021)
  • [46] Zhang Y Q, Liu C Q, Tian Y P., Distributed constrained aggregative games of uncertain Euler-Lagrange systems under unbalanced digraphs, Autonomous Intelligent Systems, 2, 1, (2022)
  • [47] Guo Z J, Chen G., Fully distributed optimal position control of networked uncertain Euler-Lagrange systems under unbalanced digraphs, IEEE Transactions on Cybernetics, 52, 10, pp. 10592-10603, (2022)
  • [48] Wang Z, Liu J X, Wang D, Et al., Distributed cooperative optimization for multiple heterogeneous Euler-Lagrangian systems under global equality and inequality constraints, Information Sciences, 577, pp. 449-466, (2021)
  • [49] Deng Z H., Distributed algorithm design for aggregative games of Euler-Lagrange systems and its application to smart grids, IEEE Transactions on Cybernetics, 52, 8, pp. 8315-8325, (2022)
  • [50] Olfati-Saber R, Murray R M., Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic Control, 49, 9, pp. 1520-1533, (2004)
123456