The complexity of planning problems with simple causal graphs
From MaRDI portal
Recommendations
- Planning over chain causal graphs for variables with domains of size 5 is NP-hard
- Causal graphs and structurally restricted planning
- Limitations of acyclic causal graphs for planning
- scientific article; zbMATH DE number 1946870
- A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Cited in
(29)- Tractable plan existence does not imply tractable plan generation
- Star-topology decoupled state space search
- Evaluation of the moral permissibility of action plans
- Algorithms and conditional lower bounds for planning problems
- Backdoors to planning
- A complete parameterized complexity analysis of bounded planning
- On the complexity of planning for agent teams and its implications for single agent planning
- A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph
- New islands of tractability of cost-optimal planning
- Planning over chain causal graphs for variables with domains of size 5 is NP-hard
- scientific article; zbMATH DE number 67469 (Why is no real title available?)
- scientific article; zbMATH DE number 67473 (Why is no real title available?)
- scientific article; zbMATH DE number 67474 (Why is no real title available?)
- The influence of k-dependence on the complexity of planning
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1946870 (Why is no real title available?)
- scientific article; zbMATH DE number 2079763 (Why is no real title available?)
- scientific article; zbMATH DE number 1467489 (Why is no real title available?)
- scientific article; zbMATH DE number 1929233 (Why is no real title available?)
- scientific article; zbMATH DE number 1931653 (Why is no real title available?)
- Limitations of acyclic causal graphs for planning
- Qualitative numeric planning: reductions and complexity
- The role of macros in tractable planning
- Parameterising the complexity of planning by the number of paths in the domain-transition graphs
- scientific article; zbMATH DE number 2196172 (Why is no real title available?)
- On the complexity of case-based planning
- On the complexity of the storyplan problem
- Causal graphs and structurally restricted planning
This page was built for publication: The complexity of planning problems with simple causal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624119)
