A constraint programming formulation for planning: From plan scheduling to plan generation
From MaRDI portal
(Redirected from Publication:2268509)
Recommendations
Cites work
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Fast planning through planning graph analysis
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- scientific article; zbMATH DE number 2038905 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- Improving heuristics through relaxed search - an analysis of TP4 and HSP*a in the 2004 planning competition
- Modelling mixed discrete-continuous domains for planning
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning as heuristic search
- STRIPS: A new approach to the application of theorem proving to problem solving
- Temporal constraint networks
- Temporal planning using subgoal partitioning and resolution in SGPlan
- The FF planning system: Fast plan generation through heuristic search
Cited in
(10)- Constraint-based attribute and interval planning
- CTP: A new constraint-based formalism for conditional, temporal planning
- A constraint-based approach to learn temporal features on action models from multiple plans
- Constraint partitioning in penalty formulations for solving temporal planning problems
- AI planning in a constraint programming framework
- scientific article; zbMATH DE number 5547917 (Why is no real title available?)
- scientific article; zbMATH DE number 2084752 (Why is no real title available?)
- scientific article; zbMATH DE number 1759718 (Why is no real title available?)
- Extending classical planning with state constraints: heuristics and search for optimal planning
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
This page was built for publication: A constraint programming formulation for planning: From plan scheduling to plan generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268509)