TY - GEN
T1 - The compressed differential heuristic
AU - Goldenberg, Meir
AU - Sturtevant, Nathan
AU - Felner, Ariel
AU - Schaeffer, Jonathan
PY - 2011
Y1 - 2011
N2 - The differential heuristic (DH) is an effective memory-based heuristic for explicit state spaces. In this paper we aim to improve its performance and memory usage. We introduce a compression method for DHs which stores only a portion of the original uncompressed DH, while preserving enough information to enable efficient search. Compressed DHs (CDH) can be tuned to fit any size of memory, even smaller than the size of the state space. Experimental results across different domains show that, for a given amount of memory, a CDH significantly outperforms an uncompressed DH.
AB - The differential heuristic (DH) is an effective memory-based heuristic for explicit state spaces. In this paper we aim to improve its performance and memory usage. We introduce a compression method for DHs which stores only a portion of the original uncompressed DH, while preserving enough information to enable efficient search. Compressed DHs (CDH) can be tuned to fit any size of memory, even smaller than the size of the state space. Experimental results across different domains show that, for a given amount of memory, a CDH significantly outperforms an uncompressed DH.
UR - http://www.scopus.com/inward/record.url?scp=84893415243&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84893415243
SN - 9781577355373
T3 - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011
SP - 191
EP - 192
BT - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011
T2 - 4th International Symposium on Combinatorial Search, SoCS 2011
Y2 - 15 July 2011 through 16 July 2011
ER -