A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search


  • Vidal Alcázar Riken AIP
  • Pat Riddle University of Auckland
  • Mike Barley University of Auckland




In the past few years, new very successful bidirectional heuristic search algorithms have been proposed. Their key novelty is a lower bound on the cost of a solution that includes information from the g values in both directions. Kaindl and Kainz (1997) proposed measuring how inaccurate a heuristic is while expanding nodes in the opposite direction, and using this information to raise the f value of the evaluated nodes. However, this comes with a set of disadvantages and remains yet to be exploited to its full potential. Additionally, Sadhukhan (2013) presented BAE∗, a bidirectional best-first search algorithm based on the accumulated heuristic inaccuracy along a path. However, no complete comparison in regards to other bidirectional algorithms has yet been done, neither theoretical nor empirical. In this paper we define individual bounds within the lower-bound framework and show how both Kaindl and Kainz's and Sadhukhan's methods can be generalized thus creating new bounds. This overcomes previous shortcomings and allows newer algorithms to benefit from these techniques as well. Experimental results show a substantial improvement, up to an order of magnitude in the number of necessarily-expanded nodes compared to state-of-the-art near-optimal algorithms in common benchmarks.




How to Cite

Alcázar, V., Riddle, P., & Barley, M. (2020). A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search. Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2327-2334. https://doi.org/10.1609/aaai.v34i03.5611



AAAI Technical Track: Heuristic Search and Optimization