Pattern database heuristics for fully observable nondeterministic planning

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 105-112

  Mattmüller, Robert ^a   Ortlieb, Manuela ^a   Helmert, Malte ^a   Bercher, Pascal ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN-INDEPENDENT PLANNING; EXPLICIT STATE; INTERNATIONAL PLANNING COMPETITIONS; LOCAL SEARCH; NONDETERMINISTIC PLANNING; PATTERN COLLECTIONS; PATTERN DATABASE; PATTERN SELECTION; PLAN QUALITY; PLANNING PROBLEM; SEARCH ALGORITHMS; SYMBOLIC REGRESSION; UNCERTAIN ENVIRONMENTS;

ALGORITHMS; BENCHMARKING;

PLANNING;

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

References (13)

1. + planning. Comput. Intell. 11(4):625-655.
2. Bellman, R. 1957. Dynamic Programming. Princeton University Press.
3. Bercher, P., and Mattmüller, R. 2008. A planning graph heuristic for forward-chaining adversarial planning. In ECAI'08, 921-922.
4. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2006. Planning graph heuristics for belief space search. JAIR 26:35-99.
5. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Intell. 147(1-2):35-84.
6. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Comput. Intell. 14(3):318-334.
7. Edelkamp, S. 2001. Planning with pattern databases. In ECP'01, 13-24.
8. Hansen, E. A., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artif. Intell. 129(1-2):35-62.
9. 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'07, 1007-1012.
10. Helmert, M. 2009. Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6):503-535.
11. Hoffmann, J., and Brafman, R. I. 2005. Contingent planning via heuristic forward search with implicit belief states. In ICAPS'05, 71-80.
12. Kissmann, P., and Edelkamp, S. 2009. Solving fully-observable non-deterministic planning problems via translation into a general game. In KI'09, volume 5803 of LNCS, 1-8. Springer.
13. Martelli, A., and Montanari, U. 1973. Additive AND/OR graphs. In IJCAI'73, 1-11.