In search of the tractability boundary of planning problems

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 99-106

  Giménez, Omer ^a   Jonsson, Anders ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CAUSAL GRAPHS; COMPLEXITY RESULTS; DOMAIN SIZES; NP-HARD; PLANNING PROBLEMS; POLYNOMIAL FACTORS;

SCHEDULING;

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

References (10)

1. Brafman, R., and Domshlak, C. 2003. Structure and Complexity in Planning with Unary Operators. Journal of Artificial Intelligence Research 18:315-349.
2. Domshlak, C., and Dinitz, Y. 2001. Multi-Agent Off-line Coordination: Structure and Complexity. In Proceedings of the 6th European Conference on Planning, 277-288.
3. Giménez, O., and Jonsson, A. 2008. The Complexity of Planning Problems with Simple Causal Graphs. Journal of Artificial Intelligence Research 31:319-351.
4. Helmert, M; Mattmüller, R.; and Röger, G. 2006. Approximation Properties of Planning Benchmarks. In Proceedings of the 17th European Conference on Artificial Intelligence, 585-589.
5. Helmert, M. 2006. The Fast Downward Planning System. Journal of Artificial Intelligence Research 26:191-246.
6. Jonsson, P., and Bäckström, C. 1998. Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence 22(3-4):281-296.
7. Jonsson, A. 2007. The Role of Macros in Tractable Planning Over Causal Graphs. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, 1936-1941.
8. Katz, M., and Domshlak, C. 2007a. Structural patterns of tractable sequentially-optimal planning. In Proceedings of the 17th International Conference on Automated Planning and Scheduling.
9. Katz, M., and Domshlak, C. 2007b. Structural Patterns Heuristics: Basic Idea and Concrete Instance. In Proceedings of the Workshop on Heuristics for Domain-independent Planning at ICAPS-07.
10. Raz, R., and Safra, S. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th ACM Symposium on Theory of Computing, 475-484.