An optimal bidirectional search algorithm

  • Jürgen Eckerle
Part of the Lecture Notes in Computer Science book series (LNCS, volume 861)


Several optimality theorems hold for the A* algorithm, one important says: A* dominates every other admissible heuristic search algorithm assumed that the underlying heuristic function is monotone. An analogous result is proved for the bidirectional case. A bidirectional heuristic search algorithm, named OBDS, is presented which is admissible and dominates every other admissible bidirectional heuristic search algorithm B assumed that the underlying heuristic function is bi-monotone.


search heuristic search bidirectional search optimality 

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Jürgen Eckerle
    • 1
  1. 1.Institut für InformatikUniversität FreiburgFreiburgGermany

Personalised recommendations