|
⇤ ← Revision 1 as of 2016-04-11 16:44:31
Size: 2348
Comment:
|
Size: 2348
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 18: | Line 18: |
| [[The Relative Pruning Power of Strong Stubborn Sets and Expansion Core|http://www.aaai.org/ocs/index.php/ICAPS/ICAPS13/paper/view/6053/6185]].<<BR>> | [[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS13/paper/view/6053/6185|The Relative Pruning Power of Strong Stubborn Sets and Expansion Core]].<<BR>> |
| Line 30: | Line 30: |
| [[A Stubborn Set Algorithm for Optimal Planning|http://ai.cs.unibas.ch/papers/alkhazraji-et-al-ecai2012.pdf]].<<BR>> | [[http://ai.cs.unibas.ch/papers/alkhazraji-et-al-ecai2012.pdf|A Stubborn Set Algorithm for Optimal Planning]].<<BR>> |
| Line 34: | Line 34: |
| [[Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies|http://www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7922/8042]].<<BR>> | [[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7922/8042|Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies]].<<BR>> |
Contents
Prune or reorder applicable operators.
No pruning
This is a skeleton method that does not perform any pruning, i.e., all applicable operators are applied in all expanded states.
null()
StubbornSetsEC
Stubborn sets represent a state pruning method which computes a subset of applicable operators in each state such that completeness and optimality of the overall search is preserved. As stubborn sets rely on several design choices, there are different variants thereof. The variant 'StubbornSetsEC' resolves the design choices such that the resulting pruning method is guaranteed to strictly dominate the Expansion Core pruning method. For details, see
Martin Wehrle, Malte Helmert, Yusra Alkhazraji and Robert Mattmüller.
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 251-259. AAAI Press 2013.
stubborn_sets_ec()
Stubborn sets simple
Stubborn sets represent a state pruning method which computes a subset of applicable operators in each state such that completeness and optimality of the overall search is preserved. As stubborn sets rely on several design choices, there are different variants thereof. The variant 'StubbornSetsSimple' resolves the design choices in a straight-forward way. For details, see the following papers:
Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller and Malte Helmert.
A Stubborn Set Algorithm for Optimal Planning.
In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 891-892. IOS Press 2012.Martin Wehrle and Malte Helmert.
Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 323-331. AAAI Press, 2014.
stubborn_sets_simple()