Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

DOI10.1016/S0004-3702(01)00128-XzbMath0983.68181MaRDI QIDQ5958636

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

planningconstraint satisfactiongraphplanCSP compilationEBLencodings

Mathematics Subject Classification ID

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

Related Items (17)

Domain-independent planning for services in uncertain and dynamic environments ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ Finding similar/diverse solutions in answer set programming ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ A cost-effective planning graph approach for large-scale Web Service Composition ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Modelling and solving English peg solitaire ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ 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 ⋮ Streamlining variational inference for constraint satisfaction problems ⋮ Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan

Uses Software

• RealPlan
• STAN
• Walksat
• CPlan
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal constraint networks
• On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
• Fast planning through planning graph analysis
• Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
• Planning as heuristic search
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

This page was built for publication: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP