TY - CONF
T1 - On variable dependencies and compressed pattern databases
AU - Helmert, Malte
AU - Sturtevant, Nathan R.
AU - Felner, Ariel
N1 - Funding Information:
We thank the anonymous reviewers for their helpful comments. This work was supported by the Swiss National Science Foundation (SNSF) as part of the project “Reasoning about Plans and Heuristics for Planning and Combinatorial Search” (RAPAHPACS), by the National Science Foundation (NSF) under Grant No. 1551406 and by Israel Science Foundation (ISF) grant #417/13.
Publisher Copyright:
Copyright c 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - Pattern databases are among the strongest known heuristics for many classical search benchmarks such as sliding-tile puzzles, the 4-peg Towers of Hanoi puzzles, Rubik’s Cube, and TopSpin. Min-compression is a generally applicable technique for augmenting pattern database heuristics that has led to marked experimental improvements in some settings, while being ineffective in others. We provide a theoretical explanation for these experimental phenomena by studying the interaction between the ranking function used to order abstract states in a pattern database, the compression scheme used to abstract states, and the dependencies between state variables in the problem representation.
AB - Pattern databases are among the strongest known heuristics for many classical search benchmarks such as sliding-tile puzzles, the 4-peg Towers of Hanoi puzzles, Rubik’s Cube, and TopSpin. Min-compression is a generally applicable technique for augmenting pattern database heuristics that has led to marked experimental improvements in some settings, while being ineffective in others. We provide a theoretical explanation for these experimental phenomena by studying the interaction between the ranking function used to order abstract states in a pattern database, the compression scheme used to abstract states, and the dependencies between state variables in the problem representation.
UR - http://www.scopus.com/inward/record.url?scp=85050528146&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:85050528146
SP - 129
EP - 133
T2 - 10th Annual Symposium on Combinatorial Search, SoCS 2017
Y2 - 16 June 2017 through 17 June 2017
ER -