AI planning in a constraint programming framework
From MaRDI portal
Recommendations
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Constraint based planning with composable substate graphs
- Artificial intelligence planning methods based on automated reasoning techniques
- Solving sequential planning problems via constraint satisfaction
- scientific article; zbMATH DE number 49438
Cited in
(13)- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- scientific article; zbMATH DE number 4174366 (Why is no real title available?)
- scientific article; zbMATH DE number 1882069 (Why is no real title available?)
- scientific article; zbMATH DE number 2089860 (Why is no real title available?)
- Solving Simple Planning Problems with More Inference and No Search
- scientific article; zbMATH DE number 2096828 (Why is no real title available?)
- Constraint based planning with composable substate graphs
- Artificial intelligence planning methods based on automated reasoning techniques
- A constraint programming formulation for planning: From plan scheduling to plan generation
- scientific article; zbMATH DE number 2086991 (Why is no real title available?)
- scientific article; zbMATH DE number 1703889 (Why is no real title available?)
- A new representation and associated algorithms for generalized planning
- scientific article; zbMATH DE number 1857494 (Why is no real title available?)
This page was built for publication: AI planning in a constraint programming framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729991)
