ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Branching and pruning: an optimal temporal POCL planner based on constraint programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The fast downward planning system
Journal of Artificial Intelligence Research
Generalizing GraphPlan by formulating planning as a CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint Based Planning with Composable Substate Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
Planning problems deal with finding a sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. The paper describes how to enhance existing constraint models of planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, nogoods, and lifting.