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
(15)- Localized planning with action-based constraints
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- On the importance of domain model configuration for automated planning engines
- Investigation of different seeding strategies in a genetic planner
- Constraint based planning with composable substate graphs
- Component-oriented programming as an AI-planning problem
- Artificial intelligence planning methods based on automated reasoning techniques
- scientific article; zbMATH DE number 4174366 (Why is no real title available?)
- Solving Simple Planning Problems with More Inference and No Search
- Abstraction and reformulation in GraphPlan
- Beyond the plan-length criterion
- From theory to practice: AI planning for high performance elevator control. (Extended abstract)
- KA-Tool and domain construction for AI planning applications
- A new representation and associated algorithms for generalized planning
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)