Potential search: A new greedy anytime heuristic search

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

4 Scopus citations

Abstract

In this paper we explore a novel approach for anytime heuristic search, in which the node that is most probable to improve the incumbent solution is expanded first. This is especially suited for the "anytime aspect" of anytime algorithms - the possibility that the algorithm will be be halted anytime throughout the search. The potential of a node to improve the incumbent solution is estimated by a custom cost function, resulting in Potential Search, an anytime best-first search. Experimental results on the 15-puzzle and on the key player problem in communication networks (KPP-COM) show that this approach is competitive with state-of-the-art anytime heuristic search algorithms, and is more robust.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages119-120
Number of pages2
StatePublished - 1 Dec 2010
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: 8 Jul 201010 Jul 2010

Publication series

NameProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Conference

Conference3rd International Symposium on Combinatorial Search, SoCS 2010
Country/TerritoryUnited States
CityAtlanta, GA
Period8/07/1010/07/10

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Potential search: A new greedy anytime heuristic search'. Together they form a unique fingerprint.

Cite this