Approximate dynamic programming with affine ADDs

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 3, Issue , 2010, Pages 1349-1356

  Sanner, Scott ^a   Uther, William ^b   Delgado, Karina Valdivia ^c  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximate Dynamic Programming; Markov Decision Processes; Planning

Indexed keywords

APPROXIMATION ALGORITHMS; AUTONOMOUS AGENTS; BEHAVIORAL RESEARCH; DYNAMIC PROGRAMMING; MULTI AGENT SYSTEMS;

'CURRENT; APPROXIMATE DYNAMIC PROGRAMMING; APPROXIMATE SOLUTION; DECISION DIAGRAM; DISCRETE DOMAINS; DYNAMIC PROGRAMMING ALGORITHM; MARKOV DECISION PROCESSES; NOVEL ALGORITHM; RUN OUTS; STATE OF THE ART;

MARKOV PROCESSES;

EID: 84899418045     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. R. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their applications. In IEEE/ACM International Conf. on CAD, pages 428-432, 1993.
2. R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.
3. C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research (JAIR), 11:1-94, 1999.
4. C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specifi independence in Bayesian networks. In Uncertainty in Artificial Intelligence (UAI-96), pages 115-123, 1996.
5. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput., C-35(8), Aug. 1986.
6. C. Guestrin, D. Koller, R. Parr, and S. Venktaraman. Efficien solution methods for factored MDPs. Journal of Artificial Intelligence Research (JAIR), 19:399-468, 2003.
7. J. Hoey, R. St-Aubin, A. Hu, and C. Boutilier. SPUDD: Stochastic planning using decision diagrams. In Uncertainty in Artificial Intelligence (UAI-99), pages 279-288, 1999.
8. R. Parr, L. Li, G. Taylor, C. Painter-Wakefield and M. L. Littman. An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning. In ICML-08, pages 752-759, 2008.
9. R. Patrascu, P. Poupart, D. Schuurmans, C. Boutilier, and C. Guestrin. Greedy linear value-approximation for factored Markov decision processes. In AAAI-02, pages 285-291.
10. P. Poupart, C. Boutilier, R. Patrascu, and D. Schuurmans. Piecewise linear value function approximation for factored MDPs. In AAAI-02, pages 292-299.
11. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, 1994.
12. S. Sanner and D. McAllester. Affin algebraic decision diagrams (AADDs) and their application to structured probabilistic inference. In UCAI2005, 2005.
13. R. St-Aubin, J. Hoey, and C. Boutilier. APRICODD: Approximate policy construction using decision diagrams. In NIPS-00, 2000.