Incremental lower bounds for additive cost planning problems

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

Volumn , Issue , 2012, Pages 74-82

  Haslum, Patrik ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COST PLANNING; LOWER BOUNDS; PLAN QUALITY; PLANNING PROBLEM; SEARCH ALGORITHMS; STATE SPACE;

COSTS;

PROBLEM SOLVING;

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

References (22)

1. Aho, A.; Garey, M.; and Ullman, J. 1972. The transitive reduction of a directed graph. SIAM Journal on Computing 1(2):131-137.
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 Helmert, M. 2010. Strengthening landmark heuristics via hitting sets. In Proc. 19th European Conference on Artificial Intelligence (ECAI'10), 329-334.
5. Chatterjee, K.; Henzinger, T.; Jhala, R.; and Majumdar, R. 2005. Counterexample-guided planning. In Proc. 21st International Conference on Uncertainty in Artificial Intelligence (UAI'05), 104-111.
6. Cornuéjols, G. 2008. Valid inequalities for mixed integer linear programs. Mathematical Programming 112(1):3-44. http://dx.doi.org/10.1007/ s10107-006-0086-0.
7. Cushing, W.; Benton, J.; and Kambhampati, S. 2010. Cost-based search considered harmful. In Proc. Symposium on Combinatorial Search (SoCS'10).
8. 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).
9. Ghallab, M.; Nau, D.; and Traverso P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann Publishers. ISBN: 1-55860-856-7.
10. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00), 140-149. AAAI Press.
11. Haslum, P., and Grastien, A. 2011. Diagnosis as planning: Two case studies. In ICAPS'11 Scheduling and Planning Applications Workshop.
12. Haslum, P.; Slaney, J.; and Thiébaux, S. 2012. Minimal landmarks for optimal delete-free planning. In Proc. 22nd International Conference on Automated Planning and Scheduling (ICAPS'12).
13. m. In Proc. of the 19th International Conference on Automated Planning and Scheduling (ICAPS'09).
14. Helmert, M., and Röger, G. 2008. How good is almost perfect? In Proc. 23nd AAAI Conference on Artificial Intelligence (AAAI'08), 944-949.
15. Helmert, M.; Röger, G.; Seipp, J.; Karpas, E.; Hoffmann, J.; Keyder, E.; Nissim, R.; Richter, S.; and Westphal, M. 2011. Fast downward stone soup (planner abstract). In 7th International Planning Competition (IPC 2011), Deterministic Part. http://www.plg.inf.uc3m.es/ipc2011-deterministic.
16. Nissim, R.; Hoffmann, J.; and Helmert, M. 2011. Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning. In Proc. of the 22nd International Joint Conference on AI (IJCAI'11), 1983-1990.
17. 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).
18. Robinson, N.; Gretton, C.; Pham, D.; and Sattar, A. 2010. Partial weighted MaxSAT for optimal planning. In Proc. 11th Pacific Rim International Conference on AI (PRICAI'10).
19. Slaney, J., and Thiebaux, S. 2001. Blocks world revisited. Artificial Intelligence 125. http://users.cecs.anu.edu.au/~jks/bw.html.
20. Thayer, J., and Ruml, W. 2011. Bounded suboptimal search: A direct approach using inadmissible estimates. In Proc. 22nd International Conference on Artificial Intelligence (IJCAI'11), 674-679.
21. van den Briel, M.; Benton, J.; Kambhampati, S.; and Vossen, T. 2007. An LP-based heuristic for optimal planning. In Proc. 13th International Conference on Principles and Practice of Constraint Programming (CP'07), 651-665.
22. Wilt, C., and Ruml, W. 2011. Cost-based heuristic search is sensitive to the ratio of operator costs. In Proc. Symposium on Combinatorial Search (SoCS'11).