Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces

Artificial Intelligence, Volume 230, Issue C, 2016, Pages 51-73.

Cited by: 5|Bibtex|Views65|DOI:https://doi.org/10.1016/j.artint.2015.09.012
EI
Other Links: dl.acm.org|academic.microsoft.com|dblp.uni-trier.de|www.sciencedirect.com

Abstract:

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...More

Code:

Data:

Your rating :
0

 

Tags
Comments