Strong planning under partial observability

DOI10.1016/j.artint.2006.01.004zbMath1131.68095WikidataQ62041362 ScholiaQ62041362MaRDI QIDQ2457630

Paolo Traverso, Alessandro Cimatti, Marco Roveri, Piergiorgio Bertoli

Publication date: 23 October 2007

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

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

zbMATH Keywords

binary decision diagrams; symbolic model checking; planning in nondeterministic domains; heuristic search in belief space; planning under partial observability

Mathematics Subject Classification ID

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

Related Items

Plan aggregation for strong cyclic planning in nondeterministic domains, Fast strong planning for fully observable nondeterministic planning problems, Task decomposition on abstract states, for planning under nondeterminism, Conformant plans and beyond: principles and complexity, The symbolic OBDD scheme for generating mechanical assembly sequences, Sequential plan recognition: an iterative approach to disambiguating between hypotheses, Knowledge-based programs as succinct policies for partially observable domains, Analyzing generalized planning under nondeterminism, A correctness result for synthesizing plans with loops in stochastic domains, Reactive Policies with Planning for Action Languages, Planning with Incomplete Information, Unnamed Item

Uses Software

• NuSMV
• CUDD
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• 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
• Planning control rules for reactive agents
• Fast planning through planning graph analysis
• An efficient algorithm for searching implicit AND/OR graphs with cycles
• Using temporal logics to express search control knowledge for planning
• Conformant planning via heuristic forward search: A new approach
• In defense of PDDL axioms
• 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
• AND/OR graph heuristic search methods
• The Complexity of Markov Decision Processes
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• Optimizing decision trees through heuristically guided search
• Interpolants and Symbolic Model Checking
• LAO*: A heuristic search algorithm that finds solutions with loops