Multiple pattern databases

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

Multiple pattern databases

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

36 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 language	English
Title of host publication	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
Editors	S. Zilberstein, J. Koehler, S. Koenig
Pages	122-131
Number of pages	10
State	Published - 2004
Event	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 - Whistler, BC, Canada Duration: 3 Jun 2004 → 7 Jun 2004

Publication series

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

Conference

Conference	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
Country/Territory	Canada
City	Whistler, BC
Period	3/06/04 → 7/06/04

Cite this

@inproceedings{acff3fb7c6fb44bd946329c7474fef35,

title = "Multiple pattern databases",

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.",

author = "Holte, {R. C.} and Jack Newton and A. Felner and R. Meshulam and David Furcy",

year = "2004",

language = "אנגלית",

isbn = "1577352009",

series = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004",

pages = "122--131",

editor = "S. Zilberstein and J. Koehler and S. Koenig",

booktitle = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004",

note = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 ; Conference date: 03-06-2004 Through 07-06-2004",

}

Holte, RC, Newton, J, Felner, A, Meshulam, R & Furcy, D 2004, Multiple pattern databases. in S Zilberstein, J Koehler & S Koenig (eds), Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004, pp. 122-131, Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004, Whistler, BC, Canada, 3/06/04.

Multiple pattern databases. / Holte, R. C.; Newton, Jack; Felner, A. et al.
Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004. ed. / S. Zilberstein; J. Koehler; S. Koenig. 2004. p. 122-131 (Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multiple pattern databases

AU - Holte, R. C.

AU - Newton, Jack

AU - Felner, A.

AU - Meshulam, R.

AU - Furcy, David

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=13444280599&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:13444280599

SN - 1577352009

SN - 9781577352006

T3 - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

SP - 122

EP - 131

BT - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

A2 - Zilberstein, S.

A2 - Koehler, J.

A2 - Koenig, S.

T2 - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Y2 - 3 June 2004 through 7 June 2004

ER -

Multiple pattern databases

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this