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 | |
| Publication status | Published - 2009 Dec 1 |
| 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 |
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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Graphics and Computer-Aided Design
- Computer Science Applications
- Software
Cite this
}
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.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/12/1
Y1 - 2009/12/1
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
SP - 1499
EP - 1502
BT - NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC
ER -