## 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 |

### 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