TY - JOUR
T1 - Distributed Q-learning-based online optimization algorithm for unit commitment and dispatch in smart grid
AU - Li, Fangyuan
AU - Qin, Jihau
AU - Zheng, Wei Xing
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2020/9
Y1 - 2020/9
N2 - Economic dispatch (ED) and unit commitment (UC) problems need to be revisited in order to make a transition from a traditional power system to a smart grid. In this paper, we formulate the ED and UC problems into a unified form, which is also capable of characterizing the infinite horizon UC problem. Based on the formulation, a centralized Q-learning-based optimization algorithm is proposed. The proposed algorithm runs in an online manner and requires no prior information on the mathematical formulation of the actual cost functions, thus being capable of dealing with situations for which such cost functions are too difficult to obtain. Then, the distributed counterpart of the centralized algorithm is developed by relaxing the demand for global information and balancing exploration and exploitation cooperatively in a distributed way. Theoretical analysis of the proposed algorithms is also provided. Finally, several case studies are presented to demonstrate the effectiveness of the proposed algorithms.
AB - Economic dispatch (ED) and unit commitment (UC) problems need to be revisited in order to make a transition from a traditional power system to a smart grid. In this paper, we formulate the ED and UC problems into a unified form, which is also capable of characterizing the infinite horizon UC problem. Based on the formulation, a centralized Q-learning-based optimization algorithm is proposed. The proposed algorithm runs in an online manner and requires no prior information on the mathematical formulation of the actual cost functions, thus being capable of dealing with situations for which such cost functions are too difficult to obtain. Then, the distributed counterpart of the centralized algorithm is developed by relaxing the demand for global information and balancing exploration and exploitation cooperatively in a distributed way. Theoretical analysis of the proposed algorithms is also provided. Finally, several case studies are presented to demonstrate the effectiveness of the proposed algorithms.
UR - https://hdl.handle.net/1959.7/uws:61422
UR - http://www.scopus.com/inward/record.url?scp=85089712429&partnerID=8YFLogxK
U2 - 10.1109/TCYB.2019.2921475
DO - 10.1109/TCYB.2019.2921475
M3 - Article
C2 - 31251206
SN - 2168-2267
VL - 50
SP - 4146
EP - 4156
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 9
M1 - 8746822
ER -