Linear dynamic programs for resource management

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1377-1383

  Petrik, Marek ^a   Zilberstein, Shlomo ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SETS; DUAL DYNAMIC PROGRAMMING; HYDROELECTRIC SYSTEMS; LINEAR DYNAMICS; MARKOV DECISION PROCESSES; POINT-BASED; RESOURCE MANAGEMENT; RESOURCE MANAGEMENT PROBLEMS; RIVER RESERVOIRS; STATE OF THE ART; STOCHASTIC OPTIMIZATION PROBLEMS; SUSTAINABLE RESOURCE MANAGEMENT;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; NATURAL RESOURCES MANAGEMENT; OPTIMIZATION; RESERVOIRS (WATER); RESOURCE ALLOCATION; WATER LEVELS;

DYNAMIC PROGRAMMING;

EID: 80055046253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Bellman, R. 1957. Dynamic Programming. Princeton University Press.
2. Borwein, J., and Lewis, A. S. 2000. Convex Analysis and Nonlinear Optimization: Theory and Examples.
3. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge University Press.
4. Hauskrecht, M. 2000. Value-function approximation for partially observable Markov decision processes. Journal of Artificial Intelligence Research 13:33-94. (Pubitemid 33682083)
5. Kall, P., and Mayer, J. 2005. Stochastic Linear Programming: Models, Theory, and Computation. Springer.
6. Littman, M.; Sutton, R.; and Singh, S. 2002. Predictive representations of state. In Advances in Neural Information Processing Systems.
7. Lovejoy, W. S. 1991. Computationally feasible bounds for partially observed Markov decision processes. Operations Research 39:162-175.
8. Pereira, M. V. F. 1985. Stochastic optimization of a multi-reservoir hydroelectric system: A decomposition approach. Water Resource Research 21:779-792.
9. Pereira, M. V. F. 1989. Stochastic operation scheduling of large hydroelectric systems. Electric Power and Energy Systems 11(3):161-169.
10. Petrik, M., and Zilberstein, S. 2009. Robust value function approximation using bilinear programming. In Advances in Neural Information Processing Systems (NIPS).
11. Pineau, J.; Gordon, G.; and Thrun, S. 2006. Anytime point-based approximations for fast POMDP solving. Journal of Artificial Intelligence Research 27(SOCS-TR-2005.4):335-380.
12. Powell, W. B. 2007. Approximate Dynamic Programming. Wiley-Interscience.
13. Puterman, M. L. 2005. Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons, Inc.
14. Rockafellar, R. T. 1996. Convex Analysis. Princeton University Press.
15. Shapiro, A. 2011. Analysis of stochastic dual dynamic programming method. European Journal of Operational Research 209:63-72.
16. Spaan, M. T. J., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24:195-220. (Pubitemid 43130936)
17. Vanderbei, R. J. 2001. Linear Programming: Foundations and Extensions. Springer, 2nd edition.
18. Weinstein, A.; Mansley, C.; and Littman, M. 2010. Sample-based planning for continuous action Markov decision processes. In ICML Workshop on Reinforcement Learning and Search in Very Large Spaces.
19. Woerner, S. 2010. Approximate parametric dynamic programing in inventory management. Master's thesis, ETH.