Better parameter-free anytime search by minimizing time between solutions

Thayer, Jordan T. and Benton, J. and Helmert, Malte. (2012) Better parameter-free anytime search by minimizing time between solutions. In: Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012). [Niagara Falls], pp. 120-128.

PDF - Published Version

Official URL: http://edoc.unibas.ch/dok/A6043816

Downloads: Statistics Overview


This paper presents a new anytime search algorithm, any- time explicit estimation search (AEES). AEES is an anytime search algorithm which attempts to minimize the time between improvements to its incumbent solution by taking advantage of the differences between solution cost and length. We provide an argument that minimizing the time between solutions is the right thing to do for an anytime search algorithm and show that when actions have differing costs, many state-of-the-art search algorithms, including the search strategy of LAMA11 and anytime nonparametric A*, do not minimize the time between solutions. An empirical evaluation on seven domains shows that AEES often has both the shortest time between incumbent solutions and the best solution in hand for a wide variety of cutoffs.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:20 Nov 2018 10:22
Deposited On:13 Sep 2013 07:57

Repository Staff Only: item control page