Lazy planning under uncertainty by optimizing decisions on an ensemble of incomplete disturbance trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5323 LNAI, Issue , 2008, Pages 1-14

  Defourny, Boris ^a   Ernst, Damien ^a   Wehenkel, Louis ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Ensemble methods; Stochastic dynamic programming

Indexed keywords

OPTIMIZATION; PROGRAMMING THEORY; RANDOM PROCESSES; REINFORCEMENT; REINFORCEMENT LEARNING; SYSTEMS ENGINEERING; WIRELESS LOCAL AREA NETWORKS (WLAN);

CARTESIAN PRODUCTS; DECISION MAKING PROBLEMS; DECISION SPACES; DECISION STRATEGIES; ENSEMBLE METHODS; FINITE NUMBERS; INITIAL STATES; NAVIGATION PROBLEM; OPTIMIZ ATION PROBLEMS; OPTIMIZATION HORIZON; PAPER ADDRESSES; SEARCH SPACES; STOCHASTIC DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

EID: 58449098161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89722-4_1     Document Type: Conference Paper

References (27)

1. Maciejowski, J.: Predictive Control with Constraints. Prentice Hall, Englewood Cliffs (2001)
2. Morari, M., Lee, J.: Model predictive control: past, present and future. Computers and Chemical Engineering 23, 667-682 (1999)
3. Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)
4. Launchbury, J.: A natural semantics for lazy evaluation. In: POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 144-154. ACM, New York (1993)
5. Friedman, J., Kohavi, R., Yun, Y.: Lazy decision trees. In: Proc. of 13th National Conference on Artificial Intelligence, AAAI 1996. Part l(of 2), pp. 717-724 (1996)
6. Heitsch, H., Römisch, W., Strugarek, C.: Stability of multistage stochastic programs. SIAM Journal on Optimization 17(2), 511-525 (2006)
7. Römisch, W.: Stability of stochastic programming problems. In: Ruszczyński, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10, pp. 483-554. Elsevier, Amsterdam (2003)
8. Dempster, M.: Sequential importance sampling algorithms for dynamic stochastic programming. Annals of Operations Research 84, 153-184 (1998)
9. Shapiro, A.: Monte Carlo sampling methods. In: Ruszczyński, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10, pp. 353-425. Elsevier, Amsterdam (2003)
10. Høyland, K., Wallace, S.: Generating scenario trees for multistage decision problems. Management Science 47(2), 295-307 (2001)
11. Hochreiter, R., Pflug, G.: Financial scenario generation for stochastic multi-stage decision processes as facility location problems. Annals of Operations Research 152, 257-272 (2007)
12. Rachev, S., Römisch, W.: Quantitative stability in stochastic programming: The method of probability metrics. Mathematics of Operations Research 27(4), 792-818 (2002)
13. Ernst, D., Glavic, M., Capitanescu, F., Wehenkel, L.: Reinforcement learning versus model predictive control: a comparison on a power system problem. IEEE Transactions on Systems. Man and Cybernetics - Part B (to appear, 2008)
14. Kothare, M., Balakrishnan, V., Morari, M.: Robust constrained model predictive control using matrix inequalities. Automatica 32, 1361-1379 (1996)
15. Nesterov, Y., Vial, J.P.: Confidence level solutions for stochastic programming. Automatica 44(6), 1559-1568 (2008)
16. Schapire, R.: The strength of weak learnability. Machine Learning 5(2), 197-227 (1990)
17. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123-140 (1996)
18. Ernst, D., Geurts, P., Wehenkel, L.: Tree-based batch mode reinforcement learning. Journal of Machine Learning Research 6, 503-556 (2005)
19. Sutton, R.: Generalization in reinforcement learning: successful examples using sparse coarse coding. Advances in Neural Information Processing Systems 8, 1038-1044 (1996)
20. Kearns, M., Mansour, Y., Ng, A.: A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning 49(2-3), 193-208 (2002)
21. Rubinstein, R., Kroese, D.: The Cross-Entropy Method. A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. In: Information Science and Statistics. Springer, Heidelberg (2004)
22. Cassandra. A., Kaelbling, L., Littman, M.: Acting optimally in partially observable stochastic domains. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), Seattle, Washington, USA, vol. 2, pp. 1023-1028. AAAI Press/MIT Press, Menlo Park (1994)
23. Ng, A., Jordan. M.: PEGASUS: a policy search method for large MDPs and POMDPs. In: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, pp. 406-415 (1999)
24. Defourny, B.: Approximate solution to multistage stochastic programs with ensembles of randomized scenario trees. Master's thesis, University of Liège, Department of Electrical Engineering and Computer Science (2007)
25. Defourny, B., Wehenkel, L.: Averaging decisions from an ensemble of scenario trees: a validation on newsvendor problems (submitted, 2008)
26. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
27. Sutton, R., McAUester, D., Singh, S., Mansour, Y.: Policy gradient methods for reinforcement learning with function approximation. Advances in Neural Information Processing Systems 12, 1057-1063 (2000)