Most of the heuristic search based planning systems perform guided search evaluating states to compute a heuristic mea-sure. Although recent planners are quite efficient, the time spent in computing the heuristic measure is still an issue that the community has to address. In this work we present an ex-tension to the heuristic of the relaxed plan introduced by the FF Planner. We propose to integrate in the heuristic measure the actions preconditions difficulty, which is computed dur-ing the relaxed plan extraction phase. Results show that the number of evaluated states and the time to compute plans are decreased using this integrated heuristic
RIFO, as has been proposed by Nebel et al. (Nebel, Di-mopoulos, and Koehler 1997), is a method that ...
Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning...
Abstract—Conformant planning is usually transformed into a search problem in the space of belief sta...
Most of the heuristic search based planning systems perform guided search evaluating states to compu...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The currently dominant approach to domain-independent planning is planning as heuristic search, with...
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and ex...
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estima...
The automatic derivation of heuristic functions for guiding the search for plans in large spaces is ...
The currently dominant approach to domain-independent planning is planning as heuristic search, with...
AbstractThe automatic derivation of heuristic functions for guiding the search for plans is a fundam...
The automatic derivation of heuristic functions for guiding the search for plans is a fundamental te...
Abstract. One of the most successful approaches in automated plan-ning is to use heuristic state-spa...
RIFO, as has been proposed by Nebel et al. (Nebel, Di-mopoulos, and Koehler 1997), is a method that ...
Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning...
Abstract—Conformant planning is usually transformed into a search problem in the space of belief sta...
Most of the heuristic search based planning systems perform guided search evaluating states to compu...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisfic...
The currently dominant approach to domain-independent planning is planning as heuristic search, with...
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and ex...
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estima...
The automatic derivation of heuristic functions for guiding the search for plans in large spaces is ...
The currently dominant approach to domain-independent planning is planning as heuristic search, with...
AbstractThe automatic derivation of heuristic functions for guiding the search for plans is a fundam...
The automatic derivation of heuristic functions for guiding the search for plans is a fundamental te...
Abstract. One of the most successful approaches in automated plan-ning is to use heuristic state-spa...
RIFO, as has been proposed by Nebel et al. (Nebel, Di-mopoulos, and Koehler 1997), is a method that ...
Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning...
Abstract—Conformant planning is usually transformed into a search problem in the space of belief sta...