206 search results - page 1 / 42 » Learning Heuristic Functions from Relaxed Plans |
AIPS
2006
13 years 6 months ago
2006
AIPS
2008
13 years 7 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
AIPS
2008
13 years 7 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
AIPS
2010
13 years 7 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
IJCAI
2001
13 years 6 months ago
2001
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...