Efficient solutions to factored MDPs with imprecise transition probabilities

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 98-105

  Delgado, Karina Valdivia ^a   Sanner, Scott ^b   De Barros, Leliane Nunes ^a   Cozman, Fabio G ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION TECHNIQUES; COMPUTATIONAL BOTTLENECKS; COMPUTATIONAL OVERHEADS; DECISION-THEORETIC; DYNAMIC PROGRAMMING METHODS; MARKOV DECISION PROCESSES; NON-LINEAR OPTIMIZATION; NON-LINEAR SOLVER; NONLINEAR CONSTRAINED OPTIMIZATION PROBLEMS; NONSTATIONARY; OPTIMAL SOLUTIONS; ORDER OF MAGNITUDE; ORDERS OF MAGNITUDE; PLANNING PROBLEM; REAL-WORLD; TRANSITION MODEL; TRANSITION PROBABILITIES; VALUE ITERATION;

CONSTRAINED OPTIMIZATION; MARKOV PROCESSES; PROBABILITY; SCHEDULING;

DYNAMIC PROGRAMMING;

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

References (16)

1. Bahar, R. I.; Frohm, E. A.; Gaona, C. M.; Hachtel, G. D.; Macii, E.; Pardo, A.; and Somenzi, F. 1993. Algebraic decision diagrams and their applications. In ICCAD-93, 188-191.
2. Boutilier, C.; Friedman, N.; Goldszmidt, M.; and Koller, D. 1996. Context-specific independence in Bayes nets. In UAI-96, 115-123.
3. Boutilier, C.; Hanks, S.; and Dean, T. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. JAIR 11:1-94.
4. Buffet, O., and Aberdeen, D. 2005. Robust planning with LRTDP. In IJCAI-05, 1214-1219.
5. Cozman, F. G. 2000. Credal networks. Artif. Intell. 120:199-233.
6. Cozman, F. G. 2005. Graphical models for imprecise probabilities. Internat. Journal of Approx. Reasoning 39(2-3):167-184.
7. Dean, T., and Kanazawa, K. 1990. A model for reasoning about persistence and causation. Comput. Intell. 5(3):142-150.
8. Givan, R.; Leach, S.; and Dean, T. 2000. Bounded-parameter Markov decision processes. Artif. Intell. 122:71-109.
9. Guestrin, C.; Koller, D.; Parr, R.; and Venkataraman, S. 2003. Efficient solution algorithms for factored MDPs. JAIR 19:399-468. (Pubitemid 41525926)
10. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. Stochastic planning using decision diagrams. In UAI-99, 279-288.
11. Puterman, M. L. 1994. Markov Decision Processes. New York: John Wiley and Sons.
12. Satia, J. K., and Lave Jr., R. E. 1970. MDPs with uncertain transition probabilities. Operations Research 21:728-740.
13. St-aubin, R.; Hoey, J.; and Boutilier, C. 2000. Approximate policy construction using decision diagrams. In NIPS-00.
14. Trevizan, F. W.; Cozman, F. G.; and de Barros, L. N. 2007. Planning under risk and Knightian uncertainty. In IJCAI-07.
15. White III, C. C., and El-Deib, H. K. 1994. MDPs with Imprecise Transition Probabilities. Operations Research 42(4):739-749.
16. Zhang, N. L., and Poole, D. 1994. A simple approach to Bayesian network computations. In CCAI-94, 171-178.