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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations

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 languageEnglish
Title of host publicationNCM 2009 - 5th International Joint Conference on INC, IMS, and IDC
Pages1499-1502
Number of pages4
DOIs
StatePublished - 2009
EventNCM 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: 25 Aug 200927 Aug 2009

Publication series

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

Conference

ConferenceNCM 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/TerritoryKorea, Republic of
CitySeoul
Period25/08/0927/08/09

Keywords

  • A-star algorithm
  • Priority queue
  • Shift register
  • Shortest-path search algorithm
  • Sorting

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