Optimal planning and heuristic search systems solve state-space search problems by finding a least-cost path from start to goal. As a byproduct of having an optimal path they also determine the optimal solution cost. In this paper we focus on the problem of determining the optimal solution cost for a state-space search problem directly, i.e., without actually finding a solution path of that cost. We present an algorithm, BiSS, which is a hybrid of bidirectional search and stratified sampling that produces accurate estimates of the optimal solution cost. BiSS is guaranteed to return the optimal solution cost in the limit as the sample size goes to infinity. We show empirically that BiSS produces accurate predictions in several domains. In ad...
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted ...
Heuristic search algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively larg...
The quality of solution provided by a search heuristic on a particular problem is by no means an abs...
Optimal planning and heuristic search systems solve state-space searchproblems by finding a least-co...
Optimal planning and heuristic search systems solve state-space searchproblems by finding a least-co...
Classical heuristic search algorithms find the solution cost of a problem while finding the path fro...
Heuristic search algorithms are designed to return an optimal path from a start state to a goal stat...
AbstractA satisficing search problem consists of a set of probabilistic experiments to be performed ...
In this paper we present greedy methods for selecting a subset of heuristic functions for guiding A*...
AbstractWe investigate the use of machine learning to create effective heuristics for search algorit...
This paper proposes and investigates a novel way of combining machine learning and heuristic search ...
Jabbari Arfaee, Zilles, and Holte presented the bootstrap learning system, a system that learns stro...
Optimal heuristic searches such as A * search are widely used for planning but can rarely scale to l...
Multiobjective heuristic search in state space graphs generally aims at determining the exact set of...
AbstractThis paper analyzes the performance of local search algorithms (guided by the best-to-date s...
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted ...
Heuristic search algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively larg...
The quality of solution provided by a search heuristic on a particular problem is by no means an abs...
Optimal planning and heuristic search systems solve state-space searchproblems by finding a least-co...
Optimal planning and heuristic search systems solve state-space searchproblems by finding a least-co...
Classical heuristic search algorithms find the solution cost of a problem while finding the path fro...
Heuristic search algorithms are designed to return an optimal path from a start state to a goal stat...
AbstractA satisficing search problem consists of a set of probabilistic experiments to be performed ...
In this paper we present greedy methods for selecting a subset of heuristic functions for guiding A*...
AbstractWe investigate the use of machine learning to create effective heuristics for search algorit...
This paper proposes and investigates a novel way of combining machine learning and heuristic search ...
Jabbari Arfaee, Zilles, and Holte presented the bootstrap learning system, a system that learns stro...
Optimal heuristic searches such as A * search are widely used for planning but can rarely scale to l...
Multiobjective heuristic search in state space graphs generally aims at determining the exact set of...
AbstractThis paper analyzes the performance of local search algorithms (guided by the best-to-date s...
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted ...
Heuristic search algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively larg...
The quality of solution provided by a search heuristic on a particular problem is by no means an abs...