Multiple pattern databases

R. C. Holte, Jack Newton, A. Felner, R. Meshulam, David Furcy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
EditorsS. Zilberstein, J. Koehler, S. Koenig
Pages122-131
Number of pages10
StatePublished - 1 Dec 2004
Externally publishedYes
EventProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 - Whistler, BC, Canada
Duration: 3 Jun 20047 Jun 2004

Publication series

NameProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Conference

ConferenceProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
Country/TerritoryCanada
CityWhistler, BC
Period3/06/047/06/04

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Multiple pattern databases'. Together they form a unique fingerprint.

Cite this