Domain-independent construction of pattern database heuristics for cost-optimal planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1007-1012

  Haslum, Patrik ^a   Botea, Adi ^a   Helmert, Malte ^b   Bonet, Blai ^c   Koenig, Sven ^d  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF FREIBURG   (Germany)

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

^d Keck School of Medicine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC SEARCH; PATTERN DATABASE HEURISTICS (PDB); SEARCH SPACE;

DATA MINING; HEURISTIC ALGORITHMS; PATTERN RECOGNITION; PROBLEM SOLVING; PROCESS PLANNING;

DATABASE SYSTEMS;

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

References (12)

1. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
2. Edelkamp, S. 2001. Planning with pattern databases. In Proc. 6th European Conference on Planning (ECP '01), 13-24.
3. Edelkamp, S. 2006. Automated creation of pattern database search heuristics. In Proc. 4th Workshop on Model Checking and Artificial Intelligence (MoChArt'06).
4. Feiner, A.; Korf, R.; and Hanan, S. 2004. Additive pattern database heuristics. Journal of AIResearch 22:279-318.
5. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proc. 20th National Conference on AI (AAAI'05), 1163-1168.
6. Helmert, M. 2006. Solving Planning Tasks in Theory and Practice. Ph.D. Dissertation, Albert-Ludwigs-Universität Freiburg.
7. Holte, R.; Felner, A.; Newton, J.; Meshulam, R.; and Furcy, D. 2006. Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence 170:1123-1136.
8. Junghanns, A., and Schaeffer, J. 2001. Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence 129(1-2):219-251.
9. Korf, R., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg Towers of Hanoi problem. In Proc. 20th International Joint Conference on AI (IJCAI'07), 2324-2329.
10. Korf, R.; Reid, M.; and Edelkamp, S. 2001. Time complexity of iterative-deepening-A*. Artificial Intelligence 129:199-218.
11. Tomita, E.; Tanaka, A.; and Takahashi, H. 2004. The worst-case time complexity for generating all maximal cliques. In Computing and Combinatorics (COCOON'04), volume 3106 of LNCS, 161-170. Springer Verlag.
12. Wilson, E. 1927. Probable inference, the law of succession, and statistical inference. Journal of the American Statistical Association 22:209-212.