Key points are not available for this paper at this time.
An overview is presented of our work on a highly parallelizable route planner that efficiently finds an optimal route between two points; both serial and massively parallel implementations are described. We compare the advantages and disadvantages of the associated search algorithm relative to other search algorithms, and conclude with a discussion of future extensions and related applications.
Stiles et al. (1994) studied this question.