.png){kind=icon}
Return
Distributed initialization-free algorithms for multi-agent optimization problems with coupled inequality constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2020.05.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies a resource optimization problem for a multi-agent network where all agents have local objective functions and local constraint sets. Meanwhile, the decision variables of all the agents need to satisfy a set of globally coupled inequality constraints. Then, a distributed continuous-time algorithm is designed with the help of the nonsmooth analysis theory and projection operator method. The proposed algorithm does not require each agent to send the gradient information of the cost function to its neighbors, which prevents the gradient information of agents leaking out. Moreover, the convergence analysis shows that the proposed algorithm can converge to the optimal solution starting from any initial allocation. Finally, a case study is presented for a resource allocation problem of a hybrid water-power network. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Distributed algorithm
Multi-agent optimization
Nonsmooth function
Coupled inequality constraint
Projection operator
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSaveShareSaveInitialization-free distributed coordination for economic dispatch under varying loads and generator commitment.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveSynthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solutionRSC Advances
RSC AdvancesIF0
PREAI
ShareSavep53 mutations, O6-alkylguanine DNA alkyltransferase activity, and sensitivity to procarbazine in human brain tumorsCancer
CancerIF0
PREAI
ShareSave
ShareSave
View more