Multiple Pattern Databases
- Robert Holte, Department of Computing Science, University of Alberta
- Jack Newton
- Ariel Felner, Information Systems Engineering, Ben-Gurion University, Israel
- Ram Meshulam, Computer Science, Bar-Ilan University, Israel
- David Furcy, Georgia Institute of Technology, Atlanta, GA
A pattern database is a heuristic function stored as a lookup table. This paper considers how best to use a fixed amount (m units) of memory for storing pattern databases. In particular, we examine whether using n pattern databases of size m=n instead of one pattern database of size m improves search performance. In all the domains considered, the use of multiple smaller pattern databases reduces the number of nodes generated by IDA*. The paper provides an explanation for this phenomenon based on the distribution of heuristic values that occur during search.
Citation
R. Holte, J. Newton, A. Felner, R. Meshulam, D. Furcy. "Multiple Pattern Databases". ICAPS, pp 122-131, June 2004.| Keywords: | multiple |
| Category: | In Conference |
BibTeX
@incollection{Holte+al:ICAPS04,
author = {Robert Holte and Jack Newton and Ariel Felner and Ram Meshulam and
David Furcy},
title = {Multiple Pattern Databases},
Pages = {122-131},
booktitle = {},
year = 2004,
}Last Updated: June 04, 2007Submitted by Staurt H. Johnson
