Improving heuristics through search

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 1031-1032

  Haslum, P ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS;

AND/OR GRAPHS; DATABASE SEARCHES; PATTERN DATABASE; PATTERN SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 85017401525     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (9)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1987.
2. R.E. Bellman, Dynamic Programming, Princeton University Press, 1957.
3. J.C. Culberson and J. Schaeffer, Searching with pattern databases', in Canadian Conference on AI, (1996).
4. S. Edelkamp, Planning with pattern databases', in Proc. 6th European Conference on Planning, (2001).
5. P. Haslum and H. Geffner, Admissible heuristics for optimal planning', in Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling. AAAI Press, (2000).
6. P. Haslum and H. Geffner, Heuristic planning with time and resources', in Proc. 6th European Conference on Planning (ECP'01), pp. 121-132, (2001).
7. A. Junghanns and J. Schaeffer, Sokoban: Enhancing general singleagent search methods using domain knowledge', Artificial Intelligence, 129(1-2), 219-251, (2001).
8. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.
9. A. Plaat, J. Schaeffer, W. Pijls, and de Bruin A.,Best-first fixed-depth minimax algorithms', Artificial Intelligence, 87(1-2), 255-293, (1996).