Our goal is to automatically generate heuristics to guide state space search. Our heuristics are defined by distances in an abstract space that is automatically derived from the definition of the original space. Such abstractions provide monotone heuristics for search algorithms such as A* and IDA*. To facilitate the automatic generation of heuristics we introduce a notation for describing states and operators, PSVN, that is simple but sufficiently expressive to succinctly describe a wide range of state spaces. We then describe domain abstraction, a way of abstracting PSVN state spaces. With some restrictions, domain abstraction of PSVN descriptions gives the user fine control over the size of the abstract space. The heuristic correspondin...
True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible ...
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Our goal is to automatically generate heuristics to guide state space search. The heuristic values a...
Abstract. A memory-based heuristic is a function, h(s), stored in the form of a lookup table: h(s) i...
State-set search is state space search when the states being manipulated by the search algorithm are...
True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible ...
Most existing abstraction algorithms are sensitive to the initial problem formulation. Given two dif...
The aim of this work is to show the usefulness of abstraction in heuristic search. We use the abstra...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
In problem domains where an informative heuristic evaluation function is not known or not easily com...
This master's thesis deals with informed search algorithms. It's theoretical section summarizes basi...
Real-time search methods allow an agent to perform path-finding tasks in unknown environments. Some ...
AbstractAbstraction is a powerful technique for speeding up planning and search. A problem that can ...
Abstract- This paper presents a solution to the problem of finding an effective yet admissible heuri...
True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible ...
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Our goal is to automatically generate heuristics to guide state space search. The heuristic values a...
Abstract. A memory-based heuristic is a function, h(s), stored in the form of a lookup table: h(s) i...
State-set search is state space search when the states being manipulated by the search algorithm are...
True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible ...
Most existing abstraction algorithms are sensitive to the initial problem formulation. Given two dif...
The aim of this work is to show the usefulness of abstraction in heuristic search. We use the abstra...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
In problem domains where an informative heuristic evaluation function is not known or not easily com...
This master's thesis deals with informed search algorithms. It's theoretical section summarizes basi...
Real-time search methods allow an agent to perform path-finding tasks in unknown environments. Some ...
AbstractAbstraction is a powerful technique for speeding up planning and search. A problem that can ...
Abstract- This paper presents a solution to the problem of finding an effective yet admissible heuri...
True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible ...
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database...
A promising approach to solving large state-space search problems is to integrate heuristic search w...