Who said we need to relax all variables?

ICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling

Volumn , Issue , 2013, Pages 126-134

  Katz, Michael ^a   Hoffmann, Jörg ^a   Domshlak, Carmel ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION THEOREMS; EFFICIENT COMPUTATION; HEURISTIC FUNCTIONS; OPTIMAL PLANNING; PLANNING DOMAINS; POLYNOMIAL-TIME; RELAXED SEMANTICS; STATE VARIABLES;

HEURISTIC ALGORITHMS;

SEMANTICS;

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

References (17)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
2. Bonet, B.; McCluskey, L.; Silva, J. R.; and Williams, B., eds. 2012. Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). AAAI Press.
3. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2):165-204.
4. Cai, D.; Hoffmann, J.; and Helmert, M. 2009. Enhancing the context-enhanced additive heuristic with precedence constraints. In Gerevini et al. (2009), 50-57.
5. Chen, H., and Giménez, O. 2010. Causal graphs and structurally restricted planning. Journal of Computer and System Sciences 76(7):579-592.
6. Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory. Springer-Verlag.
7. Fox, M., and Long, D. 2001. Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning. In Nebel, B., ed., Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 445-450. Seattle, Washington, USA: Morgan Kaufmann.
8. Gerevini, A.; Howe, A.; Cesta, A.; and Refanidis, I., eds. 2009. Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press.
9. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research 20:239-290.
10. Haslum, P. 2012. Incremental lower bounds for additive cost planning problems. In Bonet et al. (2012), 74-82.
11. Helmert, M., and Geffner, H. 2008. Unifying the causal graph and additive heuristics. In Rintanen, J.; Nebel, B.; Beck, J. C.; and Hansen, E., eds., Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), 140-147. AAAI Press.
12. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Koenig, S.; Zilberstein, S.; and Koehler, J., eds., Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), 161-170. Whistler, Canada: Morgan Kaufmann.
13. Helmert, M. 2006. The Fast Downward planning system. Journal of Artificial Intelligence Research 26:191-246.
14. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
15. +. Journal of Artificial Intelligence Research 41:155-229.
16. Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Ghallab, M., ed., Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-08), 588-592. Patras, Greece: Wiley.
17. Keyder, E.; Hoffmann, J.; and Haslum, P. 2012. Semi-relaxed plan heuristics. In Bonet et al. (2012).