Partitioned external-memory value iteration

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 898-904

  Dai, Peng ^a   Mausam, M ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN FEATURES; EXTERNAL MEMORIES; EXTERNAL SORTS; EXTERNAL-; MAIN MEMORIES; MARKOV DECISION PROCESSES; NEW APPROACHES; VALUE ITERATIONS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; SYSTEMS ENGINEERING;

BIONICS;

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

References (19)

1. Aberdeen, D.; Thiébaux, S.; and Zhang, L. 2004. Decision-theoretic military operations planning. In ICAPS, 402-412.
2. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. AI J. 72:81-138.
3. Bellman, R. 1957. Dynamic Programming. Princeton University Press.
4. Bertsekas, D. P. 2001. Dynamic Programming and Optimal Control, volume 2. Athena Scientific, 2 edition.
5. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In ICAPS, 52-61.
6. Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In ICAPS, 12-21.
7. Bonet, B., and Geffner, H. 2006. Learning in depth-first search: A unified approach to heuristic search in deterministic non-deterministic settings, and its applications to MDPs. In ICAPS, 142-151.
8. Bonet, B. 2007. On the speed of convergence of value iteration on stochastic shortest-path problems. Mathematics of Operations Research 32(2):365-373.
9. Bresina, J. L.; Dearden, R.; Meuleau, N.; Ramkrishnan, S.; Smith, D. E.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In UAI, 77-84.
10. Buffet, O., and Aberdeen, D. 2007. FF+FPG: Guiding a policy-gradient planner. In ICAPS, 42-48.
11. Edelkamp, S.; Jabbar, S.; and Bonet, B. 2007. External memory value iteration. In ICAPS, 128-135.
12. Gordon, G. 1995. Stable function approximation in dynamic programming. In ICML, 261-268.
13. Hansen, E. A., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. AI J. 129:35-62.
14. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In UAI, 279-288.
15. IPC 2006. http://www.ldc.usb.ve/ bonet/ipc5/.
16. Little, I., and Thiebaux, S. 2007. Probabilistic planning vs. re-planning. In ICAPS Workshop on IPC: Past, Present and Future. Littman, M. L.; Dean, T.; and Kaelbling, L. P. 1995. On the complexity of solving Markov decision problems. In UAI, 394-402.
17. Musliner, D. J.; Carciofini, J.; Goldman, R. P.; E. H. Durfee, J. W.; and Boddy, M. S. 2007. Flexibly integrating deliberation and execution in decision-theoretic agents. In ICAPS Workshop on Planning and Plan-Execution for Real-World Systems.
18. Wingate, D., and Seppi, K. D. 2005. Prioritization methods for accelerating MDP solvers. JMLR 6:851-881.
19. Zhou, R., and Hansen, E. A. 2006. Domain-independent structured duplicate detection. In AAAI.