Abstract
Perimeters and pattern databases are two similar memory-based techniques used in single-agent search problems. We present partial pattern databases, which unify the two approaches into a single memory-based heuristic table. Our approach allows the use of any abstraction level. We achieve a three-fold reduction in the average number of nodes generated on the 13-pancake puzzle and a 27% reduction on the 15-puzzle. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Anderson, K., Holte, R., & Schaeffer, J. (2007). Partial pattern databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4612 LNAI, pp. 20–34). Springer Verlag. https://doi.org/10.1007/978-3-540-73580-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
