Differences between revisions 8 and 9
Revision 8 as of 2015-07-28 16:45:28
Size: 1398
Editor: XmlRpcBot
Comment:
Revision 9 as of 2016-04-11 16:44:30
Size: 1398
Editor: XmlRpcBot
Comment:
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:

merge_dfp()

Linear merge strategies

This merge strategy implements several linear merge orders, which are described in the paper:

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

FastDownward: Doc/MergeStrategy (last edited 2024-01-11 22:26:37 by XmlRpcBot)