scientific article; zbMATH DE number 1560498
From MaRDI portal
Publication:4527271
Recommendations
- Conformant planning via symbolic model checking and heuristic search
- Conformant planning via heuristic forward search: A new approach
- Compiling uncertainty away in conformant planning problems with bounded width
- Weak, strong, and strong cyclic planning via symbolic model checking
- Approximation of action theories and its application to conformant planning
Cited in
(30)- The symbolic OBDD scheme for generating mechanical assembly sequences
- Model checking approach to automated planning
- A correctness result for synthesizing plans with loops in stochastic domains
- State-set branching: leveraging BDDs for heuristic search
- Conformant planning via heuristic forward search: A new approach
- Strong planning under partial observability
- Action failure recovery via model-based diagnosis and conformant planning
- Compiling uncertainty away in non-deterministic conformant planning
- Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach
- Compiling uncertainty away in conformant planning problems with bounded width
- scientific article; zbMATH DE number 1560500 (Why is no real title available?)
- Plan aggregation for strong cyclic planning in nondeterministic domains
- Property directed reachability for automated planning
- A dynamic epistemic framework for conformant planning
- Fast strong planning for fully observable nondeterministic planning problems
- Approximation of action theories and its application to conformant planning
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- Minimax real-time heuristic search
- d-\( \mathcal{B} \): a language for well-founded deontic planning
- Answer set planning: a survey
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- Weak, strong, and strong cyclic planning via symbolic model checking
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Conformant planning via symbolic model checking and heuristic search
- Task decomposition on abstract states, for planning under nondeterminism
- Symbolic techniques in satisfiability solving
- Proof systems for planning under 0-approximation semantics
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Conformant plans and beyond: principles and complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527271)
