DetH*: Approximate hierarchical solution of large markov decision processes

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1928-1935

  Barry, Jennifer L ^a   Kaelbling, Leslie Pack ^a   Lozano Pérez, Tomás ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY PROPERTIES; HIERARCHICAL MODEL; LARGE DOMAIN; MARKOV DECISION PROCESSES; OPTIMAL POLICIES; RUNNING TIME; RUNTIMES;

ARTIFICIAL INTELLIGENCE; ASYMPTOTIC ANALYSIS; HIERARCHICAL SYSTEMS; OPTIMIZATION;

MARKOV PROCESSES;

EID: 84863839050     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-323     Document Type: Conference Paper

References (12)

1. J. Barry, L. Kaelbling, and T. Lozano-Pérez. Hierarchical Solution of Large Markov Decision Processes. Technical report, Massachusetts Institute of Technology, 2011.
2. Dimitri P. Bertsekas and John N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, Belmont, Massachusetts, 1996.
3. Blai Bonet and Hector Geffner. Solving POMDPs: RTDP-Bel vs. Point-based Algorithms. In 21st Int. Joint. Conf. on Artificial Intelligence (IJCAI), Pasadena, California, 2009.
4. Blai Bonet and Bob Givan. Non-Deterministic Planning Track of the 2006 International Planning Competition. www.ldc.usb.ve/%7ebonet/ipc5, 2006.
5. Peng Dai and Judy Goldsmith. Topological value iteration. In Twentieth International Joint Conference on Artificial Intelligence, pages 1860-65, Hyderabad, India, January 2007.
6. Peng Dai, Mausam, and Daniel S. Weld. Focused topological value iteration. In Nineteenth International Conference on Automated Planning and Scheduling, pages 82-89, Thessaloniki, Greece, September 2009.
7. Thomas G. Dietterich. The MAXQ Method for Hierarchical Reinforcement Learning. In ICML, pages 118-126, San Francisco, 1998.
8. Jesse Hoey, Robert St-Aubin, Alan J Hu, and Craig Boutilier. Spudd: Stochastic planning using decision diagrams. In Uncertainty in Artificial Intelligence, Stockholm, Sweden, 1999.
9. Neville Mehta, Soumya Ray, Prasad Tadepalli, and Thomas Dietterich. Automatic Discovery and Transfer of MAXQ Hierarchies. In ICML-08, Helinski, Finland, 2008.
10. S. Sanner and D. McAllester. Affine algebraic decision diagrams and their application to structured probabilistic inference. In Nineteenth International Joint Conference on Artificial Intelligence, 2005.
11. S. Sanner, W. Uther, and K. V. Delgado. Approximate dynamic programming with affine adds. In Ninth International Conference on Autonomous Agents and Multiagent Systems, Toronto, Canada, 2010.
12. Robert St-Aubin, Jesse Hoey, and Craig Boutilier. Apricodd: Approximate policy construction using decision diagrams. In Neural Information Processing Systems, Denver, CO, 2000.