Conformant planning via symbolic model checking and heuristic search

DOI10.1016/j.artint.2004.05.003zbMath1086.68591OpenAlexW1992992996WikidataQ62041390 ScholiaQ62041390MaRDI QIDQ814631

Marco Roveri, Piergiorgio Bertoli, Alessandro Cimatti

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2004.05.003

zbMATH Keywords

Conformant planningBinary decision diagramsPlanning in nondeterministic domainsHeuristic search in belief spaceSymbolic model checking

Mathematics Subject Classification ID

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

Related Items

Weighted \(A^*\) search - unifying view and application ⋮ 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 ⋮ Unnamed Item ⋮ Conformant planning via heuristic forward search: A new approach ⋮ Strong planning under partial observability ⋮ Understanding planning with incomplete information and sensing ⋮ Conformant plans and beyond: principles and complexity ⋮ Approximation of action theories and its application to conformant planning ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions ⋮ 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

Uses Software

• NuSMV
• CUDD

Cites Work

• 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
• Symbolic model checking: \(10^{20}\) states and beyond
• Representing action: indeterminacy and ramifications
• Conformant planning via heuristic forward search: A new approach
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Graph-Based Algorithms for Boolean Function Manipulation
• Interpolants and Symbolic Model Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item