.png){kind=icon}
.png){kind=icon}
Return
Maximizing over multiple pattern databases speeds up heuristic search
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2006.09.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A pattern database (PDB) 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 state spaces 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. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
heuristic search
pattern databases
admissible heuristics
IDA*
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available