Multiple pattern databases

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 122-131

  Holte, R C ^a   Newton, Jack ^a   Felner, A ^b   Meshulam, R ^b   Furcy, David ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b BAR ILAN UNIVERSITY   (Israel)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING;

HEURISTIC FUNCTIONS; HEURISTIC-GUIDED PLANNING; MULTIPLE PATTERN DATABASES;

DATABASE SYSTEMS;

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

References (14)

1. Culberson, J. C., and Schaeffer, J. 1994. Efficiently searching the 15-puzzle. Technical report, Department of Computer Science, University of Alberta.
2. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Dweighter, H. 1975. Problem e2569. American Mathematical Monthly 82:1010.
4. Edelkamp, S. 2001. Planning with pattern databases. Proceedings of the 6th European Conference on Planning (ECP-01).
5. Hart, P.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4:100-107.
6. Hernádvölgyi, I. T., and Holte, R. C. 1999. PSVN: A vector representation for production systems. Technical Report TR-99-04, School of Information Technology and Engineering, University of Ottawa.
7. Hernádvölgyi, I. T., and Holte, R. C. 2000. Experiments with automatically created memory-based heuristics. Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA-2000), Lecture Notes in Artificial Intelligence 1864:281-290.
8. Hernádvölgyi, I. T. 2001. Searching for macro operators with automatically generated heuristics. Advances in Artificial Intelligence - Proceedings of the Fourteenth Biennial Conference of the Canadian Society for Computational Studies of Intelligence (LNAI 2056) 194-203.
9. Holte, R. C.; Perez, M. B.; Zimmer, R. M.; and MacDonald, A. J. 1996. Hierarchical A*: Searching abstraction hierarchies efficiently. Proc. Thirteenth National Conference on Artificial Intelligence (AAAI-96) 530-535.
10. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
11. Korf, R. E.; Reid, M.; and Edelkamp, S. 2001. Time complexity of Iterative-Deepening-A*. Artificial Intelligence 129(1-2):199-218.
12. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27:97-109.
13. Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97) 700-705.
14. Manzini, G. 1995. BIDA*: an improved perimeter search algorithm. Artificial Intelligence 75(2):347-360.