.png){kind=icon}
.png){kind=icon}
Return
An asynchronous distributed gradient algorithm for economic dispatch over stochastic networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2020.106240.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The economic dispatch problem (EDP) in power systems is usually formulated as a category of convex optimization problems in which the collective cost function is expressed as the sum of all individual objectives of generators. It is inclined to be solved through a distributed way, which is to minimize the total generation cost while meet the demands under generator capability restrictions. In this paper, we consider this class of convex optimization problems that involve coupling linear constraint and individual box constraints. In order to make information communication of network decentralized, reliable and computationally inexpensive, an asynchronous distributed primal-dual optimization algorithm is proposed over stochastic networks. This algorithm allows nodes to use asynchronous communication strategy to update their state, and the step-sizes for seeking the optimum solution are uncoordinated constants. The asynchronous operation for generators takes link failures of networks into account. Under strongly convex assumption on objective functions, it is proved that the proposed algorithm can seek the exact optimal solution with probability one if the expectation of communication network is undirected connected. The effectiveness of the proposed optimization algorithm over stochastic networks is illustrated by provided simulation results.
Keywords:
Economic dispatch problem (EDP)
Distributed optimization algorithm
Asynchronous communication
Uncoordinated step-sizes
Stochastic networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
5
Papers:
1.1W
Citations:
3.1W