This section covers two other general templates for search algorithms. The first one is simply a ``backward'' version of the tree search algorithm in Figure 2.4. The second one is a bidirectional approach that grows two search trees, one from the initial state and one from a goal state.

Steven M LaValle 2012-04-20