Highly paralellizable route planner based on cellular automata algorithms
P. Stiles, Ira Glickstein · IBM Journal of Research and Development · 1994
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.