Bounded parameter Markov decision processes

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

Volumn 1348 LNAI, Issue , 1997, Pages 234-246

  Givan, Robert ^a   Leach, Sonia ^a   Dean, Thomas ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; DYNAMIC PROGRAMMING; ITERATIVE METHODS; LEARNING ALGORITHMS; MARKOV PROCESSES;

AGGREGATION SCHEMES; BOUNDED PARAMETERS; ITERATIVE DYNAMIC PROGRAMMING; MARKOV DECISION PROCESSES; SEQUENTIAL DECISIONS; TRADITIONAL VALUES; TRANSITION PROBABILITIES; UPPER AND LOWER BOUNDS;

FUNCTION EVALUATION;

EID: 33644680515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_89     Document Type: Conference Paper

References (14)

1. Bellman, Richard 1957. Dynamic Programming. Princeton University Press.
2. Bertsekas, D. P. and Castanon, D. A. 1989. Adaptive aggregation for infinite horizon dynamic programming. IEEE Transactions on Automatic Control 34(6):589-598.
3. Boutilier, Craig and Dearden, Richard 1994. Using abstractions for decision theoretic planning with time constraints. In Proceedings AAAI-94. AAAI. 1016-1022.
4. Boutilier, Craig; Dean, Thomas; and Hanks, Steve 1995a. Planning under uncertainty: Structured assumptions and computational leverage. In Proceedings of the Third European Workshop on Planning.
5. Boutilier, Craig; Dearden, Richard; and Goldszmidt, Moises 1995b. Exploiting structure in policy construction. In Proceedings IJCAII4. IJCAII. 1104-1111.
6. Dean, Thomas and Givan, Robert 1997. Model minimization in Markov decision processes. In Proceedings AAAI-97. AAAI.
7. Dean, Thomas; Givan, Robert; and Leach, Sonia 1997. Model reduction techniques for computing approximately optimal solutions for Markov decision processes. In Thirteenth Conference on Uncertainty in Artificial Intelligence.
8. Littman, Michael; Dean, Thomas; and Kaelbling, Leslie 1995. On the complexity of solving Markov decision problems. In Eleventh Conference on Uncertainty in Artificial Intelligence. 394-402.
9. Littman, Michael L. 1997. Probabilistic propositional planning: Representations and complexity. In Proceedings AAAI-97. AAAI.
10. Lovejoy, William S. 1991. A survey of algorithmic methods for partially observed Markov decision processes. Annals of Operations Research 28:47-66.
11. Puterman, Martin L. 1994. Markov Decision Processes. John Wiley & Sons, New York.
12. Satia, J. K. and Lave, R. E. 1973. Markovian decision processes with uncertain transition probabilities. Operations Research 21:728-740.
13. White, C. C. and Eldeib, H. K. 1986. Parameter imprecision in finite state, finite action dynamic programs. Operations Research 34:120-129.
14. White, C. C. and Eldeib, H. K. 1994. Markov decision processes with imprecise transition probabilities. Operations Research 43:739-749.