|
Size: 2705
Comment:
|
Size: 3367
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 13: | Line 13: |
| * ''merge_tree'' ([[Doc/MergeTree|MergeTree]]): The precomputed merge tree | * ''merge_tree'' ([[Doc/MergeTree|MergeTree]]): The precomputed merge tree. '''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 38: | Line 43: |
| '''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)
merge_tree (MergeTree): The precomputed merge tree.
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>)
order_of_sccs ({topological, reverse_topological, decreasing, increasing}): choose an ordering of the SCCs: topological/reverse_topological or decreasing/increasing in the size of the SCCs. The former two options refer to the directed graph where each obtained SCC is a 'supervertex'. For the latter two options, the tie-breaking is to use the topological order according to that same graph of SCC supervertices.
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.
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)
merge_selector (MergeSelector): The merge selector to be used.
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>)]