资源分类
》 资源 》论文》Approximate Dynamic Programming for Storage Problems

Approximate Dynamic Programming for Storage Problems

2020-02-27 | |  62 |   31 |   0

Abstract

Storage problems are an important subclass of stochastic control problems. This paper presents a new method, approximate dynamic programming for storage, to solve storage problems with continuous, convex decision sets. Unlike other solution procedures, ADPS allows math programming to be used to make decisions each time period, even in the presence of large state variables. We test ADPS on the day ahead wind commitment problem with storage.

上一篇：Risk-Based Generalizations of f -divergences

下一篇：High-resolution sequence and chromatin signatures predicttranscription factor binding in the human genome

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...