Limitations of front-to-end bidirectional heuristic search

摘要: We present an intuitive explanation for the limited effectiveness of front-to-end bidirectional heuristic search, supported with extensive evidence from many commonly-studied domains. While previous work has proved limitations specific algorithms, we show that any search algorithm will likely be dominated by unidirectional or brute-force search. also demonstrate a pathological case where is dominant algorithm, so stronger claim cannot made. Finally, on four-peg Towers Of Hanoi arbitrary start and goal states, outperforms using pattern-database heuristics.