Minimal landmarks for optimal delete-free planning

ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling

Volumn , Issue , 2012, Pages 353-357

  Haslum, Patrik ^a   Slaney, John ^a   Thiébaux, Sylvie ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

HITTING SETS; ON THE FLIES; PLANNING PROBLEM; RUNTIMES; SIMPLE AND EFFICIENT ALGORITHMS;

ALGORITHMS;

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

References (20)

1. Beasley, J. 1987. An algorithm for the set covering problem. European Journal of Operational Research 31:85-93.
2. + in theory and practice. In Proc. of the ICAPS'09 Workshop on Heuristics for Domain-Independent Planning.
3. Bonet, B., and Castillo, J. 2011. A complete algorithm for generating landmarks. In Proc. 21st International Conference on Automated Planning and Scheduling (ICAPS'11), 315-318.
4. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
5. Bonet, B., and Helmert, M. 2010. Strengthening landmark heuristics via hitting sets. In Proc. 19th European Conference on Artificial Intelligence (ECAI'10), 329-334.
6. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2):165-204.
7. Chvatal, V. 1979. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3):233-235.
8. Coles, A.; Fox, M.; Long, D.; and Smith, A. 2008. Additive-disjunctive heuristics for optimal planning. In Proc. 18th International Conference on Automated Planning and Scheduling (ICAPS'09), 44-51.
9. De Kleer, J. 2011. Hitting set algorithms for model-based diagnosis. In Proc. 22nd International Workshop on Principles of Diagnosis (DX'11), 100-105.
10. Fisher, M., and Kedia, P. 1990. Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36(6):674-688.
11. Gefen, A., and Brafman, R. 2011. The minimal seed set problem. In Proc. 21st International Conference on Automated Planning and Scheduling (ICAPS'11), 319-322.
12. Gefen, A., and Brafman, R. 2012. Pruning methods for optimal delete-free planning. In Proc. 22nd International Conference on Automated Planning and Scheduling (ICAPS'12).
13. Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann Publishers. ISBN: 1-55860-856-7.
14. Halldórsson, M. 2000. Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications 4(1):1-16.
15. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proc. 20th National Conference on AI (AAAI'05), 1163-1168.
16. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. 19th International Conference on Automated Planning and Scheduling (ICAPS'09), 162-169.
17. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of AI Research 14:253-302.
18. Liu, Y.; Koenig, S.; and Furcy, D. 2002. Speeding up the calculation of heuristics for heuristic search-based planning. In Proc. 18th National Conference on Artificial Intelligence (AAAI'02), 484-491.
19. Pommerening, F., and Helmert, M. 2012. Optimal planning for delete-free tasks with incremental lm-cut. In Proc. 22nd International Conference on Automated Planning and Scheduling (ICAPS'12).
20. Porco, A.; Machado, A.; and Bonet, B. 2011. Automatic polytime reductions of NP problems into a fragment of STRIPS. In Proc. 21st International Conference on Automated Planning and Scheduling (ICAPS'11), 178-185.