Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions

作者: Robert Holte , Martin Müller , Gaojian Fan

DOI:

关键词: General methodHeuristicsCluster (physics)Causal graphTheoretical computer scienceNonlinear systemMathematicsAbstract spaceOptimal planningMerge (version control)Mathematical optimization

摘要: Merge-and-shrink is a general method for deriving accurate abstraction heuristics. We present two novel nonlinear merging strategies, UMC and MIASM, based on variable interaction. The principle underlying our methods to merge strongly interacting variables early on. measures interaction by weighted causal graph edges, MIASM in terms of the number necessary states abstract space defined variables. partition into clusters which interactions are strong, within each cluster before clusters. Our experimental results show that new strategies often produce better heuristics nodes expanded A . On certain IPC benchmark domains, tasks cannot be solved existing can with minimum search effort using created methods.

参考文章(16)
Malte Helmert, Jörg Hoffmann, Michael Katz, How to relax a bisimulation international conference on automated planning and scheduling. pp. 101- 109 ,(2012)
Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Introduction to Algorithms, third edition ,(2009)
Esther M. Arkin, Refael Hassin, On Local Search for Weighted k-Set Packing european symposium on algorithms. pp. 13- 22 ,(1997) , 10.1007/3-540-63397-9_2
Malte Helmert, Jorg Hoffmann, Patrik Haslum, Flexible abstraction heuristics for optimal sequential planning international conference on automated planning and scheduling. pp. 176- 183 ,(2007)
Barun Chandra, Magnús M Halldórsson, Greedy Local Improvement and Weighted Set Packing Approximation Journal of Algorithms. ,vol. 39, pp. 223- 240 ,(2001) , 10.1006/JAGM.2000.1155
Christer Bäckström, Bernhard Nebel, COMPLEXITY RESULTS FOR SAS+ PLANNING computational intelligence. ,vol. 11, pp. 625- 655 ,(1995) , 10.1111/J.1467-8640.1995.TB00052.X
Mechthild Stoer, Frank Wagner, A simple min-cut algorithm Journal of the ACM. ,vol. 44, pp. 585- 591 ,(1997) , 10.1145/263867.263872
Klaus Dräger, Bernd Finkbeiner, Andreas Podelski, Directed model checking with distance-preserving abstractions International Journal on Software Tools for Technology Transfer. ,vol. 11, pp. 27- 37 ,(2009) , 10.1007/S10009-008-0092-Z
James B. Orlin, Jianxiu Hao, A faster algorithm for finding the minimum cut in a graph symposium on discrete algorithms. pp. 165- 174 ,(1992)