A Brief History and Recent Achievements in Bidirectional Search

The state of the art in bidirectional search has changed significantly a very short time period; we now can answer questions about unidirectional and bidirectional search that until very recently we were unable to answer. This paper is designed to provide an accessible overview of the recent research in bidirectional search in the context of the broader efforts over the last 50 years. We give particular attention to new theoretical results and the algorithms they inspire for optimal and near-optimal node expansions when finding a shortest path.

Acknowledgements

This material is based upon work supported by the National Science Foundation under Grant No. 1551406. The work was sponsored by Israel Science Foundation (ISF) under grant #844/17.