A generalization of sleep sets based on operator sequence redundancy

Holte, Robert C. and Alkhazraji, Yusra and Wehrle, Martin. (2015) A generalization of sleep sets based on operator sequence redundancy. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) : January 25 –30, 2015, Austin, Texas, USA. Palo Alto, Calif., pp. 3291-3297.

PDF - Published Version

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

Downloads: Statistics Overview


Pruning techniques have recently been shown to speed up search algorithms by reducing the branching factor of large search spaces. One such technique is sleep sets, which were originally introduced as a pruning technique for model checking, and which have recently been investigated on a theoretical level for planning. In this paper, we propose a generalization of sleep sets and prove its correctness. While the original sleep sets were based on the commutativity of operators, generalized sleep sets are based on a more general notion of operator sequence redundancy. As a result, our approach dominates the original sleep sets variant in terms of pruning power. On a practical level, our experimental evaluation shows the potential of sleep sets and their generalizations on a large and common set of planning benchmarks.
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:19 Nov 2018 15:30
Deposited On:05 Jun 2015 08:52

Repository Staff Only: item control page