Planning with Incomplete Information

DOI10.1007/978-3-642-20674-0_1zbMath1327.68214OpenAlexW1441532605MaRDI QIDQ3003424

Héctor Geffner

Publication date: 27 May 2011

Published in: Model Checking and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20674-0_1

Mathematics Subject Classification ID

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

Related Items (1)

On composition of bounded-recall plans

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using regression-match graphs to control search in planning
• The computational complexity of propositional STRIPS planning
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Strong planning under partial observability
• REF-ARF: A system for solving problems stated as procedures
• Planning as heuristic search

This page was built for publication: Planning with Incomplete Information