Structural-pattern databases

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 186-193

  Katz, Michael ^a   Domshlak, Carmel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SPACE; HEURISTIC FUNCTIONS; HEURISTIC SEARCH; LOOKUPS; NODE COMPLEXITY; OFFLINE; OPTIMAL PLANNING; PATTERN DATABASE; PLANNING TASKS;

DATABASE SYSTEMS; HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING;

ABSTRACTING;

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

References (20)

1. + planning. Comp. Intell. 11(4):625-655.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
3. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Comp. Intell. 14(4):318-334.
4. Dräger, K.; Finkbeiner, B.; and Podelski, A. 2006. Directed model checking with distance-preserving abstractions. In SPIN, 1934.
5. Edelkamp, S., and Kissmann, P. 2009. Optimal symbolic planning with action costs and preferences. In IJCAI.
6. Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-24.
7. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In AIPS, 274-293.
8. Felner, A.; Korf, R. E.; and Hanan, S. 2004. Additive pattern database heuristics. JAIR 22:279-318.
9. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In ICAPS, 140-149.
10. Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S, 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI, 1007-1012.
11. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In AAAI, 1163-1168.
12. Haslum, P. 2008. Additive and reversed relaxed reachability heuristics revisited. In IPC.
13. Helmert, M., and Mattmüller, R. 2007. Accuracy of admissible heuristic functions in selected planning domains. In AAAI, 938-943.
14. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In ICAPS, 200-207.
15. Helmert, M. 2006. The Fast Downward planning system. JAIR 26:191-246.
16. Hernadvölgyi, I., and Holte, R. 1999. PSVN: A vector representation for production systems. Technical Report 1999-07, University of Ottawa.
17. Karpas, E., and Domshlak, C. 2009. Cost-optimal planning with landmarks. In IJCAI.
18. Katz, M., and Domshlak, C. 2008a. Optimal additive composition of abstraction-based admissible heuristics. In ICAPS, 174-181.
19. Katz, M., and Domshlak, C. 2008b. Structural patterns heuristics via fork decomposition. In ICAPS, 182-189.
20. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In AAAI, 975-982.