An efficient hardware architecture of the A-star algorithm for the shortest path search engine

Woo Jin Seo; Seung Ho Ok; Jin Ho Ahn; Sungho Kang; Byungin Moon

doi:10.1109/NCM.2009.371

An efficient hardware architecture of the A-star algorithm for the shortest path search engine

Woo Jin Seo, Seung Ho Ok, Jin Ho Ahn, Sungho Kang, Byungin Moon

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

14 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC
Pages	1499-1502
Number of pages	4
DOIs	https://doi.org/10.1109/NCM.2009.371
Publication status	Published - 2009
Event	NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications - Seoul, Korea, Republic of Duration: 2009 Aug 25 → 2009 Aug 27

Publication series

Name	NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC

Other

Other	NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications
Country	Korea, Republic of
City	Seoul
Period	09/8/25 → 09/8/27

All Science Journal Classification (ASJC) codes

Computer Graphics and Computer-Aided Design
Computer Science Applications
Software

Access to Document

10.1109/NCM.2009.371

Fingerprint Dive into the research topics of 'An efficient hardware architecture of the A-star algorithm for the shortest path search engine'. Together they form a unique fingerprint.

Cite this

Seo, W. J., Ok, S. H., Ahn, J. H., Kang, S., & Moon, B. (2009). An efficient hardware architecture of the A-star algorithm for the shortest path search engine. In NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC (pp. 1499-1502). [5331336] (NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC). https://doi.org/10.1109/NCM.2009.371

@inproceedings{872ad0ece1ec4d3fb1482edc7a8f91d5,

title = "An efficient hardware architecture of the A-star algorithm for the shortest path search engine",

abstract = "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.",

author = "Seo, {Woo Jin} and Ok, {Seung Ho} and Ahn, {Jin Ho} and Sungho Kang and Byungin Moon",

year = "2009",

doi = "10.1109/NCM.2009.371",

language = "English",

isbn = "9780769537696",

series = "NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC",

pages = "1499--1502",

booktitle = "NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC",

note = "NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications ; Conference date: 25-08-2009 Through 27-08-2009",

}

Seo, WJ, Ok, SH, Ahn, JH, Kang, S & Moon, B 2009, An efficient hardware architecture of the A-star algorithm for the shortest path search engine. in NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC., 5331336, NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC, pp. 1499-1502, NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications, Seoul, Korea, Republic of, 09/8/25. https://doi.org/10.1109/NCM.2009.371

An efficient hardware architecture of the A-star algorithm for the shortest path search engine. / Seo, Woo Jin; Ok, Seung Ho; Ahn, Jin Ho; Kang, Sungho; Moon, Byungin.

NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC. 2009. p. 1499-1502 5331336 (NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An efficient hardware architecture of the A-star algorithm for the shortest path search engine

AU - Seo, Woo Jin

AU - Ok, Seung Ho

AU - Ahn, Jin Ho

AU - Kang, Sungho

AU - Moon, Byungin

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=73649130645&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73649130645&partnerID=8YFLogxK

U2 - 10.1109/NCM.2009.371

DO - 10.1109/NCM.2009.371

M3 - Conference contribution

AN - SCOPUS:73649130645

SN - 9780769537696

T3 - NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC

SP - 1499

EP - 1502

BT - NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC

T2 - NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications

Y2 - 25 August 2009 through 27 August 2009

ER -