Sleep Sets Meet Duplicate Elimination

Alkhazraji, Yusra and Wehrle, Martin. (2016) Sleep Sets Meet Duplicate Elimination. In: Proceedings of the Ninth Annual Symposium on Combinatorial Search (SoCS 2016).

PDF - Published Version

Official URL: http://edoc.unibas.ch/45237/

Downloads: Statistics Overview


The sleep sets technique is a path-dependent pruning method for state space search. In the past, the combination of sleep sets with graph search algorithms that perform duplicate elimination has often shown to be error-prone. In this paper, we provide the theoretical basis for the integration of sleep sets with common search algorithms in AI that perform du- plicate elimination. Specifically, we investigate approaches to safely integrate sleep sets with optimal (best-first) search algorithms. Based on this theory, we provide an initial step towards integrating sleep sets within A∗ and additional state pruning techniques like strong stubborn sets. Our experiments show slight, yet consistent improvements on the number of generated search nodes across a large number of standard domains from the international planning competitions.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin
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:27 Nov 2018 14:07
Deposited On:10 Oct 2017 14:32

Repository Staff Only: item control page