Tractable plan existence does not imply tractable plan generation

DOI10.1023/A:1018995620232MaRDI QIDQ1267773zbMATH OpenOpenAlexFDO

Authors Peter Jonsson, Christer Bäckström

Publication date 13 October 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018995620232

zbMATH Keywords

planplanning

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
• The computational complexity of propositional STRIPS planning
• scientific article; zbMATH DE number 67474

Cited in

(9)

• Towards efficient universal planning: A randomized approach
• A complete parameterized complexity analysis of bounded planning
• Limitations of acyclic causal graphs for planning
• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• 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
• Causal graphs and structurally restricted planning

This page was built for publication: Tractable plan existence does not imply tractable plan generation

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