This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Fifth International Joint Conference on INC, IMS and IDC
An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine
Seoul, Korea
August 25-August 27
ISBN: 978-0-7695-3769-6
ASCII Text
x 
 
Woo-Jin Seo, Seung-Ho Ok, Jin-Ho Ahn, Sungho Kang, Byungin Moon, "An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine," Networked Computing and Advanced Information Management, International Conference on, pp. 1499-1502, 2009 Fifth International Joint Conference on INC, IMS and IDC, 2009.
 
 
BibTex
x
 
@article{ 10.1109/NCM.2009.371,
author = {Woo-Jin Seo and Seung-Ho Ok and Jin-Ho Ahn and Sungho Kang and Byungin Moon},
title = {An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine},
journal ={Networked Computing and Advanced Information Management, International Conference on},
volume = {0},
year = {2009},
isbn = {978-0-7695-3769-6},
pages = {1499-1502},
doi = {http://doi.ieeecomputersociety.org/10.1109/NCM.2009.371},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Networked Computing and Advanced Information Management, International Conference on
TI - An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine
SN - 978-0-7695-3769-6
SP1499
EP1502
A1 - Woo-Jin Seo,
A1 - Seung-Ho Ok,
A1 - Jin-Ho Ahn,
A1 - Sungho Kang,
A1 - Byungin Moon,
PY - 2009
KW - shortest-path search algorithm
KW - A-star algorithm
KW - shift register
KW - priority queue
KW - sorting
VL - 0
JA - Networked Computing and Advanced Information Management, International Conference on
ER -
 
There are several shortest-path search algorithms such as A-star, D-star and Dijkstra. These algorithms are widely used in automotive vehicles and mobile navigation systems. As the number of nodes is increased considerably, the shortest-path algorithms implemented in software produce heavily computational overhead. In this paper, in order to avoid computational overhead, we propose a hardware model of the A-star algorithm for the shortest-path search engine. Especially, we propose shift register based on efficient hardware model and show simulation results in comparison with previous works.
Index Terms:
shortest-path search algorithm, A-star algorithm, shift register, priority queue, sorting
Citation:
Woo-Jin Seo, Seung-Ho Ok, Jin-Ho Ahn, Sungho Kang, Byungin Moon, "An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine," ncm, pp.1499-1502, 2009 Fifth International Joint Conference on INC, IMS and IDC, 2009
Usage of this product signifies your acceptance of the Terms of Use.