Value compression of pattern databases

Nathan R. Sturtevant, Ariel Felner, Malte Helmert

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

Abstract

One common pattern database compression technique is to merge adjacent database entries and store the minimum of merged entries to maintain heuristic admissibility. In this paper we propose a compression technique that preserves every entry, but reduces the number of bits used to store each entry, therefore limiting the values that can be represented. Even when this technique throws away low values in the heuristic, it can still have better performance than the traditional approach. We develop a theoretical basis for selecting which values to keep and show improved performance in both unidirectional and bidirectional search.

Original languageEnglish
Pages912-918
Number of pages7
StatePublished - 1 Jan 2017
Event31st AAAI Conference on Artificial Intelligence, AAAI 2017 - San Francisco, United States
Duration: 4 Feb 201710 Feb 2017

Conference

Conference31st AAAI Conference on Artificial Intelligence, AAAI 2017
Country/TerritoryUnited States
CitySan Francisco
Period4/02/1710/02/17

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this