Improving heuristics through relaxed search - An analysis of TP4 and HSP*a in the 2004 planning competition

Journal of Artificial Intelligence Research

Volumn 25, Issue , 2006, Pages 233-267

  Haslum, Patrik ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; COSTS; FUNCTIONS; HEURISTIC METHODS; PARAMETER ESTIMATION; PLANNING; REGRESSION ANALYSIS;

OPTIMAL COST FUNCTION; REGRESSION PLANNING; REGRESSION SEARCH SPACE; RELAXED SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 33744475106     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1885     Document Type: Article

References (39)

1. Aho, A., Hopcroft, J., & Ullman, J. (1983). Data Structures and Algorithms. Addison-Wesley.
2. Bellman, R. (1957). Dynamic Programming. Princeton University Press.
3. Bonet, B., & Geffner, H. (2004). An algorithm better than AO*?. In Proc. 20th National Conference on AI (AAAI'05), pp. 1343-1347.
4. Cazenave, T. (2001). Iterative widening. In Proc. 17th International Conference on Artificial Intelligence (IJCAI'01), pp. 523-528.
5. Culberson, J., & Schaeffer, J. (1996). Searching with pattern databases. In Canadian Conference on AI, Vol. 1081 of LNCS, pp. 402-416. Springer.
6. Edelkamp, S. (2001). Planning with pattern databases. In Proc. 6th European Conference on Planning (ECP'01), pp. 13-24.
7. Edelkamp, S., & Hoffmann, J. (2004). PDDL2.2: the language for the classical part of IPC-4. In 4th International Planning Competition Booklet, pp. 2-6. Available at http://ipc.icaps-conference.org/.
8. Felner, A., Korf, R., & Hanan, S. (2004). Additive pattern database heuristics. Journal of AI Research, 22, 279-318.
9. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of AI Research, 20, 61-124.
10. Garrido, A., Fox, M., & Long, D. (2002). A temporal planning system for durative actions of PDDL2.1. In Proc of the 15th Eureopean Conference on Artificial Intelligence, (ECAI'02), pp. 586-590.
11. Garrido, A., Onaindia, E., & Barber, F. (2001). Time-optimal planning in temporal problems. In Proc. 6th European Conference on Planning (ECP'01), pp. 397-402.
12. Gaschnig, J. (1979). A problem similarity approach to devising heuristics: First results. In Proc. 6th International Joint Conference on Artificial Intelligence (IJCAI'79), pp. 301-307.
13. Ginsberg, M., & Harvey, W. (1992). Iterative broadening. Artificial Intelligence, 55(2-3), 367-383.
14. Haslum, P. (2004a). Improving heuristics through search. In Proc. European Conference on AI (ECAI'04), pp. 1031-1032.
15. a. In 4th International Planning Competition Booklet, pp. 38-40. Available at http://ipc.icaps-conference.org/.
16. Haslum, P., Bonet, B., & Geffner, H. (2005). New admissible heuristics for domain-independent planning. In Proc. 20th National Conference on AI (AAAI'05), pp. 1163-1168.
17. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00), pp. 140-149. AAAI Press.
18. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources. In Proc. 6th European Conference on Planning (ECP'01), pp. 121-132.
19. Hernadvölgyi, I., & Holte, R. (2000). Experiments with automatically created memory-based heuristics. In In Proc. Abstraction, Reformulation, and Approximation, 4th International Symposium (SARA 2000), pp. 281-290.
20. Hoffmann, J., & Edelkamp, S. (2005). The classical part of IPC-4: An overview. To appear in the Journal of AI Research (this Special Track).
21. Hoffmann, J., Edelkamp, S., Englert, R., Liporace, F. Thiébaux, S., & Trüg, S. (2004). Towards realistic benchmarks for planning: The domains used in the classical part of IPC-4. In 4th International Planning Competition Booklet, pp. 7-14. Available at http://ipc.icaps-conference.org/.
22. Holte, R., Perez, M. B., Zimmer, R. M., & MacDonald, A. J. (1996). Hierarchical A*: Searching abstraction hierarchies efficiently. In Proc. 13th National Conference on Artificial Intelligence (AAAI'96), pp. 530-535.
23. Junghanns, A., & Schaeffer, J. (2001). Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1-2), 219-251.
24. Korf, R. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
25. Korf, R. (1999). Artificial intelligence search algorithms. In Handbook of Algorithms and Theory of Computation, chap. 36. CRC Press.
26. Liu, Y., Koenig, S., & Furcy, D. (2002). Speeding up the calculation of heuristics for heuristic search-based planning. In Proc. 18th National Conference on Artificial Intelligence (AAAI'02), pp. 484-491.
27. Long, D., & Fox, M. (2003). Exploiting a graphplan framework in temporal planning. In 13th International Conference on Automated Planning and Scheduling (ICAPS'03), pp. 51-62.
28. Martelli, A., & Montanari, U. (1973). Additive AND/OR graphs. In Proc. 3rd International Joint Conference on Artificial Intelligence (IJCAI'73), pp. 1-11.
29. Nilsson, N. J. (1968). Searching problem-solving and game-playing trees for minimal cost solutions. In Proc. IFIP Congress, pp. 125-130.
30. Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
31. Plaat, A., Schaeffer, J., Pijls, W., & A., d. (1996). Best-first fixed-depth minimax algorithms. Artificial Intelligence, 87(1-2), 255-293.
32. Prieditis, A. E. (1993). Machine discovery of effective admissible heuristics. Machine Learning, 12, 117-141.
33. Reinfeld, A., & Marsland, T. (1994). Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7), 701-710.
34. Smith, D. (2004). Choosing objectives in over-subscription planning. In Proc. 14th International Conference on Automated Planning & Scheduling (ICAPS'04), pp. 393-401.
35. Smith, D., & Weld, D. (1999). Temporal planning with mutual exclusion reasoning. In Proc. 16th International Joint Conference on Artificial Intelligence (IJCAI'99), pp. 326-333.
36. Trinquart, R. (2003). Analyzing reachability within plan space. In ICAPS'03 Doctoral Consortium, pp. 122-126.
37. Valtorta, M. (1984). A result on the computational complexity of heuristic estimates for the A* algorithm. Information Sciences, 34, 48-59.
38. Verfaillie, G., Lemaitre, M., & Schiex, T. (1996). Russian doll search for solving constraint optimization problems. In Proc. 13th National Conference on Artifical Intelligence (AAAI'96), pp. 181-187.
39. Vidal, V., & Geffner, H. (2004). Branching and pruning: An optimal temporal POCL planner based on constraint programming. In Proc. 19th National Conference on Artificial Intelligence (AAAI'04), pp. 570-577.