By Topic

A method for the shortest path search by extended Dijkstra algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Noto, M. ; Kanagawa Univ., Yokohama, Japan ; Sato, H.

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

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:3 )

Date of Conference:

2000