Compiling uncertainty away in non-deterministic conformant planning

DOI10.3233/978-1-60750-606-5-465MaRDI QIDQ2999178zbMATH OpenFDO

Authors Alexandre Albore, Hector Palacios, Hector Geffner

Publication date 11 May 2011

Mathematics Subject Classification ID

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

Recommendations

• Compiling uncertainty away in conformant planning problems with bounded width
• scientific article; zbMATH DE number 1560498
• More for free: a dynamic epistemic framework for conformant planning over transition systems
• Conformant planning via heuristic forward search: A new approach
• Conformant planning via symbolic model checking and heuristic search

Cited in

(10)

• Using machine learning for decreasing state uncertainty in planning
• A dynamic epistemic framework for reasoning about conformant probabilistic plans
• Permissive planning: Extending classical planning to uncertain task domains.
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
• Knowledge-based programs as succinct policies for partially observable domains
• Compiling uncertainty away in conformant planning problems with bounded width
• A knowledge compilation perspective on queries and transformations for belief tracking
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
• From Uncertainty Data to Robust Policies for Temporal Logic Planning
• A translation based approach to probabilistic conformant planning

This page was built for publication: Compiling uncertainty away in non-deterministic conformant planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999178)