Abstract. We present a technique which allows partial-order causallink (POCL) planning systems to use heuristics known from state-based planning to guide their search. The technique encodes a given partially ordered partial plan as a new classical planning problem that yields the same set of solutions reachable from the given partial plan. As heuristic estimate of the given partial plan a state-based heuristic can be used estimating the goal distance of the initial state in the encoded problem. This technique also provides the first admissible heuristics for POCL planning, simply by using admissible heuristics from state-based planning. To show the potential of our technique, we conducted experiments where we compared two of the currently s...
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune la...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...
Abstract—We prove a new complexity result for Partial-Order Causal-Link (POCL) planning which shows ...
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experi...
Many current heuristics for domain-independent planning, such as Bonet and Geffner’s additive heuris...
In recent years, heuristic search methods for classical planning have achieved remarkable results. T...
In recent years, heuristic search methods for classical plan-ning have achieved remarkable results. ...
When planning problems have many kinds of resources or high concurrency, each optimal state has exp...
In recent years, heuristic search methods for classical planning have achieved remarkable results. T...
Over the last few years there has been a revival of interest in the idea of least-commitment plannin...
AbstractPlanning graphs have been shown to be a rich source of heuristic information for many kinds ...
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds...
AbstractA key feature of modern optimal planners such as graphplan and blackbox is their ability to ...
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...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...
Abstract—We prove a new complexity result for Partial-Order Causal-Link (POCL) planning which shows ...
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experi...
Many current heuristics for domain-independent planning, such as Bonet and Geffner’s additive heuris...
In recent years, heuristic search methods for classical planning have achieved remarkable results. T...
In recent years, heuristic search methods for classical plan-ning have achieved remarkable results. ...
When planning problems have many kinds of resources or high concurrency, each optimal state has exp...
In recent years, heuristic search methods for classical planning have achieved remarkable results. T...
Over the last few years there has been a revival of interest in the idea of least-commitment plannin...
AbstractPlanning graphs have been shown to be a rich source of heuristic information for many kinds ...
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds...
AbstractA key feature of modern optimal planners such as graphplan and blackbox is their ability to ...
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...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions r...