Automated creation of pattern database search heuristics

16Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Pattern databases are dictionaries for heuristic estimates storing state-to-goal distances in state space abstractions. Their effectiveness is sensitive to the selection of the underlying patterns. Especially for multiple and additive pattern databases, the manual selection of patterns that leads to good exploration results is involved. For automating the selection process, greedy bin-packing has been suggested. This paper proposes genetic algorithms to optimize its output. Patterns are encoded as binary strings and optimized using an objective function that predicts the heuristic search tree size based on the distribution of heuristic values in abstract space. To reduce the memory requirements we construct the pattern databases symbolically. Experiments in heuristic search planning indicate that the total search efforts can be reduced significantly. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Edelkamp, S. (2007). Automated creation of pattern database search heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4428 LNAI, pp. 35–50). Springer Verlag. https://doi.org/10.1007/978-3-540-74128-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free