A general theory of additive state space abstractions

Journal of Artificial Intelligence Research

Volumn 32, Issue , 2008, Pages 631-662

  Yang, Fan ^a   Culberson, Joseph ^a   Holte, Robert ^a   Zahavi, Uzi ^b   Felner, Ariel ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b BAR ILAN UNIVERSITY   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; TESTBEDS;

ABSTRACT SPACE; GENERAL THEORY; PATTERN DATABASE; RUBIK'S CUBES; SPECIAL PROPERTIES; STATE-OF-THE-ART METHODS; STATE-OF-THE-ART PERFORMANCE; THREE ORDERS OF MAGNITUDE;

ADDITIVES;

EID: 52649179826     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2486     Document Type: Article

References (36)

1. Banerji, R. B. (1980). Artificial Intelligence: A Theoretical Approach. North Holland.
2. Chen, T., & Skiena, S. (1996). Sorting with fixed-length reversals. Discrete Applied Mathematics, 71(1-3), 269-295.
3. Culberson, J. C., Schaeffer, J. (1996). Searching with pattern databases. In Advances in Artificial Intelligence (Lecture Notes in Artificial Intelligence 1081), pp. 402-416. Springer.
4. Culberson, J. C., & Schaeffer, J. (1994). Efficiently searching the 15-puzzle. Tech. rep. TR94-08, Department of Computing Science, University of Alberta.
5. Culberson, J. C., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3), 318-334.
6. Edelkamp, S. (2001). Planning with pattern databases. In Proceedings of the 6th European Conference on Planning, pp. 13-24.
7. Edelkamp, S. (2002). Symbolic pattern databases in heuristic search planning. In Proceedings of Sixth International Conference on AI Planning and Scheduling (AIPS-02), pp. 274-283.
8. Erdem, E., & Tillier, E. (2005). Genome rearrangement and planning. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), pp. 1139-1144.
9. Feiner, A., & Adler, A. (2005). Solving the 24 puzzle with instance dependent pattern databases. Proc. SARA-2005, Lecture Notes in Artificial Intelligence, 3607, 248-260.
10. Felner, A., Korf, E., & Hanan, S. (2004). Additive pattern database heuristics. Journal of Artificial Intelligence Research, 22, 279-318.
11. Felner, A., Zahavi, U., Schaeffer, J., & Holte, R. (2005). Dual lookups in pattern databases. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 103-108.
12. Gaschnig, J. (1979). A problem similarity approach to devising heuristics: First results. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence (IJCAI-79), pp. 301-307.
13. Guida, G., & Somalvico, M. (1979). A method for computing heuristics in problem solving. Information Sciences, 19, 251-259.
14. Haslum, P., Bonet, B., & Geffner, H. (2005). New admissible heurisitics for domain-independent planning. In Proceedings of The Twentieth National Conference on Artificial Intelligence (AAAI-05), pp. 1163-1168.
15. Haslum, P., Botea, A., Helmert, M., Bonet, B., & Koenig, S. (2007). Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proceedings of The Twenty-Second National Conference on Artificial Intelligence (AAAI-07), pp. 1007-1012.
16. Hell, P., & Nesetril, J. (2004). Graphs and homomorphisms. The Oxford Lecture Series in Mathematics and its Applications, 28.
17. Helmert, M., Haslum, P., & Hoffmann, J. (2007). Flexible abstraction heuristics for optimal sequential planning. In Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), pp. 176-183.
18. Hemádvolgyi, I., & Holte, R. C. (2000). Experiments with automatically created memory-based heuristics. Proc. SARA-2000, Lecture Notes in Artificial Intelligence, 1864, 281-290.
19. Hernádvölgyi, I. T. (2003). Solving the sequential ordering problem with automatically generated lower bounds. In Proceedings of Operations Research 2003 (Heidelberg, Germany), pp. 355-362.
20. Holte, R. C., Perez, M. B., Zimmer, R. M., & MacDonald, A. J. (1996). Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 530-535.
21. Holte, R. C., Felner, A., Newton, J., Meshulam, R., & Furcy, D. (2006). Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence, 170, 1123-1136.
22. Holte, R. C., Grajkowski, J., & Tanner. B. (2005). Hierarchical heuristic search revisited. Proc. SARA-2005, Lecture Notes in Artificial Intelligence, 3607, 121-133.
23. Holte, R. C., & Hernádvölgyi, I. T. (2004). Steps towards the automatic creation of search heuristics. Tech. rep. TR04-02, Computing Science Department, University of Alberta, Edmonton, Canada T6G 2E8.
24. Holte, R. C., Newton, J., Felner, A., Meshulam, R., & Furcy, D. (2004). Multiple pattern databases. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 122-131.
25. Katz, M., & Domshlak, C. (2007). Structural patterns heuristics: Basic idea and concrete instance. In Proceedings of ICAPS-07 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges.
26. Kibler, D. (1982). Natural generation of admissible heuristics. Tech. rep. TR-188, University of California at Irvine.
27. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
28. Korf, R. E. (1997). Finding optimal solutions to Rubik's Cube using pattern databases. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pp. 700-705.
29. Korf, R. E., & Felner, A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134, 9-22.
30. Korf, R. E., & Taylor, L. A. (1996). Finding optimal solutions to the twenty-four puzzle. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 1202-1207.
31. Mostow, J., & Prieditis, A. (1989). Discovering admissible heuristics by abstracting and optimizing: A transformational approach. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-89), pp. 701-707.
32. Pearl, J. (1984). Heuristics. Addison Wesley, Reading, MA.
33. Prieditis, A. E. (1993). Machine discovery of effective admissible heuristics. Machine Learning, 12, 117-141.
34. Valtorta, M. (1984). A result on the computational complexity of heuristic estimates for the A* algorithm. Information Science, 34, 48-59.
35. Yang, F., Culberson, J., & Holte, R. (2007). A general additive search abstraction. Tech. rep. TR07-06, Computing Science Department, University of Alberta, Edmonton, Canada T6G 2E8.
36. Zahavi, U., Feiner, A., Holte, R., & Schaeffer, J. (2006). Dual search in permutation state spaces. In Proceedings of the Twenty-First Conference on Artificial Intelligence (AAAI-06), pp. 1076-1081.