The Compressed Differential Heuristic

Meir Goldenberg; Nathan Sturtevant; Ariel Felner; Jonathan Schaeffer

The Compressed Differential Heuristic

Meir Goldenberg, Nathan Sturtevant, Ariel Felner, Jonathan Schaeffer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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) are flexible and can be tuned to fit any size of memory, even smaller than the size of the state space. Furthermore, CDHs can be built without the need to create and store the entire uncompressed DH. Experimental results across different domains show that, for a given amount of memory, a CDH significantly outperforms an uncompressed DH.

Original language	English
Title of host publication	Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
Pages	24-29
Number of pages	6
ISBN (Electronic)	9781577355083
State	Published - 11 Aug 2011
Event	25th AAAI Conference on Artificial Intelligence, AAAI 2011 - San Francisco, United States Duration: 7 Aug 2011 → 11 Aug 2011

Publication series

Name	Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

Conference

Conference	25th AAAI Conference on Artificial Intelligence, AAAI 2011
Country/Territory	United States
City	San Francisco
Period	7/08/11 → 11/08/11

All Science Journal Classification (ASJC) codes

Artificial Intelligence

Cite this

@inproceedings{3499f74ff4f74bb9ad97a39880e52b12,

title = "The Compressed Differential Heuristic",

abstract = "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) are flexible and can be tuned to fit any size of memory, even smaller than the size of the state space. Furthermore, CDHs can be built without the need to create and store the entire uncompressed DH. Experimental results across different domains show that, for a given amount of memory, a CDH significantly outperforms an uncompressed DH.",

author = "Meir Goldenberg and Nathan Sturtevant and Ariel Felner and Jonathan Schaeffer",

note = "Publisher Copyright: Copyright {\textcopyright} 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 25th AAAI Conference on Artificial Intelligence, AAAI 2011 ; Conference date: 07-08-2011 Through 11-08-2011",

year = "2011",

month = aug,

day = "11",

language = "الإنجليزيّة",

series = "Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011",

pages = "24--29",

booktitle = "Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011",

}

Goldenberg, M, Sturtevant, N, Felner, A & Schaeffer, J 2011, The Compressed Differential Heuristic. in Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011. Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011, pp. 24-29, 25th AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, United States, 7/08/11.

The Compressed Differential Heuristic. / Goldenberg, Meir; Sturtevant, Nathan; Felner, Ariel et al.
Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011. 2011. p. 24-29 (Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The Compressed Differential Heuristic

AU - Goldenberg, Meir

AU - Sturtevant, Nathan

AU - Felner, Ariel

AU - Schaeffer, Jonathan

PY - 2011/8/11

Y1 - 2011/8/11

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) are flexible and can be tuned to fit any size of memory, even smaller than the size of the state space. Furthermore, CDHs can be built without the need to create and store the entire uncompressed DH. 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) are flexible and can be tuned to fit any size of memory, even smaller than the size of the state space. Furthermore, CDHs can be built without the need to create and store the entire uncompressed DH. 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=84893366587&partnerID=8YFLogxK

M3 - منشور من مؤتمر

T3 - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

SP - 24

EP - 29

BT - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

T2 - 25th AAAI Conference on Artificial Intelligence, AAAI 2011

Y2 - 7 August 2011 through 11 August 2011

ER -

The Compressed Differential Heuristic

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Cite this