Some Experimental Results of Applying Heuristic Search to Route Finding
John D. Pearson, Hans W. Guesgen · The Florida AI Research Society · 1998
Search is often used to find shortest routes within real road networks. Standard search algorithms are memory intensive and inefficient for stand alone in-car systems. In this paper, we evaluate a number of heuristic search strategies in terms of space and time complexity for the route finding problem.