Simultaneous heuristic search for conjunctive subgoals

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1235-1240

  Zhu, Lin ^a   Givan, Robert ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; BENCHMARKING; MATHEMATICAL MODELS; PLANNING; THEOREM PROVING;

BENCHMARK PLANNING; CONJUNCTIVE HEURISTICS; PARAMETER VALUES; PLANNING DOMAINS;

HEURISTIC METHODS;

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

References (22)

1. Blum, A., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):281-300.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
3. Bonet, B., and Geffner, H. 2003. Faster heuristic search algorithms for planning with uncertainty and full feedback. In IJCAI, 1233-1238.
4. Cheng, J., and Irani, K. B. 1989. Ordering problem subgoals. In IJCAI, 931-936.
5. Culberson, J. C., and Schaeffer, J. 1996. Searching with pattern databases. In Canadian Conference on AI, 402-416.
6. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In AIPS, 274-283.
7. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs in LPG. JAIR 20:239-290.
8. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In AIPS, 140-149.
9. Helmert, M. 2003. Complexity results for standard benchmark domains in planning. Artificial Intelligence 143(2):219-262.
10. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In ICAPS, 161-170.
11. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
12. Hoffmann, J.; Porteous, J.; and Sebastia, L. 2004. Ordered landmarks in planning. JAIR 22:215-278.
13. Hoffmann, J. 2002. Local search topology in planning benchmarks: A theoretical analysis. In AIPS, 92-100.
14. Hoffmann, J. 2003. The metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. JAIR 20:291-341.
15. Kambhampati, S.; Ihrig, L. H.; and Srivastava, B. 1996. A candidate set based analysis of subgoal interactions in conjunctive goal planning. In AIPS, 125-133.
16. Koehler, J., and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. JAIR 12:338-386.
17. Korf, R. E., and Taylor, L. A. 1996. Finding optimal solutions to the twenty-four puzzle. In AAAI, 1202-1207.
18. Korf, R. E. 1987. Planning as search: A quantitative approach. Artificial Intelligence 33(1):65-88.
19. Korf, R. E. 2000. Recent progress in the design and analysis of admissible heuristic functions. In AAAI, 1165-1170.
20. McAllester, D. A., and Rosenblitt, D. 1991. Systematic nonlinear planning. In AAAI, 634-639.
21. Nguyen, X., and Kambhampati, S. 2001. Reviving partial order planning. In IJCAI, 459-466.
22. Sacerdoti, E. D. 1975. The nonlinear nature of plans. In IJCAI, 206-214.