Randomized Simplicial Approximate Stochastic Dynamic Programming for Mid-term Reservoir Optimization

Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality issue of dynamic programming, several approximate dynamic programming (ADP) techniques have been proposed to tackled these problems. In this w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Conference on Control, Decision and Information Technologies (Online) Jg. 1; S. 468 - 474
Hauptverfasser: Zephyr, Luckny, Lamond, Bernard F.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 17.05.2022
Schlagworte:
Complexity theory
Dynamic programming
Information technology
Monte Carlo methods
Proposals
Reservoirs
Upper bound
ISSN:2576-3555
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality issue of dynamic programming, several approximate dynamic programming (ADP) techniques have been proposed to tackled these problems. In this work, we investigate a new ADP scheme based on a hydrid simplicial and Monte Carlo sampling strategy. Our starting point is the works [1]-[3], which proposed a simplicial decomposition scheme guided by the curvature of the value function, as estimated by local differences between lower and upper bounds. In contrast to these approaches, which store an exhaustive list of "active" simplices at each iteration, our proposals choose grid points in small random samples of simplices. Our proposal is tested on the approximation of randomly generated concave functions and mid-term reservoir management problems.
ISSN:2576-3555
DOI:10.1109/CoDIT55151.2022.9804070