TY - GEN

T1 - Probably approximately correct heuristic search

AU - Stern, Roni

AU - Felner, Ariel

AU - Holte, Robert

PY - 2011

Y1 - 2011

N2 - A* is a best-first search algorithm that returns an optimal solution. w-admissible algorithms guarantee that the returned solution is no larger than w times the optimal solution. In this paper we introduce a generalization of the w-admissibility concept that we call PAC search, which is inspired by the PAC learning framework in Machine Learning. The task of a PAC search algorithm is to find a solution that is w-admissible with high probability. In this paper we formally define PAC search, and present a framework for PAC search algorithms that can work on top of any search algorithm that produces a sequence of solutions. Experimental results on the 15-puzzle demonstrate that our framework activated on top of Anytime Weighted A* (AWA*) expands significantly less nodes than regular AWA* while returning solutions that have almost the same quality.

AB - A* is a best-first search algorithm that returns an optimal solution. w-admissible algorithms guarantee that the returned solution is no larger than w times the optimal solution. In this paper we introduce a generalization of the w-admissibility concept that we call PAC search, which is inspired by the PAC learning framework in Machine Learning. The task of a PAC search algorithm is to find a solution that is w-admissible with high probability. In this paper we formally define PAC search, and present a framework for PAC search algorithms that can work on top of any search algorithm that produces a sequence of solutions. Experimental results on the 15-puzzle demonstrate that our framework activated on top of Anytime Weighted A* (AWA*) expands significantly less nodes than regular AWA* while returning solutions that have almost the same quality.

UR - http://www.scopus.com/inward/record.url?scp=84893383810&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84893383810

SN - 9781577355373

T3 - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

SP - 158

EP - 163

BT - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

T2 - 4th International Symposium on Combinatorial Search, SoCS 2011

Y2 - 15 July 2011 through 16 July 2011

ER -