A probabilistic analysis of propositional STRIPS planning

DOI10.1016/0004-3702(95)00055-0MaRDI QIDQ2674188zbMATH OpenOpenAlexFDO

Authors Tom Bylander

Publication date 22 September 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(95)00055-0

zbMATH Keywords

average-case analysisplanningPSPACE-completenessSTRIPS

Mathematics Subject Classification ID

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

Recommendations

• The computational complexity of propositional STRIPS planning
• Time and Space Bounds for Planning
• Fast planning through planning graph analysis
• Phase transitions of contingent planning problem
• scientific article; zbMATH DE number 1216123

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (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?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Planning for conjunctive goals
• STRIPS: A new approach to the application of theorem proving to problem solving
• The computational complexity of propositional STRIPS planning

Cited in

(19)

• On the complexity of blocks-world planning
• The computational complexity of propositional STRIPS planning
• Complexity, decidability and undecidability results for domain-independent planning
• Strong bounds on the approximability of two Pspace-hard problems in propositional planning
• Towards efficient universal planning: A randomized approach
• A complete parameterized complexity analysis of bounded planning
• Planning with regression analysis in transaction logic
• Planning as satisfiability: parallel plans and algorithms for plan search
• Phase transitions of PP-complete satisfiability problems
• Greedy coverage of incomplete planning domain interpretations by t-strength diagnoses
• Goal probability analysis in MDP probabilistic planning: exploring and enhancing the state of the art
• Planning as satisfiability: heuristics
• scientific article; zbMATH DE number 67474 (Why is no real title available?)
• scientific article; zbMATH DE number 3570374 (Why is no real title available?)
• Upper and lower time and space bounds for planning
• Fact-alternating mutex groups for classical planning
• Phase transitions of contingent planning problem
• Planning with Perspectives -- Decomposing Epistemic Planning using Functional STRIPS
• Kernel functions for case-based planning

Describes a project that uses

Uses Software

• UCPOP

This page was built for publication: A probabilistic analysis of propositional STRIPS planning

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