Topological value iteration algorithm for Markov decision processes

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1860-1865

  Dai, Peng ^a   Goldsmith, Judy ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKING-UP; GRAPHICAL FEATURES; MARKOV DECISION PROCESSES; REACHABILITY ANALYSIS; TOPOLOGICAL SEQUENCE; VALUE ITERATION; VALUE ITERATION ALGORITHM;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; TOPOLOGY;

ITERATIVE METHODS;

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

References (18)

1. Barto, A.; Bradke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. JAI 72:81-138.
2. Bellman, R. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
3. Bonet, B., and Geffner, H. 2003a. Faster heuristic search algorithms for planning with uncertainty and full feedback. In Gottlob, G., ed., Proc. of IJCAI-03, 1233-1238. Acapulco, Mexico: Morgan Kaufmann.
4. Bonet, B., and Geffner, H. 2003b. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Giunchiglia, E.; Muscettola, N.; and Nau, D., eds., Proc. 13th ICAPS, 12-21. Trento, Italy: AAAI Press.
5. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. JAIR 11:1-94. (Pubitemid 129628760)
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
7. Feng, Z., and Hansen, E. A. 2002. Symbolic heuristic search for factored Markov decision processes. In Proc. of AAAI-05.
8. Feng, Z.; Hansen, E. A.; and Zilberstein, S. 2003. Symbolic generalization for on-line planning. In Proc. of UAI-03, 209-216.
9. Ferguson, D., and Stentz, A. 2004. Focussed dynamic programming: Extensive comparative results. Technical Report CMU-RI-TR-04-13, Carnegie Mellon University, Pittsburgh, PA.
10. Guestrin, C.; Koller, D.; Parr, R.; and Venkataraman, S. 2003. Efficient solution algorithms for factored MDPs. JAIR 19:399-468. (Pubitemid 41525926)
11. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. JAI 129:35-62.
12. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In Proc. of UAI-99, 279-288.
13. Howard, R. 1960. Dynamic Programming and Markov Processes. Cambridge, Massachusetts: MIT Press.
14. Littman, M. L.; Dean, T.; and Kaelbling, L. P. 1995. On the complexity of solving Markov decision problems. In Proc. of UAI-95, 394-402.
15. McMahan, H. B., and Gordon, G. J. 2005. Fast exact planning in Markov decision processes. In Proc. of ICAPS-05.
16. Patrascu, R.; Poupart, P.; Schuurmans, D.; Boutilier, C.; and Guestrin, C. 2002. Greedy linear valueapproximation for factored Markov decision processes. In Proc. of AAAI-02, 285-291.
17. Poupart, P.; Boutilier, C.; Patrascu, R.; and Schuurmans, D. 2002. Piecewise linear value function approximation for factored MDPs. In Proc. of AAAI-02, 292-299.
18. Puterman,M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley, New York.