Partial-Expansion A* with Selective Node Generation Conference Paper uri icon

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*) 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

published proceedings

  • Proceedings of the International Symposium on Combinatorial Search

author list (cited authors)

  • Felner, A., Goldenberg, M., Sharon, G., Stern, R., Beja, T., Sturtevant, N., Holte, R., & Schaeffer, J.

citation count

  • 0

complete list of authors

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

publication date

  • December 2012