Compressing pattern databases

Ariel Feiner, Ram Meshulam, Robert C. Holte, Richard E. Korf

Research output: Contribution to conferencePaperpeer-review

32 Scopus citations

Abstract

A pattern database is a heuristic function stored as a lookup table which stores the lengths of optimal solutions for instances of subproblems. All previous pattern databases had a distinct entry in the table for each subproblem instance. In this paper we investigate compressing pattern databases by merging several adjacent entries into one, thereby allowing the use of pattern databases that exceed available memory in their uncompressed form. We show that since adjacent entries are highly correlated, much of the information is preserved. Experiments on the sliding tile puzzles and the 4-peg Towers of Hanoi puzzle show that, for a given amount of memory, search time is reduced by up to 3 orders of magnitude by using compressed pattern databases.

Original languageEnglish
Pages638-643
Number of pages6
StatePublished - 9 Dec 2004
Externally publishedYes
EventProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) - San Jose, CA, United States
Duration: 25 Jul 200429 Jul 2004

Conference

ConferenceProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
Country/TerritoryUnited States
CitySan Jose, CA
Period25/07/0429/07/04

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Compressing pattern databases'. Together they form a unique fingerprint.

Cite this