Pruning methods for optimal delete-free planning

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

Volumn , Issue , 2012, Pages 56-64

  Gefen, Avitan ^a   Brafman, Ronen I ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AND/OR GRAPHS; PLANNING DOMAINS; PLANNING PROBLEM; PRUNING METHODS; PRUNING TECHNIQUES; SUB-PLANS;

OPTIMIZATION;

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

References (22)

1. Brafman, R. I., and Domshlak, C. 2006. Factored planning: How, when, and when not. In AAAI. AAAI Press.
2. Bylander, T. 1994. The computational complexity of propositional strips planning. Artif Intell. 69(1-2):165-204.
3. Chen, Y., and Yao, G. 2009. Completeness and optimality preserving reduction for planning. In IJCAI, 1659-1664.
4. Chen, Y.; Xu, Y.; and Yao, G. 2009. Stratified planning. In IJCAI, 1665-1670.
5. Coelho, H.; Studer, R.; and Wooldridge, M., eds. 2010. ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings, volume 215 of Frontiers in Artificial Intelligence and Applications. IOS Press.
6. Coles, A. J., and Coles, A. 2010. Completeness-preserving pruning for optimal planning. In Coelho et al. (2010), 965-966.
7. Fox, M., and Long, D. 1999. The detection and exploitation of symmetry in planning problems. In Dean, T., ed., IJCAI, 956-961. Morgan Kaufmann.
8. Gallo, G.; Longo, G.; Pallottino, S.; and Nguyen, S. 1993. Directed hypergraphs and applications. Discrete Applied Mathematics 42(2-3):177-201.
9. Gefen, A., and Brafman, R. I. 2011. The minimal seed set problem. In Bacchus, F.; Domshlak, C.; Edelkamp, S.; and Helmert, M., eds., ICAPS. AAAI.
10. Gefen, A., and Brafman, R. I. 2012. Pruning methods for optimal delete-free planning. Technical report, Department of Computer Science Ben-Gurion University.
11. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In Gerevini, A.; Howe, A. E.; Cesta, A.; and Refanidis, I., eds., ICAPS. AAAI.
12. Helmert, M., and Röger, G. 2008. How good is almost perfect? In Fox, D., and Gomes, C. P., eds., AAAI, 944-949. AAAI Press.
13. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In Boddy, M. S.; Fox, M.; and Thiébaux, S., eds., ICAPS, 176-183. AAAI.
14. Helmert, M. 2006. The fast downward planning system. J. Artif. Intell. Res. (JAIR) 26:191-246.
15. Hoffmann, J., and Nebel, B. 2001. The FF planning system: fast plan generation through heuristic search. J. Artif. Int. Res. 14(1):253-302.
16. Hoffmann, J.; Porteous, J.; and Sebastia, L. 2004. Ordered landmarks in planning. J. Artif. Intell. Res. (JAIR) 22:215-278.
17. Keyder, E.; Richter, S.; and Helmert, M. 2010. Sound and complete landmarks for and/or graphs. In Coelho et al. (2010), 335-340.
18. Long, D., and Fox, M. 1999. Efficient implementation of the plan graph in stan. J. Artif. Intell. Res. (JAIR) 10:87-115.
19. Pochter, N.; Zohar, A.; and Rosenschein, J. S. 2011. Exploiting problem symmetries in state-based planners. In Burgard, W., and Roth, D., eds., AAAI. AAAI Press.
20. Röger, G., and Helmert, M. 2010. The more, the merrier: Combining heuristic estimators for satisficing planning. In ICAPS, 246-249.
21. Wolfe, J., and Russell, S. J. 2011. Bounded intention planning. In Walsh, T., ed., IJCAI, 2039-2045. IJCAI/AAAI.
22. Xu, Y.; Chen, Y.; Lu, Q.; and Huang, R. 2011. Theory and algorithms for partial order based reduction in planning. CoRR abs/1106.5427.