Width and serialization of classical planning problems

Frontiers in Artificial Intelligence and Applications

Volumn 242, Issue , 2012, Pages 540-545

  Lipovetzky, Nir ^a   Geffner, Hector ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b INSTITUCIÓ CATALANA DE RECERCA I ESTUDIS AVANÇATS ICREA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

BENCHMARK DOMAINS; BLIND SEARCHES; CLASSICAL PLANNING; EXPONENTIALS; PLANNING DOMAINS; PLANNING PROBLEM; POLYNOMIAL-TIME; SEARCH PROCEDURES; SIMPLE++; SINGLE-ATOMS;

POLYNOMIAL APPROXIMATION;

EID: 84878786771     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-098-7-540     Document Type: Conference Paper

References (20)

1. E. Amir and B. Engelhardt, 'Factored planning.', in Proc. IJCAI-03, (2003).
2. C. Bäckström, Five years of tractable planning, 19-33, IOS Press, 1996.
3. B. Bonet and H. Geffner, 'Planning as heuristic search', Artificial Intelligence, 129, 5-33, (2001).
4. R. I. Brafman and C. Domshlak, 'Factored planning: How, when, and when not.', in Proc. AAAI-06, (2006).
5. T. Bylander, 'The computational complexity of STRIPS planning', Artificial Intelligence, 69, 165-204, (1994).
6. H. Chen and O. Giménez, 'Act local, think global: Width notions for tractable planning', in Proc. ICAPS-07, (2007).
7. R. Dechter, Constraint Processing, Morgan Kaufmann, 2003.
8. E.C. Freuder, 'A sufficient condition for backtrack-free search', J. ACM, 29, 24-32, (1982).
9. P. Haslum and H. Geffner, 'Admissible heuristics for optimal planning', in Proc. AIPS-00, (2000).
10. J. Hoffmann, 'The Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables.', JAIR, 20, 291-341, (2003).
11. J. Hoffmann, 'Where 'ignoring delete lists' works: Local search topology in planning benchmarks', JAIR, 24, 685-758, (2005).
12. +', JAIR, 41, 155-229, (2011).
13. J. Hoffmann and B. Nebel, 'The FF planning system: Fast plan generation through heuristic search', JAIR, 14, 253-302, (2001).
14. J. Hoffmann, J. Porteous, and L. Sebastia, 'Ordered landmarks in planning', JAIR, 22, 215-278, (2004).
15. E. Keyder, S. Richter, and M. Helmert, 'Sound and complete landmarks for and/or graphs', in Proc. ECAI-10, (2010).
16. N. Lipovetzky and H. Geffner, 'Searching for plans with carefully designed probes', in Proc. ICAPS-11, (2011).
17. S. Richter and M. Helmert, 'Preferred operators and deferred evaluation in satisficing planning', in Proc. ICAPS-09, (2009).
18. S. Richter, M. Helmert, and M. Westphal, 'Landmarks revisited', in Proc. AAAI-08, (2008).
19. S. Richter and M. Westphal, 'The LAMA planner: Guiding cost-based anytime planning with landmarks', JAIR, 39, 122-177, (2010).
20. L. Zhu and R. Givan, 'Landmark extraction via planning graph propagation', in Proc. ICAPS-03 Doctoral Consortium, (2003).