Weak, strong, and strong cyclic planning via symbolic model checking
From MaRDI portal
Publication:814470
DOI10.1016/S0004-3702(02)00374-0zbMath1082.68800WikidataQ62041399 ScholiaQ62041399MaRDI QIDQ814470
Marco Roveri, Alessandro Cimatti, Marco Pistore, Paolo Traverso
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Binary decision diagramsConditional planningPlanning in nondeterministic domainsSymbolic model-checking
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Star-Topology Decoupling in SPIN, Decidability and complexity of action-based temporal planning over dense time, Analyzing generalized planning under nondeterminism, Domain-independent planning for services in uncertain and dynamic environments, Task decomposition on abstract states, for planning under nondeterminism, Strong planning under uncertainty in domains with numerous but identical elements (a generic approach), Sequential plan recognition: an iterative approach to disambiguating between hypotheses, State-set branching: leveraging BDDs for heuristic search, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Applicability conditions for plans with loops: computability results and algorithms, Flexible FOND Planning with Explicit Fairness Assumptions, Scrutable robot actions using a hierarchical ontological model, A history based approximate epistemic action theory for efficient postdictive reasoning, Epistemic planning: perspectives on the special issue, Two ways to scare a Gruffalo, Reasoning about actions with loops via Hoare logic, Plan aggregation for strong cyclic planning in nondeterministic domains, Qualitative Numeric Planning: Reductions and Complexity, Strong planning under partial observability, Understanding planning with incomplete information and sensing, Planning-based knowing how: a unified approach, Algorithms and conditional lower bounds for planning problems, Deliberative acting, planning and learning with hierarchical operational models, Fast strong planning for fully observable nondeterministic planning problems, Linear logic as a tool for planning under temporal uncertainty, Conformant plans and beyond: principles and complexity, A new representation and associated algorithms for generalized planning, An epistemic approach to nondeterminism: believing in the simplest course of events, Unnamed Item, Knowledge-based programs as succinct policies for partially observable domains, A correctness result for synthesizing plans with loops in stochastic domains, Bounded-Resource Reasoning as (Strong or Classical) Planning, On timeline-based games and their complexity, The symbolic OBDD scheme for generating mechanical assembly sequences, A verification-driven framework for iterative design of controllers, Safe Multi-Agent Pathfinding with Time Uncertainty, Automated planning as an early verification tool for distributed control, Conformant planning via symbolic model checking and heuristic search
Uses Software
Cites Work
- Conformant planning via symbolic model checking and heuristic search
- Symbolic model checking: \(10^{20}\) states and beyond
- Representing action: indeterminacy and ramifications
- Planning control rules for reactive agents
- Using temporal logics to express search control knowledge for planning
- Graph-Based Algorithms for Boolean Function Manipulation
- On the synthesis of discrete controllers for timed systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
