Optimal-Generation Variants of EPEA*

摘要: It is known that A* optimal with respect to the expanded nodes (Dechter and Pearl 1985) (D&P). The exact meaning of this optimality varies depending on class algorithms instances over which claimed be optimal. does not provide any guarantees generated nodes. However, such may critical for optimally solving domains a large branching factor. In paper, we introduce two new variants recently introduced Enhanced Partial Expansion algorithm (EPEA*) (Felner et al. 2012). We leverage results D&P show these possess in much same sense as possesses paper are theoretical. A study practical performance beyond scope paper.