APRICODD: Approximate policy construction using decision diagrams

Advances in Neural Information Processing Systems

Volumn , Issue , 2001, Pages

  St Aubin, Robert ^a   Hoey, Jesse ^a   Boutilier, Craig ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MARKOV PROCESSES; OPTIMAL SYSTEMS;

APPROXIMATE DYNAMIC PROGRAMMING; DECISION DIAGRAM; MARKOV DECISION PROCESSES; NEAR-OPTIMAL; OPTIMAL VALUE FUNCTIONS; SPACE REQUIREMENTS; VALUE FUNCTIONS; VALUE ITERATION;

ITERATIVE METHODS;

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

References (12)

1. R. Iris Bahar, Erica A. Frohm, Charles M. Gaona, Gary D. Hachtel, Enrico Macii, Abelardo Pardo, and Fabio Somenzi. Algebraic decision diagrams and their applications. In International Conference on Computer-Aided Design, pages 188-191. IEEE, 1993.
2. Craig Boutilier and Richard Dearden. Approximating value trees in structured dynamic programming. In Proceedings ICML-96, Bari, Italy, 1996.
3. Craig Boutilier, Richard Dearden, and Moisés Goldszmidt. Exploiting structure in policy construction. In Proceedings Fourteenth Inter. Conf on AI (IJCAI-95), 1995.
4. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
5. E. M. Clarke, K. L. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral transforms for large boolean functions with applications to technology mapping. In DAC, 54-60. ACM/IEEE, 1993.
6. Thomas Dean and Keiji Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5(3):142-150, 1989.
7. Richard Dearden and Craig Boutilier. Abstraction and approximate decision theoretic planning. Artificial Intelligence, 89:219-283, 1997.
8. Jesse Hoey, Robert St-Aubin, Alan Hu, and Craig Boutilier. SPUDD: Stochastic planning using decision diagrams. In Proceedings of UAI99, Stockholm, 1999.
9. Jesse Hoey, Robert St-Aubin, Alan Hu, and Craig Boutilier. Optimal and approximate planning using decision diagrams. Technical Report TR-00-05, UBC, June 2000.
10. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, NY, 1994.
11. Satinder P. Singh and Richard C. Yee. An upper bound on the loss from approximate optimal-value function. Machine Learning, 16:227-233, 1994.
12. Fabio Somenzi. CUDD: CU decision diagram package. Available from ftp://vlsi.colorado.edu/pub/, 1998.