.png){kind=icon}
.png){kind=icon}
Return
Distributed Continuous-Time Algorithm for Economic Dispatch Problem Over Switching Communication Topology
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.3041504.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This brief mainly studies the economic dispatch problem (EDP) in smart grid. The purpose of this problem is to minimize the total power generation cost under the conditions of balance between supply and demand and power generation capacity constraints. A distributed continuous-time solver is proposed, which only requires the sign of relative dual variable information between neighbors, which ensures the privacy of the generators. In addition, the algorithm does not require initialization and allows online changes of network topology, load, etc. It is theoretically proved that the algorithm achieve the optimal scheduling of smart grid over undirected switching graphs under certain conditions. In the presence of gradient measurement noise, the variation form of the algorithm which converges in the mean square sense is given. Finally, the simulation example illustrates the validness of the algorithm.
Keywords:
Power generation
Generators
Smart grids
Privacy
Switches
Network topology
Topology
Economic dispatch
initialization-free
privacy-guaranteed
sign of relative state
gradient measurement noise
distributed algorithm
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:
4.9
Papers:
8.8K
Citations:
2.5W