Efficient stubborn sets : generalized algorithms and selection strategies

Wehrle, Martin and Helmert, Malte. (2014) Efficient stubborn sets : generalized algorithms and selection strategies. In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014): [held on June 21-26 in Portsmouth, New Hampshire, USA]. Palo Alto, Calif., pp. 323-331.

PDF - Published Version

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

Downloads: Statistics Overview


Strong stubborn sets have recently been analyzed and successfully applied as a pruning technique for planning as heuristic search. Strong stubborn sets are defined declaratively as constraints over operator sets. We show how these constraints can be relaxed to offer more freedom in choosing stubborn sets while maintaining the correctness and optimality of the approach. In general, many operator sets satisfy the definition of stubborn sets. We study different strategies for selecting among these possibilities and show that existing approaches can be considerably improved by rather simple strategies, eliminating most of the overhead of the previous state of the art.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin and 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:19 Nov 2018 15:28
Deposited On:05 Jun 2015 08:53

Repository Staff Only: item control page