Data Entry: Please note that the research database will be replaced by UNIverse by the end of October 2023. Please enter your data into the system https://universe-intern.unibas.ch. Thanks

Login for users with Unibas email account...

Login for registered users without Unibas email account...

 
A generalization of sleep sets based on operator sequence redundancy
ConferencePaper (Artikel, die in Tagungsbänden erschienen sind)
 
ID 3005977
Author(s) Holte, Robert C.; Alkhazraji, Yusra; Wehrle, Martin
Author(s) at UniBasel Wehrle, Martin
Year 2015
Title A generalization of sleep sets based on operator sequence redundancy
Book title (Conference Proceedings) Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) : January 25 –30, 2015, Austin, Texas, USA
Place of Conference Austin, Texas
Publisher AAAI Press
Place of Publication Palo Alto, Calif.
Pages 3291-3297
Abstract 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.
URL http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/10023/9756
edoc-URL http://edoc.unibas.ch/dok/A6373498
Full Text on edoc Available
 
   

MCSS v5.8 PRO. 0.367 sec, queries - 0.000 sec ©Universität Basel  |  Impressum   |    
29/03/2024