Adaptive Consensus-Based Robust Strategy for Economic Dispatch of Smart Grids Subject to Communication Uncertainties
The economic dispatch problem is investigated in this paper for a class of smart grids subject to unknown communication uncertainties. Compared with existing works related to economic dispatch where the dispatch algorithms are carried out by a centralized controller, a new kind of distributed dispat...
Saved in:
Published in | IEEE transactions on industrial informatics Vol. 14; no. 6; pp. 2484 - 2496 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.06.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The economic dispatch problem is investigated in this paper for a class of smart grids subject to unknown communication uncertainties. Compared with existing works related to economic dispatch where the dispatch algorithms are carried out by a centralized controller, a new kind of distributed dispatch algorithms are developed to achieve optimal dispatch of electric power by appropriately sharing the load among different generating units while guaranteeing consensus among incremental costs. An adaptive weight-adjustment technique is suggested that enables the dispatch algorithms to choose the communication weights among neighboring generating units which yield consensus of incremental costs under both cases with or without capacity limitations. The achievement of such a consensus leads to optimal dispatch of electronic power and secures the system performance against unknown communication uncertainties. Meanwhile, it is proved that the power demand and supply of the considered smart grids will be kept in a balanced state during the dispatch process. The interesting issue of how to assign the power outputs among generating units to balance the power demand and supply of the considered smart grids is also addressed. Finally, the numerical results of several case studies have been provided to verify the effectiveness of the proposed algorithms. |
---|---|
ISSN: | 1551-3203 1941-0050 |
DOI: | 10.1109/TII.2017.2772088 |