External memory Value Iteration

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 128-135

  Edelkamp, Stefan ^a   Jabbar, Shahid ^a   Bonet, Blai ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ITERATIVE METHODS;

BREADTH-FIRST-SEARCH; DETERMINISTICS; DISK-BASED; EXTERNAL MEMORY; EXTERNAL VALUE; GRAPH G; NON-PROBABILISTIC; UNIFIED APPROACH; VALUE ITERATION; VALUE ITERATION ALGORITHM;

RANDOM ACCESS STORAGE;

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

References (34)

1. Aggarwal, A., and Vitter, J. S. 1988. The I/O complexity of sorting and related problems. JACM 31(9):1116-1127. Ajwani, D.; Dementiev, R.; and Meyer, U. 2006. A computational study of external memory BFS algorithms. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 601-610.
2. Ajwani, D.; Meyer, U.; and Osipov, V. 2007. Improved external memory BFS implementations. In Workshop on Algorithm engineering and experiments (ALENEX), 3-12.
3. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 12(1):81-138.
4. Bellman, R.; Kalaba, R.; and Kotin, B. 1963. Polynomial approximation - a new computational technique in dynamic programming. Math. Comp. 17(8):155-161.
5. Bertsekas, D., and Tsitsiklis, J. 1996. Neuro-Dynamic Programming. Athena Scientific.
6. Bertsekas, D. 1995. Dynamic Programming and Optimal Control, (2 Vols). Athena Scientific.
7. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
8. *. In AAAI, 1343-1348.
9. Bonet, B., and Geffner, H. 2006. Learning depth-first: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs. In ICAPS, 142-151.
10. Edelkamp, S., and Jabbar, S. 2006a. Cost-optimal external planning. In AAAI, 821-826.
11. Edelkamp, S., and Jabbar, S. 2006b. Large-scale directed model checking LTL. In Model Checking Software, SPIN, volume 3925 of LNCS, 1-18.
12. Edelkamp, S.; Jabbar, S.; and Nazih, M. 2006. Costoptimal planning with constraints and preferences in large state spaces. In ICAPS Workshop on Preferences and Soft Constraints in Planning.
13. *. In German Conf. on AI, volume 3238 of LNAI, 226-240.
14. Farias, D. P. D., and Roy, B. V. 2004. On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research 29(3):462-478.
15. Guestrin, C.; Koller, D.; and Parr, R. 2001. Max-norm projections for factored MDPs. In Nebel, B., ed., Proc. 17th International Joint Conf. on Artificial Intelligence, 673-680. Seattle, WA: Morgan Kaufmann.
16. *: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129:35-62.
17. Haslum, P. 2006. Improving heuristics through relaxed search. In Journal of Artificial Research, volume 25, 233-267.
18. Hoffmann, J. 2003. The Metric FF planning system: Translating "Ignoring the delete list" to numerical state variables. Journal of Artificial Intelligence Research 20:291-341.
19. Jabbar, S., and Edelkamp, S. 2005. I/O efficient directed model checking. In Verification, Model Checking, and Abstract Interpretation, volume 3385 of LNCS, 313-329.
20. Jabbar, S., and Edelkamp, S. 2006. Parallel external directed model checking with linear I/O. In Verification, Model checking, and Abstract Interpretation, volume 3855 of LNCS, 237-251.
21. Korf, R. E., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem. In IJCAI, 2324-2329.
22. Korf, R. E., and Schultze, T. 2005. Large-scale parallel breadth-first search. In AAAI, 1380-1385.
23. Korf, R. E. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
24. Korf, R. E. 2003. Breadth-first frontier search with delayed duplicate detection. In MOCHART workshop, 87-92.
25. Mehlhorn, K., and Meyer, U. 2002. External-memory breadth-first search with sublinear I/O. In European Symposium on Algorithms (ESA), 723-735.
26. Munagala, K., and Ranade, A. 1999. I/O-complexity of graph algorithms. In Symposium on Discrete Algorithms (SODA), 687-694.
27. Nilsson, N. J. 1980. Principles of Artificial Intelligence. Tioga Publishing Company.
28. Plaat, A.; Schaeffer, J.; Pijls, W.; and de Bruin, A. 1996. Best-first fixed-depth minimax algorithms. Artificial Intelligence 87(1-2):255-293.
29. Sanders, P.; Meyer, U.; and Sibeyn, J. F. 2002. Algorithms for Memory Hierarchies. Springer.
30. Tesauro, G. 1995. Temporal difference learning and TD-Gammon. Communications of the ACM 38:58-68.
31. Tsitsiklis, J., and Roy, B. V. 1996. Feature-based methods for large scale dynamic programming. Machine Learning 22:59-94.
32. Wingate, D., and Seppi, K. D. 2004. Cache performance of priority metrics for MDP solvers. In AAAI Workshop on Learning and Planning in Markov Processes, 103-106.
33. Zhou, R., and Hansen, E. 2004. Structured duplicate detection in external-memory graph search. In AAAI, 683-689.
34. Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170:385-408.