scientific article; zbMATH DE number 1560498

MaRDI QIDQ4527271zbMATHFDO

Authors Alessandro Cimatti, Marco Roveri

Publication date 4 June 2001

zbMATH Keywords

binary decision diagramsplanning in nondeterministic domainsconformant model based planner

Mathematics Subject Classification ID

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

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

(28)

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

Describes a project that uses

Uses Software

• NuSMV

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)