An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem

  • Authors:

  • Kazuaki Yamaguchi;Sumio Masuda

  • Affiliations:

  • The authors are with the Department of Electrical and Electronics Engineering, Kobe University, Kobe-shi, 657-8501 Japan. E-mail: ky@m.ieice.org, E-mail: masuda@kobe-u.ac.jp;The authors are with the Department of Electrical and Electronics Engineering, Kobe University, Kobe-shi, 657-8501 Japan. E-mail: ky@m.ieice.org, E-mail: masuda@kobe-u.ac.jp

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The 2-terminal shortest path problem is to find a shortest path between two specified vertices in a given graph G. In this paper, we consider this problem in the following situation: G is given before the two vertices are specified so that some preprocessing is allowed to reduce the response time. We present a method for calculating lower bounds of the length of the shortest path for any pair of vertices. Experimental results show that the A* algorithm with our method performs much better than previous methods.