|
Size: 1398
Comment:
|
← Revision 36 as of 2024-01-11 22:26:37 ⇥
Size: 4380
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| == Merge strategy DFP == | This page describes the various merge strategies supported by the planner. |
| Line 5: | Line 5: |
| 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: | == Precomputed merge strategy == |
| 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>> In ''Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014)'', pp. 2358-2366. AAAI Press 2014. |
This merge strategy has a precomputed merge tree. Note that this merge strategy does not take into account the current state of the factored transition system. This also means that this merge strategy relies on the factored transition system being synchronized with this merge tree, i.e. all merges are performed exactly as given by the merge tree. |
| Line 12: | Line 10: |
| merge_dfp() | merge_precomputed(merge_tree, verbosity=normal) |
| Line 15: | Line 13: |
| == Linear merge strategies == | * ''merge_tree'' ([[Doc/MergeTree|MergeTree]]): The precomputed merge tree. * ''verbosity'' ({silent, normal, verbose, debug}): Option to specify the verbosity level. * {{{silent}}}: only the most basic output * {{{normal}}}: relevant information to monitor progress * {{{verbose}}}: full output * {{{debug}}}: like verbose with additional debug output |
| Line 17: | Line 20: |
| This merge strategy implements several linear merge orders, which are described in the paper: | '''Note:''' An example of a precomputed merge startegy is a linear merge strategy, which can be obtained using: {{{ merge_strategy=merge_precomputed(merge_tree=linear(<variable_order>)) }}} |
| Line 19: | Line 25: |
| * Malte Helmert, Patrik Haslum and Joerg Hoffmann.<<BR>> [[http://ai.cs.unibas.ch/papers/helmert-et-al-icaps2007.pdf|Flexible Abstraction Heuristics for Optimal Sequential Planning]]<<BR>> In ''Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007)'', pp. 176-183. 2007. |
== Merge strategy SSCs == This merge strategy implements the algorithm described in the paper * Silvan Sievers, Martin Wehrle and Malte Helmert.<<BR>> [[https://ai.dmi.unibas.ch/papers/sievers-et-al-icaps2016.pdf|An Analysis of Merge Strategies for Merge-and-Shrink Heuristics]].<<BR>> In ''Proceedings of the 26th International Conference on Planning and Scheduling (ICAPS 2016)'', pp. 2358-2366. AAAI Press, 2016. In a nutshell, it computes the maximal SCCs of the causal graph, obtaining a partitioning of the task's variables. Every such partition is then merged individually, using the specified fallback merge strategy, considering the SCCs in a configurable order. Afterwards, all resulting composite abstractions are merged to form the final abstraction, again using the specified fallback merge strategy and the configurable order of the SCCs. |
| Line 24: | Line 36: |
| merge_linear(variable_order=CG_GOAL_LEVEL) | merge_sccs(order_of_sccs=topological, merge_tree=<none>, merge_selector=<none>, verbosity=normal) |
| Line 27: | Line 39: |
| * ''variable_order'' ({CG_GOAL_LEVEL, CG_GOAL_RANDOM, GOAL_CG_LEVEL, RANDOM, LEVEL, REVERSE_LEVEL}): the order in which atomic transition systems are merged | * ''order_of_sccs'' ({topological, reverse_topological, decreasing, increasing}): how the SCCs should be ordered * {{{topological}}}: according to the topological ordering of the directed graph where each obtained SCC is a 'supervertex' * {{{reverse_topological}}}: according to the reverse topological ordering of the directed graph where each obtained SCC is a 'supervertex' * {{{decreasing}}}: biggest SCCs first, using 'topological' as tie-breaker * {{{increasing}}}: smallest SCCs first, using 'topological' as tie-breaker * ''merge_tree'' ([[Doc/MergeTree|MergeTree]]): the fallback merge strategy to use if a precomputed strategy should be used. * ''merge_selector'' ([[Doc/MergeSelector|MergeSelector]]): the fallback merge strategy to use if a stateless strategy should be used. * ''verbosity'' ({silent, normal, verbose, debug}): Option to specify the verbosity level. * {{{silent}}}: only the most basic output * {{{normal}}}: relevant information to monitor progress * {{{verbose}}}: full output * {{{debug}}}: like verbose with additional debug output |
| Line 29: | Line 52: |
| /* moin code generated by txt2tags 2.6b (http://txt2tags.sf.net) */ /* cmdline: txt2tags */ |
== Stateless merge strategy == This merge strategy has a merge selector, which computes the next merge only depending on the current state of the factored transition system, not requiring any additional information. {{{ merge_stateless(merge_selector, verbosity=normal) }}} * ''merge_selector'' ([[Doc/MergeSelector|MergeSelector]]): The merge selector to be used. * ''verbosity'' ({silent, normal, verbose, debug}): Option to specify the verbosity level. * {{{silent}}}: only the most basic output * {{{normal}}}: relevant information to monitor progress * {{{verbose}}}: full output * {{{debug}}}: like verbose with additional debug output '''Note:''' Examples include the DFP merge strategy, which can be obtained using: {{{ merge_strategy=merge_stateless(merge_selector=score_based_filtering(scoring_functions=[goal_relevance,dfp,total_order(<order_option>))])) }}} and the (dynamic/score-based) MIASM strategy, which can be obtained using: {{{ merge_strategy=merge_stateless(merge_selector=score_based_filtering(scoring_functions=[sf_miasm(<shrinking_options>),total_order(<order_option>)] }}} |
This page describes the various merge strategies supported by the planner.
Precomputed merge strategy
This merge strategy has a precomputed merge tree. Note that this merge strategy does not take into account the current state of the factored transition system. This also means that this merge strategy relies on the factored transition system being synchronized with this merge tree, i.e. all merges are performed exactly as given by the merge tree.
merge_precomputed(merge_tree, verbosity=normal)
merge_tree (MergeTree): The precomputed merge tree.
verbosity ({silent, normal, verbose, debug}): Option to specify the verbosity level.
silent: only the most basic output
normal: relevant information to monitor progress
verbose: full output
debug: like verbose with additional debug output
Note: An example of a precomputed merge startegy is a linear merge strategy, which can be obtained using:
merge_strategy=merge_precomputed(merge_tree=linear(<variable_order>))
Merge strategy SSCs
This merge strategy implements the algorithm described in the paper
Silvan Sievers, Martin Wehrle and Malte Helmert.
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics.
In Proceedings of the 26th International Conference on Planning and Scheduling (ICAPS 2016), pp. 2358-2366. AAAI Press, 2016.
In a nutshell, it computes the maximal SCCs of the causal graph, obtaining a partitioning of the task's variables. Every such partition is then merged individually, using the specified fallback merge strategy, considering the SCCs in a configurable order. Afterwards, all resulting composite abstractions are merged to form the final abstraction, again using the specified fallback merge strategy and the configurable order of the SCCs.
merge_sccs(order_of_sccs=topological, merge_tree=<none>, merge_selector=<none>, verbosity=normal)
order_of_sccs ({topological, reverse_topological, decreasing, increasing}): how the SCCs should be ordered
topological: according to the topological ordering of the directed graph where each obtained SCC is a 'supervertex'
reverse_topological: according to the reverse topological ordering of the directed graph where each obtained SCC is a 'supervertex'
decreasing: biggest SCCs first, using 'topological' as tie-breaker
increasing: smallest SCCs first, using 'topological' as tie-breaker
merge_tree (MergeTree): the fallback merge strategy to use if a precomputed strategy should be used.
merge_selector (MergeSelector): the fallback merge strategy to use if a stateless strategy should be used.
verbosity ({silent, normal, verbose, debug}): Option to specify the verbosity level.
silent: only the most basic output
normal: relevant information to monitor progress
verbose: full output
debug: like verbose with additional debug output
Stateless merge strategy
This merge strategy has a merge selector, which computes the next merge only depending on the current state of the factored transition system, not requiring any additional information.
merge_stateless(merge_selector, verbosity=normal)
merge_selector (MergeSelector): The merge selector to be used.
verbosity ({silent, normal, verbose, debug}): Option to specify the verbosity level.
silent: only the most basic output
normal: relevant information to monitor progress
verbose: full output
debug: like verbose with additional debug output
Note: Examples include the DFP merge strategy, which can be obtained using:
merge_strategy=merge_stateless(merge_selector=score_based_filtering(scoring_functions=[goal_relevance,dfp,total_order(<order_option>))]))
and the (dynamic/score-based) MIASM strategy, which can be obtained using:
merge_strategy=merge_stateless(merge_selector=score_based_filtering(scoring_functions=[sf_miasm(<shrinking_options>),total_order(<order_option>)]