Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
From MaRDI portal
Recommendations
- Solving sequential planning problems via constraint satisfaction
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Planning as satisfiability: parallel plans and algorithms for plan search
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- scientific article; zbMATH DE number 1759718
- A constraint programming formulation for planning: From plan scheduling to plan generation
- scientific article; zbMATH DE number 1448981
- Constraint based planning with composable substate graphs
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
Cites work
- Fast planning through planning graph analysis
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 1305704 (Why is no real title available?)
- scientific article; zbMATH DE number 1759718 (Why is no real title available?)
- scientific article; zbMATH DE number 1448981 (Why is no real title available?)
- scientific article; zbMATH DE number 2243389 (Why is no real title available?)
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning as heuristic search
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- Temporal constraint networks
Cited in
(30)- Compiling constraint satisfaction problems
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- Extracting mutual exclusion invariants from lifted temporal planning domains
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- A cost-effective planning graph approach for large-scale Web Service Composition
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Set-structured and cost-sharing heuristics for classical planning
- On the complexity of planning for agent teams and its implications for single agent planning
- Planning as satisfiability: parallel plans and algorithms for plan search
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Modelling and solving English peg solitaire
- Domain-independent planning for services in uncertain and dynamic environments
- SAS+ planning as satisfiability
- Constraint based planning with composable substate graphs
- Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms
- Planning as satisfiability with IPC simple preferences and action costs
- Modification strategies for SAT-based plan adaptation
- Solving sequential planning problems via constraint satisfaction
- Planning in domains with derived predicates through rule-action graphs and local search
- On the completeness of pruning techniques for planning with conditional effects
- Finding similar/diverse solutions in answer set programming
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
- Logics in Artificial Intelligence
- Streamlining variational inference for constraint satisfaction problems
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning in artificial intelligence
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- Concise finite-domain representations for PDDL planning tasks
This page was built for publication: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958636)
