@inproceedings{a196d5a0b4ac421a9288dd06e36de721,
title = "Potential search: A new greedy anytime heuristic search",
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.",
author = "Roni Stern and Rami Puzis and Ariel Felner",
year = "2010",
month = jan,
day = "1",
doi = "10.1609/socs.v1i1.18177",
language = "English",
isbn = "9781577354819",
series = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",
publisher = "AAAI press",
pages = "119--120",
booktitle = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",
note = "3rd International Symposium on Combinatorial Search, SoCS 2010 ; Conference date: 08-07-2010 Through 10-07-2010",
}