FPGA Implementation of A ∗ Algorithm for Real-Time Path Planning

11Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The traditional A∗ algorithm is time-consuming due to a large number of iteration operations to calculate the evaluation function and sort the OPEN list. To achieve real-time path-planning performance, a hardware accelerator's architecture called A∗ accelerator has been designed and implemented in field programmable gate array (FPGA). The specially designed 8-port cache and OPEN list array are introduced to tackle the calculation bottleneck. The system-on-a-chip (SOC) design is implemented in Xilinx Kintex-7 FPGA to evaluate A∗ accelerator. Experiments show that the hardware accelerator achieves 37-75 times performance enhancement relative to software implementation. It is suitable for real-time path-planning applications.

Cite

CITATION STYLE

APA

Zhou, Y., Jin, X., & Wang, T. (2020). FPGA Implementation of A ∗ Algorithm for Real-Time Path Planning. International Journal of Reconfigurable Computing, 2020. https://doi.org/10.1155/2020/8896386

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free