.png){kind=icon}
.png){kind=icon}
Return
Predefined-time distributed optimization algorithms for a class of resource allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2024.107009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, two predefined -time distributed optimization algorithms are proposed to solve a class of resource allocation problem (RAP) with equation constraint. One is a distributed predefined continuous -time optimization algorithm and the other is an accelerated distributed predefined discrete iterative optimization algorithm. Compared with existing finite -time and fixed -time distributed optimization algorithms, the proposed algorithms can solve the RAP in any given time. The core of the optimization algorithms is to design two predefined -time multi -agent weighted consensus algorithms. Especially in the design of discrete algorithm, the performance of optimization algorithm has been greatly improved through information composite interaction. Finally, the proposed algorithms are used to solve the problem of power resource allocation in power grids, and five sets of simulation instances are provided to verify the effectiveness and advantages of the proposed algorithms.
Keywords:
Distributed optimization algorithm
Resource allocation
Equality constraint
Convex optimization
Predefined-time convergence
Journal
J
IF:
3.7
Papers:
6.3K
Citations:
1.5W