Causal graphs and structurally restricted planning

Journal of Computer and System Sciences

Volumn 76, Issue 7, 2010, Pages 579-592

  Chen, Hubie ^a   Giménez, Omer ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Causal graph; Classification; Complexity; Planning

Indexed keywords

CLASSIFICATION (OF INFORMATION); GRAPHIC METHODS; PLANNING; POLYNOMIAL APPROXIMATION;

CAUSAL GRAPH; COMPLETE CLASSIFICATION; COMPLEXITY; GRAPH SET; PLANNING PROBLEM; POLYNOMIAL-TIME; VARIABLE DEPENDENCIES;

DIRECTED GRAPHS;

EID: 77955432155     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.10.013     Document Type: Article

References (17)

1. T. Bylander The computational complexity of propositional STRIPS planning Artificial Intelligence 69 1994 165 204
2. C. Knoblock Automatically generating abstractions for planning Artificial Intelligence 68 2 1994 243 302
3. M. Helmert The Fast Downward planning system J. Artificial Intelligence Res. 26 2006 191 246
4. R. Brafman, C. Domshlak, Factored planning: How, when, and when not, in: Proceedings of the 21st National Conference on Artificial Intelligence, 2006, pp. 809-814
5. P. Jonsson, and C. Bäckström Tractable plan existence does not imply tractable plan generation Ann. Math. Artif. Intell. 22 3-4 1998 281 296
6. R. Brafman, and C. Domshlak Structure and complexity in planning with unary operators J. Artificial Intelligence Res. 18 2003 315 349
7. A. Jonsson, The role of macros in tractable planning over causal graphs, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence, 2007, pp. 1936-1941
8. C. Domshlak, Y. Dinitz, Multi-agent off-line coordination: Structure and complexity, in: Proceedings of the 6th European Conference on Planning, 2001, pp. 277-288
9. M. Helmert, A planning heuristic based on causal graph analysis, in: Proceedings of the 14th International Conference on Automated Planning and Scheduling, 2004, pp. 161-170
10. O. Giménez, and A. Jonsson The complexity of planning problems with simple causal graphs J. Artificial Intelligence Res. 31 2008 319 351
11. M. Katz, C. Domshlak, Structural patterns of tractable sequentially-optimal planning, in: Proceedings of the 17th International Conference on Automated Planning and Scheduling, 2007
12. M. Grohe The complexity of homomorphism and constraint satisfaction problems seen from the other side J. ACM 54 1 2007 1 24
13. G. Gottlob, N. Leone, and F. Scarcello A comparison of structural CSP decomposition methods Artificial Intelligence 124 2 2000 243 282
14. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer-Verlag
15. R. Downey, and M. Fellows Fixed-parameter tractability and completeness II: On completeness for W [ 1 ] Theoret. Comput. Sci. 141 1995 109 131
16. M. Bodirsky, M. Grohe, Non-dichotomies in constraint satisfaction complexity, in: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, 2008, pp. 184-196
17. R. Tarjan Depth-first search and linear graph algorithms SIAM J. Comput. 1 2 1972 146 160