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

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 -