A method for the shortest path search by extended Dijkstra algorithm

The Dijkstra method is a well-known algorithm for finding the optimum path in shortest-path search problems. With that method, however, the time required to find the optimum path becomes remarkably long when the search scope is broad, so the Djikstra method is not suitable for real-time problems. In this paper, we propose a method for obtaining, in a short time, a path that is as close as possible to the path obtained by the Dijkstra method (the optimum path). The new method extends the conventional Dijkstra method so as to obtain a solution to a problem given within a specified time, such as path search in a car navigation system. The effectiveness of that extended method is described through use of simulations