arrow
返回

Fully Distributed Algorithm for Resource Allocation Over Unbalanced Directed Networks Without Global Lipschitz Condition

delete2023-08-01
delete4
PRE
AI
J
Jin Zhang
L
Lu Liu *
X
Xinghu Wang
H
Haibo Ji
DOI:10.1109/TAC.2022.3216972delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This note investigates the distributed optimal resource allocation problem of multiagent systems over unbalanced directed networks under the relaxed condition that the gradients of local cost functions are locally Lipschitz. The objective is to cooperatively drive the decision variables of the agents to the optimal solution, which minimizes the sum of the local cost functions, while ensuring that the network resource constraints and local feasibility constraints are satisfied. A novel distributed algorithm is developed over unbalanced directed network topologies based on the topology balancing technique and adaptive control approach. The developed algorithm is fully distributed in the sense that it depends on neither the global Lipschitz continuity of the gradients nor prior global information about the network connectivity. By regarding the proposed algorithm as a perturbed system, its input-to-state stability with a vanishing perturbation is first established, and asymptotic convergence of the decision variables toward the optimal solution is then proved.
Keyword:
Adaptive control
directed networks
fully distributed
Lipschitz continuous gradient
resource allocation

期刊

IEEE Transactions on Automatic Control 封面图
IEEE Transactions on Automatic Control
IF:
7
论文数:
1.3W
被引数:
6.7W

机构

U
university of science & technology of china, cas
学者数:
3.2W
论文数: 2.7W
被引数: 74
C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容