TR2018-064

Machine Learning Based State-Space Approximate Dynamic Programming Approach for Energy and Reserve Management of Power Plants

    •  Keerthisinghe, C., Sun, H., Takaguchi, Y., Nikovski, D.N., Hashimoto, H., "Machine Learning Based State-Space Approximate Dynamic Programming Approach for Energy and Reserve Management of Power Plants", IEEE PES Innovative Smart Grid Technologies Conference - Asia (ISGT Asia), DOI: 10.1109/​ISGT-Asia.2018.8467807, May 2018, pp. 669-674.
      BibTeX TR2018-064 PDF
      • @inproceedings{Keerthisinghe2018may,
      • author = {Keerthisinghe, Chanaka and Sun, Hongbo and Takaguchi, Yusuke and Nikovski, Daniel N. and Hashimoto, Hiroyuki},
      • title = {Machine Learning Based State-Space Approximate Dynamic Programming Approach for Energy and Reserve Management of Power Plants},
      • booktitle = {IEEE PES Innovative Smart Grid Technologies Conference - Asia (ISGT Asia)},
      • year = 2018,
      • pages = {669--674},
      • month = may,
      • doi = {10.1109/ISGT-Asia.2018.8467807},
      • url = {https://www.merl.com/publications/TR2018-064}
      • }
  • MERL Contacts:
  • Research Areas:

    Data Analytics, Optimization

Abstract:

This paper proposes a machine learning based state-space approximate dynamic programming (MSADP) approach to solve the self-scheduling problem faced by power plants under an integrated energy and reserve market. By extending the concept of residual demand curves (RDCs) from energy to reserve, the residual reserve curves (RRCs) is proposed to model the regulation price as a function of the power plant's reserve power. Both RRCs and RDCs are obtained using a clustering based neural network approach, which resulted in better estimates than using only a non-parametric approach. The machine learning is used to make approximations to the state space, and the dynamic programming only loops over the required states. As such, the computation effort is reduced but the solution quality does not be impacted. The value functions generated during the day-ahead optimization are used to generate optimal supply offer curves for the day-ahead market, and make real-time decisions and real-time bids to stay optimal by solving Bellman optimality condition. The effectiveness of the MSADP approach is demonstrated using empirical data obtained from the New England ISO.