Distributed Consensus Based Algorithm for Economic Dispatch in a Microgrid

Economic dispatch problem (EDP) is a fundamental optimization problem of power systems. With the penetration of renewable energy sources in microgrids, this paper proposes a distributed algorithm based on consensus theory to solve the EDP with a quadratic cost function. The method takes advantage of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on smart grid Jg. 10; H. 4; S. 3630 - 3640
Hauptverfasser: Wang, Rui, Li, Qiqiang, Zhang, Bingying, Wang, Luhao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.07.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Communication networks
Computer simulation
consensus algorithm
Convergence
Cost function
distributed algorithm
Distributed algorithms
Distributed generation
Economic dispatch problem
Eigenvalues
Eigenvalues and eigenfunctions
Electric power grids
Feedback
Generators
Graph theory
microgrid
Microgrids
multi-agent system
Optimization
Perturbation theory
Power dispatch
Renewable energy sources
Upper bounds
ISSN:1949-3053, 1949-3061
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Economic dispatch problem (EDP) is a fundamental optimization problem of power systems. With the penetration of renewable energy sources in microgrids, this paper proposes a distributed algorithm based on consensus theory to solve the EDP with a quadratic cost function. The method takes advantage of the fact that incremental costs need to be equal for all buses at optimal output power values. Thus, the incremental cost of each bus is selected as a consensus variable and the local mismatch between total demand and generation is assigned as a feedback variable to meet demand constraints. Unlike the existing related works, the feedback gains for the feedback variables are different and time-varying. Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved. Furthermore, the upper bounds of the feedback gains are given theoretically, and we obtain that the algorithm converges to the optimal solution at a rate governed by the second largest eigenvalue of the system matrix. Meanwhile, the algorithm is a fully distributed algorithm without a leader or a virtual command node. The simulation results illustrate the effectiveness of the algorithm even though there is a demand change and generator damage. Some simulation results intuitively illustrate how the convergence speed changes with the feedback gains.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1949-3053
1949-3061
DOI:10.1109/TSG.2018.2833108