Representing Pattern Databases with Succinct Data Structures

In this paper we describe novel representations for precomputed heuristics based on Level-Ordered Edge Sequence (LOES) encodings. We introduce compressed LOES, an extension to LOES that enables more aggressive compression of the state-set representation. We evaluate the novel repre- sentations against the respective perfect-hash and binary decision diagram (BDD) representations of pattern databases in a variety of STRIPS domains.

Authors

• Tim Schmidt
• Rong Zhou 0001

Keywords

• memoization
• heuristic search
• pattern databases
• state set representation