CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
On the Use of Integer Programming Models in AI Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
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
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Limits and Possibilities of BDDs in State Space Search
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
The Knowledge Engineering Review
A weighted CSP approach to cost-optimal planning
AI Communications
Hi-index | 0.00 |
We present in this paper a hybrid planning system Which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its own consistency rules and filtering and decomposition mechanisms suitable for planning. Given a fixed bound on the plan length, our planner works directly on a structure related to Graphplan's planning graph. This structure is incrementally built: Each time it is extended, a sequential plan is searched. Different search strategies may be employed. Currently, it is a forward chaining search based on problem decomposition with action sets partitioning. Various techniques are used to reduce the search space, such as memorizing nogood states or estimating goals reachability. In addition, the planner implements two different techniques to avoid enumerating some equivalent action sequences. Empirical evaluation shows that our system is very competitive on many problems, especially compared to other optimal sequential planners.