Bi-Directional and Heuristic Search in Path Problems [Thesis]
- Stanford Univ., CA (United States)
Path finding is a key process in many areas of computation. Optimization problems and heuristic search problems are two notable examples. The first part of this dissertation presents a class of algorithms, denoted VGA, for solving the two point shortest path problem in directed graphs with non-negative edge weights. This class is a bi-directional extension of the most efficient known uni-directional shortest path algorithms. While it has long been realized that hi-directional algorithms often provide computational savings, a theory of this has not been forthcoming until now. This theory shows how a hi-directional method using the proposed cardinality comparison strategy is a priori the best shortest path algorithm within the class of algorithms VGA.
- Research Organization:
- SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)
- Sponsoring Organization:
- US Atomic Energy Commission (AEC); USDOE Office of Science (SC)
- DOE Contract Number:
- AC02-76SF00515
- OSTI ID:
- 1453875
- Report Number(s):
- SLAC-R--104
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Graph Search Heuristic for Shortest Distance Paths
The d-edge shortest-path problem for a Monge graph