Bidirectional search

Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet. The reason for this approach is that in many cases it is faster: for instance, in a simplified model of search problem complexity in which both searches expand a tree with branching factor b, and the distance from start to goal is d, each of the two searches has complexity O(bd/2) (in Big O notation), and the sum of these two search times is much less than the O(bd) complexity that would result from a single search from the beginning to the goal.

Andrew Goldberg and others explained the correct termination conditions for the bidirectional version of Dijkstra’s Algorithm.[1]

As in A* search, bi-directional search can be guided by a heuristic estimate of the remaining distance to the goal (in the forward tree) or from the start (in the backward tree).

Ira Pohl (1971) was the first one to design and implement a bi-directional heuristic search algorithm. Search trees emanating from the start and goal nodes failed to meet in the middle of the solution space. The BHFFA algorithm fixed this defect Champeaux (1977).

A solution found by the uni-directional A* algorithm using an admissible heuristic has a shortest path length; the same property holds for the BHFFA2 bidirectional heuristic version described in de Champeaux (1983). BHFFA2 has, among others, more careful termination conditions than BHFFA.

## Description[edit]

A Bidirectional Heuristic Search is a state space search from some state  s {\displaystyle s} to another state  t {\displaystyle t} , searching from  s {\displaystyle s} to  t {\displaystyle t} and from  t {\displaystyle t} to  s {\displaystyle s} simultaneously. It returns a valid list of operators that if applied to  s {\displaystyle s} will give us  t {\displaystyle t} .

While it may seem as though the operators have to be invertible for the reverse search, it is only necessary to be able to find, given any node  n {\displaystyle n} , the set of parent nodes of  n {\displaystyle n} such that there exists some valid operator from each of the parent nodes to  n {\displaystyle n} . This has often been likened to a one-way street in the route-finding domain: it is not necessary to be able to travel down both directions, but it is necessary when standing at the end of the street to determine the beginning of the street as a possible route.

Similarly, for those edges that have inverse arcs (i.e. arcs going in both directions) it is not necessary that each direction be of equal cost. The reverse search will always use the inverse cost (i.e. the cost of the arc in the forward direction). More formally, if  n {\displaystyle n} is a node with parent  p {\displaystyle p} , then  k 1 ( p , n ) = k 2 ( n , p ) {\displaystyle k_{1}(p,n)=k_{2}(n,p)} , defined as being the cost from  p {\displaystyle p} to  n {\displaystyle n} .(Auer Kaindl 2004)

### Terminology and notation[edit]

b {\displaystyle b}
the branching factor of a search tree
k ( n , m ) {\displaystyle k(n,m)}
the cost associated with moving from node  n {\displaystyle n} to node  m {\displaystyle m}
g ( n ) {\displaystyle g(n)}
the cost from the root to the node  n {\displaystyle n}
h ( n ) {\displaystyle h(n)}
the heuristic estimate of the distance between the node  n {\displaystyle n} and the goal
s {\displaystyle s}
the start state
t {\displaystyle t}
the goal state (sometimes  g {\displaystyle g} , not to be confused with the function)
d {\displaystyle d}
the current search direction. By convention,  d {\displaystyle d} is equal to 1 for the forward direction and 2 for the backward direction (Kwa 1989)
d ′ {\displaystyle d'}
the opposite search direction (i.e.  d ′ = 3 − d {\displaystyle d'=3-d} )
T R E E d {\displaystyle \mathrm {TREE} _{d}}
the search tree in direction d. If  d = 1 {\displaystyle d=1} , the root is  s {\displaystyle s} , if  d = 2 {\displaystyle d=2} , the root is  t {\displaystyle t}
O P E N d {\displaystyle \mathrm {OPEN} _{d}}
the leaves of  T R E E d {\displaystyle \mathrm {TREE} _{d}} (sometimes referred to as  F R I N G E d {\displaystyle \mathrm {FRINGE} _{d}} ). It is from this set that a node is chosen for expansion. In bidirectional search, these are sometimes called the search 'frontiers' or 'wavefronts', referring to how they appear when a search is represented graphically. In this metaphor, a 'collision' occurs when, during the expansion phase, a node from one wavefront is found to have successors in the opposing wavefront.
C L O S E D d {\displaystyle \mathrm {CLOSED} _{d}}
the non-leaf nodes of  T R E E d {\displaystyle \mathrm {TREE} _{d}} . This set contains the nodes already visited by the search

## Approaches for bidirectional heuristic search[edit]

Bidirectional algorithms can be broadly split into three categories: Front-to-Front, Front-to-Back (or Front-to-End), and Perimeter Search (Kaindl Kainz 1997). These differ by the function used to calculate the heuristic.

### Front-to-back[edit]

Front-to-Back algorithms calculate the  h {\displaystyle h} value of a node  n {\displaystyle n} by using the heuristic estimate between  n {\displaystyle n} and the root of the opposite search tree,  s {\displaystyle s} or  t {\displaystyle t} .

Front-to-Back is the most actively researched of the three categories. The current best algorithm (at least in the Fifteen puzzle domain) is the BiMAX-BS*F algorithm, created by Auer and Kaindl (Auer, Kaindl 2004).

### Front-to-front[edit]

Front-to-Front algorithms calculate the h value of a node n by using the heuristic estimate between n and some subset of  O P E N d ′ {\displaystyle \mathrm {OPEN} _{d'}} . The canonical example is that of the BHFFA (Bidirectional Heuristic Front-to-Front Algorithm),[2] where the h function is defined as the minimum of all heuristic estimates between the current node and the nodes on the opposing front. Or, formally:

h d ( n ) = min i { H ( n , o i ) | o i ∈ O P E N d ′ } {\displaystyle h_{d}(n)=\min _{i}\left\\{H(n,o_{i})|o_{i}\in \mathrm {OPEN} _{d'}\right\\}}

where  H ( n , o ) {\displaystyle H(n,o)} returns an admissible (i.e. not overestimating) heuristic estimate of the distance between nodes n and o.

Front-to-Front suffers from being excessively computationally demanding. Every time a node n is put into the open list, its  f = g + h {\displaystyle f=g+h} value must be calculated. This involves calculating a heuristic estimate from n to every node in the opposing OPEN set, as described above. The OPEN sets increase in size exponentially for all domains with  b > 1.

## References[edit]

1. ^ Efficient Point-to-Point Shortest Path Algorithms
2. ^ de Champeaux 1977/1983

* de Champeaux, Dennis; Sint, Lenie (1977), "An improved bidirectional heuristic search algorithm", Journal of the ACM, 24 (2): 177–191, doi:10.1145/322003.322004.
* de Champeaux, Dennis (1983), "Bidirectional heuristic search again", Journal of the ACM, 30 (1): 22–32, doi:10.1145/322358.322360.
* Pohl, Ira (1971), "Bi-directional Search", in Meltzer, Bernard; Michie, Donald (eds.), Machine Intelligence, vol. 6, Edinburgh University Press, pp. 127–140.
* Russell, Stuart J.; Norvig, Peter (2002), "3.4 Uninformed search strategies", Artificial Intelligence: A Modern Approach (2nd ed.), Prentice Hall.

* v
* t
* e

Graph and tree traversal algorithms

Search|

* α–β pruning
* A*
* IDA*
* LPA*
* SMA*
* Best-first search
* Beam search
* Bidirectional search
* Breadth-first search
* Lexicographic
* Parallel
* B*
* Depth-first search
* Iterative deepening
* D*
* Fringe search
* Jump point search
* Monte Carlo tree search
* SSS*

Shortest path|

* Bellman–Ford
* Dijkstra's
* Floyd–Warshall
* Johnson's
* Shortest path faster
* Yen's

Minimum spanning tree|

* Borůvka's
* Kruskal's
* Prim's
* Reverse-delete

List of graph search algorithms
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template