A probabilistic analysis of propositional STRIPS planning

DOI10.1016/0004-3702(95)00055-0OpenAlexW28466788MaRDI QIDQ2674188

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

planningaverage-case analysisPSPACE-completenessSTRIPS

Mathematics Subject Classification ID

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

Related Items (5)

Phase transitions of PP-complete satisfiability problems ⋮ Planning as satisfiability: heuristics ⋮ Kernel functions for case-based planning ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ A complete parameterized complexity analysis of bounded planning

Uses Software

• UCPOP

Cites Work

• Planning for conjunctive goals
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• The computational complexity of propositional STRIPS planning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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