TY - GEN
T1 - Efficient single frontier bidirectional search
AU - Lippi, Marco
AU - Ernandes, Marco
AU - Felner, Ariel
PY - 2012/12/1
Y1 - 2012/12/1
N2 - The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.
AB - The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.
UR - https://www.scopus.com/pages/publications/84893404064
M3 - Conference contribution
AN - SCOPUS:84893404064
SN - 9781577355847
T3 - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
SP - 49
EP - 56
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 -