Algorithms of approximate dynamic programming for hydro scheduling

In hydro scheduling, unit commitment is a complex sub-problem. This paper proposes a new approximate dynamic programming technique to solve unit commitment. A new method called Least Square Policy Iteration (LSPI) algorithm is introduced which is efficient and faster in convergence. This algorithm t...

Full description

Saved in:
Bibliographic Details
Published inE3S web of conferences Vol. 144; p. 1001
Main Authors Parvez, Iram, Shen, Jianjian
Format Journal Article
LanguageEnglish
Published EDP Sciences 01.01.2020
Online AccessGet full text

Cover

More Information
Summary:In hydro scheduling, unit commitment is a complex sub-problem. This paper proposes a new approximate dynamic programming technique to solve unit commitment. A new method called Least Square Policy Iteration (LSPI) algorithm is introduced which is efficient and faster in convergence. This algorithm takes the properties of widely used algorithm least square temporal difference (LSTD), enhance it further and make it useful for optimization problems. First value function is to find a fixed policy by using least square temporal difference Q (LSTDQ) algorithm which is similar to LSTD, then LSPI is introduced for making the policy iteration algorithm by using the results of LSTDQ. It combines the data efficiency of LSTDQ and policy-search efficiency of policy iteration.
ISSN:2267-1242
2267-1242
DOI:10.1051/e3sconf/202014401001