Solving factored MDPs via non-homogeneous partitioning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 683-689

  Kim, Kee Eung ^a   Dean, Thomas ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM FOR SOLVING; BISIMULATIONS; HOMOGENEOUS PARTITION; NON-HOMOGENEOUS; NUMBER OF BLOCKS; SUCCESSIVE REFINEMENT; VALUE FUNCTIONS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

AGGREGATES;

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

References (20)

1. Dimitri P. Bertsekas and David A. Castañon. Adaptive aggregation for infinite horizon dynamic programming. IEEE Transactions on Automatic Control, 34(6):589-598, 1989.
2. Dimitri P. Bertsekas and John N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.
3. Craig Boutilier and Richard Dearden. Approximating value trees in structured dynamic programming. In Proceedings ICML-96, 1996.
4. Craig Boutilier, Richard Dearden, and Moisés Goldszmidt. Exploiting structure in policy construction. In Proceedings IJCAI-95, pages 1104-1111, 1995.
5. Craig Boutilier, Thomas Dean, and Steve Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1999.
6. Thomas Dean and Robert Givan. Model minimization in Markov decision processes. In Proceedings AAAI-97, 1997.
7. Thomas Dean and Keiji Kanazawa. A Model for Reasoning about Persistence and Causation. Computational Intelligence, pages 143-150, 1989.
8. Jeff Forbes, Tim Huang, Keiji Kanazawa, and Stuart Russell. The BATmobile: Towards a Bayesian automated taxi. In Proceedings IJCAI-95, 1995.
9. Robert Givan, Sonia Leach, and Thomas Dean. Bounded-parameter Markov decision processes. Artificial Intelligence, 122:71-109, 2000.
10. Judy Goldsmith and Robert H. Sloan. The complexity of model aggregation. In Proceedings AIPS-2000, 2000.
11. Geoffrey J. Gordon. Stable function approximation in dynamic programming. Technical Report CMU-CS-103, School of Computer Science, Carnegie Mellon University, 1995.
12. Jesse Hoey, Robert St-Aubin, Alan Hu, and Craig Boutilier. SPUDD: Stochastic planning using decision diagrams. In Proceedings UAI-99, 1999.
13. Kee-Eung Kim. Representations and Algorithms for Large Stochastic Planning Problems. PhD thesis, Brown University, 2001. In preparation.
14. Daphne Koller and Ronald Parr. Computing factored value functions for policies in structured MDPs. In Proceedings IJCAI-99, 1999.
15. Rémi Munos and Andrew Moore. Variable resolution discretization for high-accuracy solutions of optimal control problems. In Proceedings IJCAI-99, 1999.
16. Satinder P. Singh and Richard C. Yee. An upper bound on the loss from approximate optimal-value functions. Machine Learning, 16:227-233, 1994.
17. Fabio Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. Department of Electrical and Computer Engineering, University of Colorado at Boulder, 1998.
18. Robert St-Aubin, Jesse Hoey, and Craig Boutilier. APRICODD: Approximate policy construction using decision diagrams. In Proceedings NIPS-2000, 2000.
19. John N. Tsitsiklis and Benjamin Van Roy. Feature-based methods for large scale dynamic programming. Machine Learning, 22:59-94, 1996.
20. Chelsea White and Hany Eldeib. Markov decision processes with impricise transition probabilities. Operations Research, 42(4), 1994.