International Conference on Automated Planning and Scheduling · 2004 · 38 citations · 9 references
ComputingComputer ScienceData ManagementData StructuresDatabasesData Structure AlgorithmsDatabase ManagementLookup TablesMemory Hierarchy OptimizationQuery ProcessingSearching AlgorithmsHeuristic AlgorithmsIndexing Data StructuresMultiple Pattern MatchingPattern DatabasesPattern MatchingPattern SearchingSearch Performance Metrics
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.
9
Depth-first iterative-deepening
Richard E. Korf · Artificial Intelligence · 1985 · 1.6K citations
Planning with Pattern Databases
Stefan Edelkamp · 2014 · 278 citations
Finding optimal solutions to Rubik's cube using pattern databases
Richard E. Korf · 1997 · 255 citations
Disjoint pattern database heuristics
Richard E. Korf, Ariel Felner · Artificial Intelligence · 2002 · 198 citations