.png){kind=icon}
Return
Initialization-Free Distributed Fixed-Time Convergent Algorithms for Optimal Resource Allocation
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2020.3005169.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article considers the distributed fixed-time resource allocation problem subject to global equality and local inequality constraints. In the case that the optimal solutions are strictly feasible, a projection-gradient-based continuous-time algorithm is first proposed to minimize a team of cost functions in the fixed time. As some optimal solutions locate on the boundary of local constraints, we further provide an alternative suboptimal solution based on the epsilon-exact penalty function method. Different from the existing distributed optimal allocation results, the (sub)optimal solutions can be obtained in the fixed time and the optimization protocols can be implemented in an initialization-free manner. Thus, the convergence time can be offline preassigned and the initial states can be chosen arbitrarily such that a better robust performance is achieved for the new algorithms. Case studies of the widely discussed economic dispatch problems are performed to validate the effectiveness of the obtained results.
Keywords:
Convex optimization
fixed-time convergence
penalty function
projection operation
resource allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
.png){kind=icon}
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more