Dual lookups in pattern databases

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 103-108

  Felner, Ariel ^a   Zahavi, Uzi ^b   Schaeffer, Jonathan ^c   Holte, Robert C ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC FUNCTIONS; LOOKUPS; PATTERN DATABASE; RUBIK'S CUBES; SEARCH TREES; SLIDING-TILE PUZZLES;

HEURISTIC ALGORITHMS; HEURISTIC METHODS;

ARTIFICIAL INTELLIGENCE;

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

References (10)

1. J. C. Culberson and J. Schaeffer. Efficiently searching the 15-puzzle. Technical report, Department of Computer Science, University of Alberta, 1994.
2. J. C. Cullberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998.
3. S. Edelkamp. Planning with pattern databases. ECP-01, 2001.
4. A. Felner, R. E. Korf, and S. Hanan. Addtive pattern database heuristics. Journal of Artificial Intelligence Research(JAIR), 22:279-318, 2004.
5. R. C. Holte, M. B. Perez, R. M. Zimmer, and A. J. MacDonald. Hierarchical A*: Searching abstraction hierarchies efficiently. AAAI, pages 530-535, 1996.
6. R. Holte, J. Newton, A. Felner, and D. Furcy. Multiple pattern databases. ICAPS, pages 122-131, 2004.
7. R. E. Korf and A. Felner. Disjoint pattern database heuristics. Artificial Intelligence, 134:9-22, 2002. (Pubitemid 34086577)
8. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. AIJ, 27:97-109, 1985.
9. R. E. Korf. Finding optimal solutions to Rubik's Cube using pattern databases. AAAI, pages 700-705, 1997.
10. L. Mero. A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 23:13-27, 1984.