Maximizing over multiple pattern databases speeds up heuristic search

Artificial Intelligence

Volumn 170, Issue 16-17, 2006, Pages 1123-1136

  Holte, Robert C ^a   Felner, Ariel ^b   Newton, Jack ^a   Meshulam, Ram ^c   Furcy, David ^d  

^a UNIVERSITY OF ALBERTA   (Canada)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c BAR ILAN UNIVERSITY   (Israel)

^d UNIVERSITY OF WISCONSIN OSHKOSH   (United States)

Author keywords

Admissible heuristics; Heuristic search; IDA*; Pattern databases

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; ONLINE SEARCHING; OPTIMIZATION; PATTERN RECOGNITION; PERFORMANCE;

ADMISSIBLE HEURISTICS; HEURISTIC SEARCH; PATTERN DATABASES (PDB);

DATABASE SYSTEMS;

EID: 33750633519     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.09.002     Document Type: Article

References (26)

1. A. Auer, H. Kaindl, A case study of revisiting best-first vs. depth-first search, in: Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-04), August 2004, pp. 141-145
2. J.C. Culberson, J. Schaeffer, Efficiently searching the 15-puzzle, Technical Report, Department of Computer Science, University of Alberta, 1994
3. Culberson J.C., and Schaeffer J. Pattern databases. Computational Intelligence 14 3 (1998) 318-334
4. S. Edelkamp, Planning with pattern databases, in: Proceedings of the 6th European Conference on Planning (ECP-01), 2001, pp. 13-34
5. S. Edelkamp, A. Lluch-Lafuente, Abstraction in directed model checking, in: Proceedings of the Workshop on Connecting Planning Theory with Practice, at the International Conference on Automated Planning and Scheduling, 2004, pp. 7-13
6. Felner A., Korf R.E., and Hanan S. Additive pattern database heuristics. Journal of Artificial Intelligence Research (JAIR) 22 (2004) 279-318
7. A. Felner, R. Meshulam, R.C. Holte, R.E. Korf, Compressing pattern databases, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), July 2004, pp. 638-643
8. A. Felner, U. Zahavi, R. Holte, J. Schaeffer, Dual lookups in pattern databases, in: Proc. IJCAI-05, 2005, pp. 103-108
9. Hart P.E., Nilsson N.J., and Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4 (1968) 100-107
10. I.T. Hernádvölgyi, Solving the sequential ordering problem with automatically generated lower bounds, in: Proceedings of Operations Research, 2003, pp. 355-362
11. I.T. Hernádvölgyi, Automatically generated lower bounds for search, PhD Thesis, School of Information Technology and Engineering, University of Ottawa, 2004
12. Hernádvölgyi I.T., and Holte R.C. Experiments with automatically created memory-based heuristics. Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA-2000). Lecture Notes in Artificial Intelligence vol. 1864 (2000), Springer, Berlin 281-290
13. Holte R.C., Grajkowski J., and Tanner B. Hierarchical heuristic search revisited. Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA-2005). Lecture Notes in Artificial Intelligence vol. 3607 (2005), Springer, Berlin 121-133
14. R.C. Holte, J. Newton, A. Felner, R. Meshulam, D. Furcy, Multiple pattern databases, in: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), June 2004, pp. 122-131
15. R.C. Holte, M.B. Perez, R.M. Zimmer, A.J. MacDonald, Hierarchical A*: Searching abstraction hierarchies efficiently, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 530-535
16. Korf R.E. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27 (1985) 97-109
17. R.E. Korf, Finding optimal solutions to Rubik's Cube using pattern databases, in: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 1997, pp. 700-705
18. R.E. Korf, Best-first frontier search with delayed duplicate detection, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), July 2004, pp. 677-682
19. Korf R.E., and Felner A. Disjoint pattern database heuristics. Artificial Intelligence 134 1-2 (2002) 9-22
20. Korf R.E., Reid M., and Edelkamp S. Time complexity of Iterative-Deepening-A*. Artificial Intelligence 129 1-2 (2001) 199-218
21. Manzini G. BIDA*: An improved perimeter search algorithm. Artificial Intelligence 75 2 (1995) 347-360
22. K. Qian, A. Nymeyer, Guided invariant model checking based on abstraction and symbolic pattern databases, in: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-04), 2004, pp. 497-511
23. U. Zahavi, A. Felner, R. Holte, J. Schaeffer, Dual search in permutation state spaces, in: Proc. AAAI-06, 2006, pp. 1076-1081
24. R. Zhou, E.A. Hansen, Breadth-first heuristic search, in: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), June 2004, pp. 92-100
25. R. Zhou, E.A. Hansen, Space efficient memory based heuristics, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), July 2004, pp. 677-682
26. R. Zhou, E.A. Hansen, Structured duplicate detection in external-memory graph search, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), July 2004, pp. 683-688