Analyzing the performance of pattern database heuristics

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1164-1170

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRUTE-FORCE SEARCH; DATABASE HEURISTICS; RUBIK'S CUBE;

HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; PATTERN RECOGNITION; PROBLEM SOLVING;

DATABASE SYSTEMS;

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

References (14)

1. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
2. Edelkamp, S. 2001. Planning with pattern databases. In Proceedings of the European Conference on Planning (ECP), 13-25.
3. Felner, A.; Korf, R.; and Hanan, S. 2004. Additive pattern database heuristics. Journal of Artificial Intelligence Research 22:279-318.
4. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2): 100-107.
5. Hohwald, H.; Thayer, I.; and Korf, R. 2003. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 1239-1245.
6. Holte, R., and Hernadvolgyi, I. 1999. A space-time trade-off for memory-based heuristics. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), 704-709.
7. Holte, R.; Newton, J.; Felner, A.; Meshulam, R.; and Furcy, D. 2004. Multiple pattern databases. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-2004), 122-131.
8. Holte, R.; Newton, J.; Felner, A.; Meshulam, R.; and Furcy, D. 2006. Maximimizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence 170(16-17): 1123-1136.
9. Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
10. Korf, R., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 2334-2329.
11. Korf, R., and Reid, M. 1998. Complexity analysis of admissible heuristic search. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 299-304.
12. Korf, R.; Reid, M.; and Edelkamp, S. 2001. Time complexity of Iterative-Deepening-A*. Artificial Intelligence 129(1-2):199-218.
13. Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
14. Korf, R. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), 700-705.