Analyzing search topology without running any search: On the connection between causal graphs and h+

Journal of Artificial Intelligence Research

Volumn 41, Issue , 2011, Pages 155-229

  Hoffmann, Jörg ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS METHOD; BENCHMARK DOMAINS; CAUSAL GRAPH; CLASSICAL PLANNING; DOMAIN ANALYSIS; LOCAL MINIMUMS; LOW-ORDER POLYNOMIALS; OPTIMAL PLANNING; RUNTIMES; SATISFICING;

BENCHMARKING; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

TOPOLOGY;

EID: 80053395461     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3276     Document Type: Article

References (48)

1. Bäckström, C., & Klein, I. (1991). Planning in polynomial time: The SAS-PUBS class. Computational Intelligence, 7 (4).
2. + planning. Computational Intelligence, 11 (4), 625-655.
3. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90 (1-2), 279-298.
4. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129 (1-2), 5-33. (Pubitemid 32498414)
5. Botea, A., Müller, M., & Schaeffer, J. (2004). Using component abstraction for automatic generation of macro-actions. In Koenig et al. (Koenig, Zilberstein, & Koehler, 2004), pp. 181-190.
6. Brafman, R., & Domshlak, C. (2003). Structure and complexity in planning with unary operators. Journal of Artificial Intelligence Research, 18, 315-349. (Pubitemid 41525939)
7. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69 (1-2), 165-204.
8. Cesta, A., & Borrajo, D. (Eds.), ECP'01 (2001). Recent Advances in AI Planning. 6th European Conference on Planning (ECP'01), Lecture Notes in Artificial Intelligence, Toledo, Spain. Springer-Verlag.
9. Chen, H., & Giménez, O. (2010). Causal graphs and structurally restricted planning. Journal of Computer and System Sciences, 76 (7), 579-592.
10. Domshlak, C., & Dinitz, Y. (2001). Multi-agent offline coordination: Structure and complexity. In Cesta & Borrajo (Cesta & Borrajo, 2001), pp. 34-43.
11. Edelkamp, S., & Helmert, M. (1999). Exhibiting knowledge in planning problems to minimize state encoding length. In Biundo, S., & Fox, M. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), Lecture Notes in Artificial Intelligence, pp. 135-147, Durham, UK. Springer-Verlag.
12. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9, 367-421. (Pubitemid 128636208)
13. Fox, M., & Long, D. (1999). The detection and exploitation of symmetry in planning problems. In Pollack, M. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99), pp. 956-961, Stockholm, Sweden. Morgan Kaufmann.
14. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability|A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
15. Gerevini, A., Howe, A., Cesta, A., & Refanidis, I. (Eds.), ICAPS'09 (2009). Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS9), Thessaloniki, Greece. AAAI.
16. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research, 20, 239-290. (Pubitemid 41530527)
17. Gerevini, A., & Schubert, L. (1998). Inferring state-constraints for domain independent planning. In Mostow, J., & Rich, C. (Eds.), Proceedings of the 15th National Conference of the American Association for Artificial Intelligence (AAAI'98), pp. 905-912, Madison, WI, USA. MIT Press.
18. Giménez, O., & Jonsson, A. (2008). The complexity of planning problems with simple causal graphs. Journal of Artificial Intelligence Research, 31, 319-351. (Pubitemid 351761990)
19. Giménez, O., & Jonsson, A. (2009a). The inuence of k-dependence on the complexity of planning. In Gerevini et al. (Gerevini, Howe, Cesta, & Refanidis, 2009), pp. 138-145.
20. Giménez, O., & Jonsson, A. (2009b). Planning over chain causal graphs for variables with domains of size 5 is NP-hard. Journal of Artificial Intelligence Research, 34, 675-706.
21. Haslum, P. (2007). Reducing accidental complexity in planning problems. In Veloso, M. (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 1898-1903, Hyderabad, India. Morgan Kaufmann.
22. Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143, 219-262.
23. Helmert, M. (2004). A planning heuristic based on causal graph analysis.. In Koenig et al. (Koenig et al., 2004), pp. 161-170.
24. Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26, 191-246. (Pubitemid 44452211)
25. Helmert, M. (2009). Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence, 173 (5-6), 503-535.
26. Helmert, M., & Domshlak, C. (2009). Landmarks, critical paths and abstractions: What's the difference anyway? In Gerevini et al. (Gerevini et al., 2009), pp. 162-169.
27. Hoffmann, J. (2003). Utilizing Problem Structure in Planning: A Local Search Approach, Vol. 2854 of Lecture Notes in Artificial Intelligence. Springer-Verlag.
28. Hoffmann, J. (2005). Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24, 685-758. (Pubitemid 43130948)
29. Hoffmann, J., & Nebel, B. (2001a). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
30. Hoffmann, J., & Nebel, B. (2001b). RIFO revisited: Detecting relaxed irrelevance. In Cesta & Borrajo (Cesta & Borrajo, 2001), pp. 325-336.
31. Hoffmann, J., Porteous, J., & Sebastia, L. (2004). Ordered landmarks in planning. Journal of Artificial Intelligence Research, 22, 215-278. (Pubitemid 41525887)
32. Jonsson, A. (2009). The role of macros in tractable planning. Journal of Artificial Intelligence Research, 36, 471-511.
33. Jonsson, P., & Bäckström, C. (1995). Incremental planning. In European Workshop on Planning.
34. Jonsson, P., & Ba¨ckstro¨m, C. (1998). State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100 (1-2), 125-176. (Pubitemid 128403239)
35. Karpas, E., & Domshlak, C. (2009). Cost-optimal planning with landmarks. In Boutilier, C. (Ed.), Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pp. 1728-1733, Pasadena, CA, USA. Morgan Kaufmann.
36. Katz, M., & Domshlak, C. (2008a). New islands of tractability of cost-optimal planning. Journal of Artificial Intelligence Research, 32, 203-288.
37. Katz, M., & Domshlak, C. (2008b). Structural patterns heuristics via fork decomposition. In Rintanen, J., Nebel, B., Beck, J. C., & Hansen, E. A. (Eds.), Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS'08), pp. 182-189, Sydney, Australia. AAAI.
38. Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68 (2), 243-302.
39. Koenig, S., Zilberstein, S., & Koehler, J. (Eds.), ICAPS'04 (2004). Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS'04), Whistler, Canada. AAAI.
40. Long, D., & Fox, M. (2000). Automatic synthesis and use of generic types in planning. In Chien, S., Kambhampati, R., & Knoblock, C. (Eds.), Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS'00), pp. 196-205, Breckenridge, CO. AAAI Press, Menlo Park.
41. McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109 (1-2), 111-159.
42. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 338-350, Toulouse, France. Springer-Verlag.
43. Richter, S., Helmert, M., &Westphal, M. (2008). Landmarks revisited. In Fox, D., & Gomes, C. (Eds.), Proceedings of the 23rd National Conference of the American Association for Artificial Intelligence (AAAI'08), pp. 975-982, Chicago, Illinois, USA. MIT Press.
44. Richter, S., & Westphal, M. (2010). The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39, 127-177.
45. Rintanen, J. (2000). An iterative algorithm for synthesizing invariants. In Kautz, H. A., & Porter, B. (Eds.), Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI'00), pp. 806-811, Austin, TX, USA. MIT Press.
46. Roberts, M., & Howe, A. (2009). Learning from planner performance. Artificial Intelligence, 173, 636-561.
47. Vidal, V. (2004). A lookahead strategy for heuristic search planning. In Koenig et al. (Koenig et al., 2004), pp. 150-160.
48. Williams, B. C., & Nayak, P. P. (1997). A reactive planner for a model-based executive. In Pollack, M. (Ed.), Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 1178-1185, Nagoya, Japan. Morgan Kaufmann.