On Weak Stubborn Sets in Classical Planning
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 4167-4174.
https://doi.org/10.24963/ijcai.2021/573
Keywords
- Planning and Scheduling: Theoretical Foundations of Planning
- Planning and Scheduling: Planning Algorithms
- Planning and Scheduling: Search in Planning and Scheduling
Abstract
Stubborn sets are a pruning technique for state-space search which is well established in optimal classical planning. In this paper, we show that weak stubborn sets introduced in recent work in planning are actually not weak stubborn sets in Valmari's original sense. Based on this finding, we introduce weak stubborn sets in the original sense for planning by providing a generalized definition analogously to generalized strong stubborn sets in previous work. We discuss the relationship of strong, weak and the previously called weak stubborn sets, thus providing a further step in getting an overall picture of the stubborn set approach in planning.
@inproceedings{ijcai2021p573,
title = {On Weak Stubborn Sets in Classical Planning},
author = {Sievers, Silvan and Wehrle, Martin},
booktitle = {Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, {IJCAI-21}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Prof. Zhi-Hua Zhou},
pages = {4167--4174},
year = {2021},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2021/573},
url = {https://doi.org/10.24963/ijcai.2021/573},
}
TY - CPAPER TI - On Weak Stubborn Sets in Classical Planning AU - Sievers, Silvan AU - Wehrle, Martin T2 - Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2021 SP - 4167 EP - 4174 DO - 10.24963/ijcai.2021/573 UR - https://doi.org/10.24963/ijcai.2021/573 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: