Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 142-151

  Bonet, Blai ^a   Geffner, Héctor ^b  

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

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; FUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS;

LEARNING DEPTH-FIRST SEARCH (LDFS); MONOTONE VALUE FUNCTIONS; STATE MODELS; TRANSPOSITION TABLES;

HEURISTIC METHODS;

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

References (18)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bellman, R. 1957. Dynamic Programming. Princeton University Press.
3. Bertsekas, D. 1995. Dynamic Programming and Optimal Control, (2 Vols). Athena Scientific.
4. Bonet, B., and Geffner, H. 2003a. Faster heuristic search algorithms for planning with uncertainty and full feedback. In Gottlob, G., ed., Proc. 18th International Joint Conf. on Artificial Intelligence, 1233-1238. Acapulco, Mexico: Morgan Kaufmann.
5. Bonet, B., and Geffner, H. 2003b. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Giunchiglia, E.; Muscettola, N.; and Nau, D., eds., Proc. 13th International Conf. on Automated Planning and Scheduling, 12-21. Trento, Italy: AAAI Press.
6. Bonet, B., and Geffner, H. 2005. An algorithm better than AO*? In Veloso, M., and Kambhampati, S., eds., Proc. 20 National Conf. on Artificial Intelligence, 1343-1348. Pittsburgh, PA: AAAI Press / MIT Press.
7. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129:35-62.
8. Korf, R. 1985. Depth-first iterative-depeening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
9. Korf, R. 1990. Real-time heuristic search. Artificial Intelligence 42(2-3):189-211.
10. Martelli, A., and Montanari, U. 1973. Additive AND/OR graphs. In Nilsson, N., ed., Proc. 3rd International Joint Conf. on Artificial Intelligence, 1-11. Palo Alto, CA: William Kaufmann.
11. McMahan, H. B.; Likhachev, M.; and Gordon, G. J. 2005. Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In De Raedt, L., and Wrobel, S., eds., Proc. 22nd International Conf. on Machine Learning.
12. Newell, A.; Shaw, J. C.; and Simon, H. 1963. Chess-playing programs and the problem of complexity. In Feigenbaum, E., and Feldman, J., eds., Computers and Thought. McGraw Hill. 109-133.
13. Nilsson, N. 1980. Principles of Artificial Intelligence. Tioga.
14. Pearl, J. 1983. Heuristics. Morgan Kaufmann.
15. Plaat, A.; Schaeffer, J.; Pijls, W.; and de Bruin, A. 1996. Best-first fixed-depth minimax algorithms. Artificial Intelligence 87(1-2):255-293.
16. Reinefeld, A., and Marsland, T. 1994. Enhanced iterativedeepening search. IEEE Trans. on Pattern Analysis and Machine Intelligence 16(7):701-710.
17. Tarjan, R. E. 1972. Depth first search and linear graph algorithms. SIAM Journal on Computing 1(2):146-160.
18. Wah, B., and Shang, Y. 1994. A comparative study of IDA*-style searches. In Proc. 6th International Conf. on Tools with Artificial Intelligence, 290-296. IEEE Computer Society.