Progress has been made recently in developing tech- niques to automatically generate effective heuristics. These techniques typically aim to reduce the size of the search tree, usually by combining more primitive heuristics. However, simply reducing search tree size is not enough to guarantee that problems will be solved more quickly. We describe a new approach to auto- matic heuristic generation that combines more primi- tive heuristics in a way that can produce better heuris- tics than current methods. We report on experiments us- ing 14 planning domains that show our system leads to a much greater reduction in search time than previous methods. In closing, we discuss avenues for extending this promising approach to combining heuristics
Heuristic search has been widely applied to classical planning and has proven its efficiency in find...
AbstractIn the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be...
We empirically examine several ways of exploiting the information of multiple heuristics in a satisf...
Heuristic search-based planners, such as HSP 2.0, solve STRIPS-style planning problems efficiently ...
Heuristic search is a key component of automated planning and pathfinding. It is guided by a heurist...
Planning is often not a one-shot task because either the world or the agent’s knowledge of the world...
Planning is often not a one-shot task because either the world or the agent’s knowledge of the world...
This thesis explores limitations of heuristic search planning, and presents techniques to overcome t...
Real-time (heuristic) search methods allow for fine-grained control over how much planning to do bet...
In this paper we present greedy methods for selecting a subset of heuristic functions for guiding A*...
The problem of domain-independent automated planning has been a topic of research in Artificial Inte...
The current research trends on hyper-heuristics design have sprung up in two different flavours: heu...
prodigy's planning algorithm uses domain-independent search heuristics. In this paper, we suppo...
Abstract The current research trends on hyper-heuristics design have sprung up in two different flav...
There are many problems that still cannot be solved exactly in a reasonable time despite rapid incre...
Heuristic search has been widely applied to classical planning and has proven its efficiency in find...
AbstractIn the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be...
We empirically examine several ways of exploiting the information of multiple heuristics in a satisf...
Heuristic search-based planners, such as HSP 2.0, solve STRIPS-style planning problems efficiently ...
Heuristic search is a key component of automated planning and pathfinding. It is guided by a heurist...
Planning is often not a one-shot task because either the world or the agent’s knowledge of the world...
Planning is often not a one-shot task because either the world or the agent’s knowledge of the world...
This thesis explores limitations of heuristic search planning, and presents techniques to overcome t...
Real-time (heuristic) search methods allow for fine-grained control over how much planning to do bet...
In this paper we present greedy methods for selecting a subset of heuristic functions for guiding A*...
The problem of domain-independent automated planning has been a topic of research in Artificial Inte...
The current research trends on hyper-heuristics design have sprung up in two different flavours: heu...
prodigy's planning algorithm uses domain-independent search heuristics. In this paper, we suppo...
Abstract The current research trends on hyper-heuristics design have sprung up in two different flav...
There are many problems that still cannot be solved exactly in a reasonable time despite rapid incre...
Heuristic search has been widely applied to classical planning and has proven its efficiency in find...
AbstractIn the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be...
We empirically examine several ways of exploiting the information of multiple heuristics in a satisf...