scientific article; zbMATH DE number 6519681

MaRDI QIDQ3455599zbMATH OpenFDO

Authors Jussi Rintanen

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/7052

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computational complexity of planning and approximate planning in the presence of incompleteness
• Complexity, decidability and undecidability results for domain-independent planning
• Algorithms and conditional lower bounds for planning problems
• scientific article; zbMATH DE number 1216123
• scientific article; zbMATH DE number 1696842
• scientific article; zbMATH DE number 1950254
• Strong planning under partial observability
• On the completeness of pruning techniques for planning with conditional effects
• A complete parameterized complexity analysis of bounded planning
• On the undecidability of probabilistic planning and related stochastic optimization problems

Cited in

(9)

• State-variable planning under structural restrictions: algorithms and complexity
• On-the-fly informed search of non-blocking directed controllers
• A correctness result for synthesizing plans with loops in stochastic domains
• The complexity of optimal monotonic planning: the bad, the good, and the causal graph
• Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms
• Planning as satisfiability: heuristics
• scientific article; zbMATH DE number 1931653 (Why is no real title available?)
• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• Complexity of multi-agent conformant planning with group knowledge

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 Q3455599)