Search-aware conditions for probably approximately correct heuristic search

Roni Stern, Ariel Felner, Robert Holte

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The notion of finding a solution that is approximately optimal with high probability was recently introduced to the field of heuristic search, formalized as Probably Approximately Correct Heuristic Search, or PAC search in short. A big challenge when constructing a PAC search algorithm is to identify when a given solution achieves the desired sub-optimality with the required confidence, allowing the search to halt and return the incumbent solution. In this paper we propose two novel methods for identifying when a PAC search can halt. Unlike previous work, the new methods provided in this paper become more knowledgeable as the search progresses. This can speedup the search, since the search can halt earlier with the proposed methods and still keeping the desired PAC solution quality guarantees. Experimental results indeed show a substantial speedup of the search in comparison to the previous approach for PAC search.

Original languageEnglish
Title of host publicationProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Pages112-119
Number of pages8
StatePublished - 1 Dec 2012
Event5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada
Duration: 19 Jul 201221 Jul 2012

Publication series

NameProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Conference

Conference5th International Symposium on Combinatorial Search, SoCS 2012
Country/TerritoryCanada
CityNiagara Falls, ON
Period19/07/1221/07/12

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this