Stubborn Sets for Fully Observable Nondeterministic Planning

Winterer, Dominik and Alkhazraji, Yusra and Katz, Michael and Wehrle, Martin. (2017) Stubborn Sets for Fully Observable Nondeterministic Planning. In: Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling. Workshop on Model Checking and Automated Planning (MOCHAP). Palo Alto, California, pp. 330-338.

PDF - Published Version

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

Downloads: Statistics Overview


Pruning techniques based on strong stubborn sets have recently shown their potential for SAS+ planning as heuristic search. Strong stubborn sets exploit operator independency to safely prune the search space. Like SAS
+ planning, fully observable nondeterministic (FOND) planning faces the state explosion problem. However, it is unclear how stubborn set techniques carry over to the nondeterministic setting. In this paper, we introduce stubborn set pruning to FOND planning. We lift the notion of strong stubborn sets and introduce the conceptually more powerful notion of weak stubborn sets to FOND planning. Our experimental analysis shows that weak stubborn sets are beneficial to an LAO* search, and in particular show favorable performance when combined with symmetries and active operator pruning.
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:28 Nov 2018 14:49
Deposited On:17 May 2017 10:43

Repository Staff Only: item control page