1398
Comment:
|
1398
|
Deletions are marked like this. | Additions are marked like this. |
Line 7: | Line 7: |
* Silvan Sievers, Martin Wehrle, and Malte Helmert.<<BR>> [[http://ai.cs.unibas.ch/papers/sievers-et-al-aaai2014.pdf|Generalized Label Reduction for Merge-and-Shrink Heuristics]].<<BR>> |
* Silvan Sievers, Martin Wehrle and Malte Helmert.<<BR>> [[Generalized Label Reduction for Merge-and-Shrink Heuristics|http://ai.cs.unibas.ch/papers/sievers-et-al-aaai2014.pdf]].<<BR>> |
Line 20: | Line 20: |
[[http://ai.cs.unibas.ch/papers/helmert-et-al-icaps2007.pdf|Flexible Abstraction Heuristics for Optimal Sequential Planning]]<<BR>> | [[Flexible Abstraction Heuristics for Optimal Sequential Planning|http://ai.cs.unibas.ch/papers/helmert-et-al-icaps2007.pdf]].<<BR>> |
Merge strategy DFP
This merge strategy implements the algorithm originally described in the paper "Directed model checking with distance-preserving abstractions" by Draeger, Finkbeiner and Podelski (SPIN 2006), adapted to planning in the following paper:
Silvan Sievers, Martin Wehrle and Malte Helmert.
http://ai.cs.unibas.ch/papers/sievers-et-al-aaai2014.pdf.
In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2358-2366. AAAI Press 2014.
merge_dfp()
Linear merge strategies
This merge strategy implements several linear merge orders, which are described in the paper:
Malte Helmert, Patrik Haslum and Joerg Hoffmann.
http://ai.cs.unibas.ch/papers/helmert-et-al-icaps2007.pdf.
In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 176-183. 2007.
merge_linear(variable_order=CG_GOAL_LEVEL)
variable_order ({CG_GOAL_LEVEL, CG_GOAL_RANDOM, GOAL_CG_LEVEL, RANDOM, LEVEL, REVERSE_LEVEL}): the order in which atomic transition systems are merged