Partial-expansion A* with selective node generation

Ariel Felner; Meir Goldenberg; Guni Sharon; Roni Stern; Tal Beja; Nathan Sturtevant; Jonathan Schaeffer; Robert C. Holte

Partial-expansion A* with selective node generation

Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Jonathan Schaeffer, Robert C. Holte

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

4 Scopus citations

Abstract

A* is often described as being 'optimal', in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* (PEA*) (Yoshizumi, Miura, and Ishida 2000) addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. We introduce an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* only generates the children with the same f-cost as the parent. State-of-the-art results were obtained for a number of domains. Drawbacks of EPEA* are also discussed. A full version of this paper appears in the proceedings of AAAI-2012 (Felner et al. 2012).

Original language	English
Title of host publication	Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Pages	180-181
Number of pages	2
State	Published - 1 Dec 2012
Event	5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada Duration: 19 Jul 2012 → 21 Jul 2012

Publication series

Name	Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Conference

Conference	5th International Symposium on Combinatorial Search, SoCS 2012
Country/Territory	Canada
City	Niagara Falls, ON
Period	19/07/12 → 21/07/12

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

@inproceedings{13acc63f6a204afcbb5e5455fbfedb7b,

title = "Partial-expansion A* with selective node generation",

abstract = "A* is often described as being 'optimal', in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* (PEA*) (Yoshizumi, Miura, and Ishida 2000) addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. We introduce an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* only generates the children with the same f-cost as the parent. State-of-the-art results were obtained for a number of domains. Drawbacks of EPEA* are also discussed. A full version of this paper appears in the proceedings of AAAI-2012 (Felner et al. 2012).",

author = "Ariel Felner and Meir Goldenberg and Guni Sharon and Roni Stern and Tal Beja and Nathan Sturtevant and Jonathan Schaeffer and Holte, {Robert C.}",

year = "2012",

month = dec,

day = "1",

language = "English",

isbn = "9781577355847",

series = "Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012",

pages = "180--181",

booktitle = "Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012",

note = "5th International Symposium on Combinatorial Search, SoCS 2012 ; Conference date: 19-07-2012 Through 21-07-2012",

}

Felner, A, Goldenberg, M, Sharon, G, Stern, R, Beja, T, Sturtevant, N, Schaeffer, J & Holte, RC 2012, Partial-expansion A* with selective node generation. in Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012. Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012, pp. 180-181, 5th International Symposium on Combinatorial Search, SoCS 2012, Niagara Falls, ON, Canada, 19/07/12.

Partial-expansion A* with selective node generation. / Felner, Ariel; Goldenberg, Meir; Sharon, Guni et al.
Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012. 2012. p. 180-181 (Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012).

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

TY - GEN

T1 - Partial-expansion A* with selective node generation

AU - Felner, Ariel

AU - Goldenberg, Meir

AU - Sharon, Guni

AU - Stern, Roni

AU - Beja, Tal

AU - Sturtevant, Nathan

AU - Schaeffer, Jonathan

AU - Holte, Robert C.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - A* is often described as being 'optimal', in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* (PEA*) (Yoshizumi, Miura, and Ishida 2000) addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. We introduce an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* only generates the children with the same f-cost as the parent. State-of-the-art results were obtained for a number of domains. Drawbacks of EPEA* are also discussed. A full version of this paper appears in the proceedings of AAAI-2012 (Felner et al. 2012).

AB - A* is often described as being 'optimal', in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especially when the branching factor is large. Partial Expansion A* (PEA*) (Yoshizumi, Miura, and Ishida 2000) addresses this problem when expanding a node, n, by generating all the children of n but only storing children with the same f-cost as n. We introduce an enhanced version of PEA* (EPEA*). Given a priori domain knowledge, EPEA* only generates the children with the same f-cost as the parent. State-of-the-art results were obtained for a number of domains. Drawbacks of EPEA* are also discussed. A full version of this paper appears in the proceedings of AAAI-2012 (Felner et al. 2012).

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

M3 - Conference contribution

AN - SCOPUS:84893402975

SN - 9781577355847

T3 - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

SP - 180

EP - 181

BT - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

T2 - 5th International Symposium on Combinatorial Search, SoCS 2012

Y2 - 19 July 2012 through 21 July 2012

ER -

Partial-expansion A* with selective node generation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this