scientific article; zbMATH DE number 1946870

MaRDI QIDQ4411159zbMATH OpenFDO

Authors Ronen Brafman, Carmel Domshlak

Publication date 7 July 2003

zbMATH Keywords

STRIPS planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The complexity of planning problems with simple causal graphs
• Causal graphs and structurally restricted planning
• Limitations of acyclic causal graphs for planning
• Planning over chain causal graphs for variables with domains of size 5 is NP-hard
• The computational complexity of propositional STRIPS planning

Cited in

(17)

• Symbolic perimeter abstraction heuristics for cost-optimal planning
• Star-topology decoupled state space search
• Backdoors to planning
• Red-black planning: a new systematic approach to partial delete relaxation
• A complete parameterized complexity analysis of bounded planning
• On the complexity of planning for agent teams and its implications for single agent planning
• The Causal Graph Revisited for Directed Model Checking
• The complexity of planning problems with simple causal graphs
• On-the-Fly Macros
• The influence of k-dependence on the complexity of planning
• Limitations of acyclic causal graphs for planning
• Computational complexity of computing symmetries in finite-domain planning
• AI Planning Languages Semantics
• Verified SAT-Based AI Planning
• Upper Bounding Diameters of State Spaces of Factored Transition Systems
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
• Causal graphs and structurally restricted planning

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411159)