AbstractA 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 muc...
In this paper we address the problem of post-processing posi-tion constrained plans, output by many ...
Graphplan (Blum and Furst 1995) has proved a popular and successful basis for a succession of extens...
PDDL 2.1 supports modelling of complex temporal planning domains in which solutions must exploit con...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experi...
Branching and lower bounds are two key notions in heuristic search and combinatorial optimization. B...
Many planning domains have to deal with temporal features that can be expressed using durations that...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and...
Due to its important practical applications, temporal planning is of great research interest in arti...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and ...
Many planning domains have to deal with temporal features that can be expressed using durations tha...
The treatment of exogenous events in planning is practically important in many realworld domains whe...
We study PO and POCL plans with regard to their makespan – the execution time when allowing the para...
PDDL 2.1 supports modelling of complex temporal planning domains in which solutions must exploit con...
In this paper we address the problem of post-processing posi-tion constrained plans, output by many ...
Graphplan (Blum and Furst 1995) has proved a popular and successful basis for a succession of extens...
PDDL 2.1 supports modelling of complex temporal planning domains in which solutions must exploit con...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experi...
Branching and lower bounds are two key notions in heuristic search and combinatorial optimization. B...
Many planning domains have to deal with temporal features that can be expressed using durations that...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and...
Due to its important practical applications, temporal planning is of great research interest in arti...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and ...
Many planning domains have to deal with temporal features that can be expressed using durations tha...
The treatment of exogenous events in planning is practically important in many realworld domains whe...
We study PO and POCL plans with regard to their makespan – the execution time when allowing the para...
PDDL 2.1 supports modelling of complex temporal planning domains in which solutions must exploit con...
In this paper we address the problem of post-processing posi-tion constrained plans, output by many ...
Graphplan (Blum and Furst 1995) has proved a popular and successful basis for a succession of extens...
PDDL 2.1 supports modelling of complex temporal planning domains in which solutions must exploit con...