CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
From MaRDI portal
Publication:785225
DOI10.1016/j.artint.2020.103271zbMath1451.68248OpenAlexW3013702123WikidataQ124810917 ScholiaQ124810917MaRDI QIDQ785225
Publication date: 6 August 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103271
Related Items (3)
CPCES ⋮ On transformation of conditional, conformant and parallel planning to linear programming ⋮ A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of action theories and its application to conformant planning
- Conformant planning via symbolic model checking and heuristic search
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Conformant plans and beyond: principles and complexity
- Macro-operators: A weak method for learning
- The computational complexity of propositional STRIPS planning
- Fast planning through planning graph analysis
- Conformant planning as a case study of incremental QBF solving
- Planning as satisfiability: parallel plans and algorithms for plan search
- Conformant planning via heuristic forward search: A new approach
- Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width
- Graph-Based Algorithms for Boolean Function Manipulation
- Replanning in Domains with Partial Information and Sensing Actions
- Planning as heuristic search
This page was built for publication: CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
