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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Journal of Reconfigurable Computing Ročník 2020; číslo 2020; s. 1 - 11
Hlavní autoři: Zhou, Yuzhi, Wang, Tianqi, Jin, Xi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Publishing Corporation 2020
Hindawi
John Wiley & Sons, Inc
Wiley
Témata:
Algorithms
Digital integrated circuits
Field programmable gate arrays
Hardware
Heuristic
Mathematical analysis
Path planning
Performance enhancement
Real time
Robotics
Semiconductor industry
Software
System on chip
Technology application
United States
ISSN:1687-7195, 1687-7209
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-7195
1687-7209
DOI:10.1155/2020/8896386