Limitations of acyclic causal graphs for planning
DOI10.1016/J.ARTINT.2014.02.002zbMATH Open1334.68201OpenAlexW2059882437MaRDI QIDQ490647FDOQ490647
Authors: Anders Jonsson, Peter Jonsson, Tomas Lööw 
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.02.002
Recommendations
- Causal graphs and structurally restricted planning
- The complexity of planning problems with simple causal graphs
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph
- Graph planning with expected finite horizon
- Planning over chain causal graphs for variables with domains of size 5 is NP-hard
- Causal graph justifications of logic programs
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- The computational complexity of propositional STRIPS planning
- Title not available (Why is that?)
- Automatically generating abstractions for planning
- The complexity of planning problems with simple causal graphs
- Planning over chain causal graphs for variables with domains of size 5 is NP-hard
- Title not available (Why is that?)
- The role of macros in tractable planning
- Tractable plan existence does not imply tractable plan generation
- Downward refinement and the efficiency of hierarchical problem solving
- A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Cited In (4)
This page was built for publication: Limitations of acyclic causal graphs for planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490647)
