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...
Saved in:
Published in | E3S web of conferences Vol. 144; p. 1001 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
EDP Sciences
01.01.2020
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!