Constraint based planning with composable substate graphs

DOI10.3233/978-1-60750-606-5-453MaRDI QIDQ2999174zbMATH OpenOpenAlexFDO

Authors Peter L. Gregory, D. Long, M. Fox

Publication date 11 May 2011

Full work available at URL https://doi.org/10.3233/978-1-60750-606-5-453

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Solving sequential planning problems via constraint satisfaction
• Extending classical planning with state constraints: heuristics and search for optimal planning
• A weighted CSP approach to cost-optimal planning
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• AI planning in a constraint programming framework

Cited in

(13)

• Localized planning with action-based constraints
• State-variable planning under structural restrictions: algorithms and complexity
• Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• AI planning in a constraint programming framework
• Factored cost-optimal planning using message passing algorithms
• Encoding domain transitions for constraint-based planning
• scientific article; zbMATH DE number 4162299 (Why is no real title available?)
• Solving sequential planning problems via constraint satisfaction
• Extending classical planning with state constraints: heuristics and search for optimal 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
• Optimal planning with expressive action languages as constraint optimization

This page was built for publication: Constraint based planning with composable substate graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999174)