An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
From MaRDI portal
Publication:5353422
DOI10.1109/TAC.2013.2272973zbMath1369.49035OpenAlexW2050419288MaRDI QIDQ5353422
Warren B. Powell, Juliana Nascimento
Publication date: 8 September 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2013.2272973
Dynamic programming in optimal control and differential games (49L20) Stochastic programming (90C15) Dynamic programming (90C39)
Related Items (12)
Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage ⋮ Least squares approximate policy iteration for learning bid prices in choice-based revenue management ⋮ Heuristic decision rules for short-term trading of renewable energy with co-located energy storage ⋮ On the complexity of energy storage problems ⋮ Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage ⋮ Shape constraints in economics and operations research ⋮ Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States ⋮ A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem ⋮ Sell or store? An ADP approach to marketing renewable energy ⋮ Data-based robust adaptive control for a class of unknown nonlinear constrained-input systems via integral reinforcement learning ⋮ A new convergent hybrid learning algorithm for two-stage stochastic programs ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
This page was built for publication: An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls