Conformant plans and beyond: principles and complexity
From MaRDI portal
Publication:969534
DOI10.1016/j.artint.2009.11.001zbMath1207.68344OpenAlexW2012751511MaRDI QIDQ969534
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
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Progression and verification of situation calculus agents with bounded beliefs ⋮ Unnamed Item ⋮ A dynamic epistemic framework for reasoning about conformant probabilistic plans ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
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
This page was built for publication: Conformant plans and beyond: principles and complexity
