|
Size: 2218
Comment:
|
← Revision 16 as of 2024-01-11 22:26:37 ⇥
Size: 2408
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| == Generalized label reduction == | This page describes the current single 'option' for label reduction. |
| Line 5: | Line 5: |
| This class implements the generalized label reduction described in the following paper: | == Exact generalized label reduction == This class implements the exact generalized label reduction described in the following paper: |
| Line 8: | Line 10: |
| [[Generalized Label Reduction for Merge-and-Shrink Heuristics|http://ai.cs.unibas.ch/papers/sievers-et-al-aaai2014.pdf]].<<BR>> In ''Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014)'', pp. 2358-2366. AAAI Press 2014. |
[[https://ai.dmi.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. |
| Line 12: | Line 14: |
| exact(before_shrinking, before_merging, method=ALL_TRANSITION_SYSTEMS_WITH_FIXPOINT, system_order=RANDOM) | exact(before_shrinking, before_merging, method=all_transition_systems_with_fixpoint, system_order=random, random_seed=-1) |
| Line 17: | Line 19: |
| * ''method'' ({TWO_TRANSITION_SYSTEMS, ALL_TRANSITION_SYSTEMS, ALL_TRANSITION_SYSTEMS_WITH_FIXPOINT}): Label reduction method. See the AAAI14 paper by Sievers et al. for explanation of the default label reduction method and the 'combinable relation' .Also note that you must set at least one of the options reduce_labels_before_shrinking or reduce_labels_before_merging in order to use the chosen label reduction configuration. * {{{TWO_TRANSITION_SYSTEMS}}}: compute the 'combinable relation' only for the two transition systems being merged next * {{{ALL_TRANSITION_SYSTEMS}}}: compute the 'combinable relation' for labels once for every transition system and reduce labels * {{{ALL_TRANSITION_SYSTEMS_WITH_FIXPOINT}}}: keep computing the 'combinable relation' for labels iteratively for all transition systems until no more labels can be reduced * ''system_order'' ({REGULAR, REVERSE, RANDOM}): Order of transition systems for the label reduction methods that iterate over the set of all transition systems. Only useful for the choices all_transition_systems and all_transition_systems_with_fixpoint for the option label_reduction_method. * {{{REGULAR}}}: transition systems are considered in the FD given order for atomic transition systems and in the order of their creation for composite transition system. * {{{REVERSE}}}: inverse of REGULAR * {{{RANDOM}}}: random order /* moin code generated by txt2tags 2.6b (http://txt2tags.sf.net) */ /* cmdline: txt2tags */ |
* ''method'' ({two_transition_systems, all_transition_systems, all_transition_systems_with_fixpoint}): Label reduction method. See the AAAI14 paper by Sievers et al. for explanation of the default label reduction method and the 'combinable relation' .Also note that you must set at least one of the options reduce_labels_before_shrinking or reduce_labels_before_merging in order to use the chosen label reduction configuration. * {{{two_transition_systems}}}: compute the 'combinable relation' only for the two transition systems being merged next * {{{all_transition_systems}}}: compute the 'combinable relation' for labels once for every transition system and reduce labels * {{{all_transition_systems_with_fixpoint}}}: keep computing the 'combinable relation' for labels iteratively for all transition systems until no more labels can be reduced * ''system_order'' ({regular, reverse, random}): Order of transition systems for the label reduction methods that iterate over the set of all transition systems. Only useful for the choices all_transition_systems and all_transition_systems_with_fixpoint for the option label_reduction_method. * {{{regular}}}: transition systems are considered in the order given in the planner input if atomic and in the order of their creation if composite. * {{{reverse}}}: inverse of regular * {{{random}}}: random order * ''random_seed'' (int [-1, infinity]): Set to -1 (default) to use the global random number generator. Set to any other value to use a local random number generator with the given seed. |
Contents
This page describes the current single 'option' for label reduction.
Exact generalized label reduction
This class implements the exact generalized label reduction described in the following paper:
Silvan Sievers, Martin Wehrle and Malte Helmert.
Generalized Label Reduction for Merge-and-Shrink Heuristics.
In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2358-2366. AAAI Press, 2014.
exact(before_shrinking, before_merging, method=all_transition_systems_with_fixpoint, system_order=random, random_seed=-1)
before_shrinking (bool): apply label reduction before shrinking
before_merging (bool): apply label reduction before merging
method ({two_transition_systems, all_transition_systems, all_transition_systems_with_fixpoint}): Label reduction method. See the AAAI14 paper by Sievers et al. for explanation of the default label reduction method and the 'combinable relation' .Also note that you must set at least one of the options reduce_labels_before_shrinking or reduce_labels_before_merging in order to use the chosen label reduction configuration.
two_transition_systems: compute the 'combinable relation' only for the two transition systems being merged next
all_transition_systems: compute the 'combinable relation' for labels once for every transition system and reduce labels
all_transition_systems_with_fixpoint: keep computing the 'combinable relation' for labels iteratively for all transition systems until no more labels can be reduced
system_order ({regular, reverse, random}): Order of transition systems for the label reduction methods that iterate over the set of all transition systems. Only useful for the choices all_transition_systems and all_transition_systems_with_fixpoint for the option label_reduction_method.
regular: transition systems are considered in the order given in the planner input if atomic and in the order of their creation if composite.
reverse: inverse of regular
random: random order
random_seed (int [-1, infinity]): Set to -1 (default) to use the global random number generator. Set to any other value to use a local random number generator with the given seed.