An algorithm for solving the job-shop problem
Management Science
Artificial Intelligence - Special issue on knowledge representation
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
Artificial Intelligence - Special volume on planning and scheduling
On the utility of plan-space (causal) encodings
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
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
CLAIRE: combining sets, search and rules to better express algorithms
Proceedings of the 1999 international conference on Logic programming
Constraint-Based Scheduling
Temporal Planning with Mutual Exclusion Reasoning
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
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Is "early commitment" in plan generation ever a good idea?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Learning from planner performance
Artificial Intelligence
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Revisiting Constraint Models for Planning Problems
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
The deep space network scheduling problem
IAAI'05 Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
The Knowledge Engineering Review
On the benefit of sub-optimality within the divide-and-evolve scheme
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Divide-and-Evolve: a new memetic scheme for domain-independent temporal planning
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Multi-objective AI planning: comparing aggregation and pareto approaches
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Pareto-based multiobjective AI planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.