AAAI Publications, Twenty-Second International Conference on Automated Planning and Scheduling

Font Size: 
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling
Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte

Last modified: 2012-05-14


Optimal planning and heuristic search systems solve state-space searchproblems 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 efficient algorithm, BiSS, based on ideas of bidirectional search and stratified sampling that produces accurate estimates of the optimal solution cost. Our method is guaranteed to return the optimal solution cost in the limit as the sample size goes to infinity.We show empirically that our method makes accurate predictions in several domains. In addition, we show that our method scales to state spaces much larger than can be solved optimally. In particular, we estimate the average solution cost for the 6x6, 7x7, and 8x8 Sliding-Tile Puzzle and provide indirect evidence that these estimates are accurate.


Optimal Solution Cost Prediction

Full Text: PDF