Conformant plans and beyond: principles and complexity

DOI10.1016/j.artint.2009.11.001zbMath1207.68344MaRDI QIDQ969534

Blai Bonet

Publication date: 7 May 2010

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2009.11.001

zbMATH Keywords

modal logic; planning; non-deterministic planning; complexity of planning; partially-observable planning

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T27: Logic in artificial intelligence

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

Related Items

Unnamed Item, Progression and verification of situation calculus agents with bounded beliefs, CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement, A dynamic epistemic framework for reasoning about conformant probabilistic plans

Cites Work

• Planning and acting in partially observable stochastic domains
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• Mastermind
• Weak, strong, and strong cyclic planning via symbolic model checking
• Conformant planning via symbolic model checking and heuristic search
• The polynomial-time hierarchy
• The computational complexity of propositional STRIPS planning
• Conformant planning via heuristic forward search: A new approach
• Strong planning under partial observability
• Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width
• Alternation
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• Planning as heuristic search
• LAO*: A heuristic search algorithm that finds solutions with loops
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item