東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis./
作者:	Lin, Szu-Wei.
面頁冊數:	1 online resource (64 pages)
附註:	Source: Masters Abstracts International, Volume: 85-01.
Contained By:	Masters Abstracts International85-01.
標題:	Lasers. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30511409click for full text (PQDT)
ISBN:	9798379869014

Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis.
Lin, Szu-Wei.

Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis. - 1 online resource (64 pages)

Source: Masters Abstracts International, Volume: 85-01.

Thesis (M.Sc.)--Brigham Young University, 2023.

Includes bibliographical references

Robotic systems are known to be computationally intensive. To improve performance, developers tend to implement custom robotic algorithms in hardware. However, a full robotic system typically consists of many interconnected algorithmic components that can easily max-out FPGA resources, thus requiring the designer to adjust each algorithm design for each new robotic systems in order to meet specific systems requirements and limited resources. Furthermore, manual development of digital circuitry using a hardware description language (HDL) such as verilog or VHDL, is error-prone, time consuming, and often takes months or years to develop and verify. Recent developments in high-level synthesis (HLS), enable automatic generation of digital circuit designs from high-level languages such as C or C++. In this thesis, we propose to develop a database of HLS-generated pareto-optimal hardware designs for various robotic algorithms, such that a fully automated process can optimally compose a complete robotic system given a set of system requirements.In the first part of this thesis, we take a first step towards this goal by developing a system for automatic selection of an Occupancy Grid Mapping (OGM) implementation given specific system requirements and resource thresholds. We first generate hundreds of possible hardware designs via Vitis HLS as we vary parameters to explore the designs space. We then present results which evaluate and explore trade-offs of these designs with respect to accuracy, latency, resource utilization, and power. Using these results, we create a software tool which is able to automatically select an optimal OGM implementation. After implementing selected designs on a PYNQ-Z2 FPGA board, our results show that the runtime of the algorithm improves by 35x over a C++- based implementation. In the second part of this thesis, we extend these same techniques to the Particle Filter (PF) algorithm by implementing 7 different resampling methods and varying parameters on hardware, again via HLS. In this case, we are able to explore and analyze thousands of PF designs. Our evaluation results show that runtime of the algorithm using Local Selection Resampling method reaches the fastest performance on an FPGA and can be as much as 10x faster than in C++. Finally, we build another design selection tool that automatically generates an optimal PF implementation from this design space for a given query set of requirements.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798379869014Subjects--Topical Terms:

535503
Lasers.
Index Terms--Genre/Form:

542853
Electronic books.

Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis.
LDR:03807nmm a2200409K 4500 001 2360123
005 20230925052830.5
006 m o d
007 cr mn ---uuuuu
008 241011s2023 xx obm 000 0 eng d
020 $a 9798379869014
035 $a (MiAaPQ)AAI30511409
035 $a (MiAaPQ)BrighamYoung10860
035 $a AAI30511409
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Lin, Szu-Wei. $3 3700735
245 1 0 $a Toward Automatically Composed FPGA-Optimiz Robotic Systems Using High-Level Synthesis.
264 0 $c 2023
300 $a 1 online resource (64 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 85-01.
500 $a Advisor: Mangelson, Joshua.
502 $a Thesis (M.Sc.)--Brigham Young University, 2023.
504 $a Includes bibliographical references
520 $a Robotic systems are known to be computationally intensive. To improve performance, developers tend to implement custom robotic algorithms in hardware. However, a full robotic system typically consists of many interconnected algorithmic components that can easily max-out FPGA resources, thus requiring the designer to adjust each algorithm design for each new robotic systems in order to meet specific systems requirements and limited resources. Furthermore, manual development of digital circuitry using a hardware description language (HDL) such as verilog or VHDL, is error-prone, time consuming, and often takes months or years to develop and verify. Recent developments in high-level synthesis (HLS), enable automatic generation of digital circuit designs from high-level languages such as C or C++. In this thesis, we propose to develop a database of HLS-generated pareto-optimal hardware designs for various robotic algorithms, such that a fully automated process can optimally compose a complete robotic system given a set of system requirements.In the first part of this thesis, we take a first step towards this goal by developing a system for automatic selection of an Occupancy Grid Mapping (OGM) implementation given specific system requirements and resource thresholds. We first generate hundreds of possible hardware designs via Vitis HLS as we vary parameters to explore the designs space. We then present results which evaluate and explore trade-offs of these designs with respect to accuracy, latency, resource utilization, and power. Using these results, we create a software tool which is able to automatically select an optimal OGM implementation. After implementing selected designs on a PYNQ-Z2 FPGA board, our results show that the runtime of the algorithm improves by 35x over a C++- based implementation. In the second part of this thesis, we extend these same techniques to the Particle Filter (PF) algorithm by implementing 7 different resampling methods and varying parameters on hardware, again via HLS. In this case, we are able to explore and analyze thousands of PF designs. Our evaluation results show that runtime of the algorithm using Local Selection Resampling method reaches the fastest performance on an FPGA and can be as much as 10x faster than in C++. Finally, we build another design selection tool that automatically generates an optimal PF implementation from this design space for a given query set of requirements.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Lasers. $3 535503
650 4 $a Optimization techniques. $3 3681622
650 4 $a Sensors. $3 3549539
650 4 $a Robots. $3 529507
650 4 $a Mapping. $3 3355992
650 4 $a Mathematical functions. $3 3564295
650 4 $a Unmanned aerial vehicles. $3 3560267
650 4 $a Design. $3 518875
650 4 $a Software upgrading. $3 3680542
650 4 $a Field programmable gate arrays. $3 666370
650 4 $a Designers. $3 589292
650 4 $a Robotics. $3 519753
650 4 $a Vehicles. $3 2145288
650 4 $a Aerospace engineering. $3 1002622
650 4 $a Computer engineering. $3 621879
650 4 $a Computer science. $3 523869
650 4 $a Mathematics. $3 515831
650 4 $a Optics. $3 517925
650 4 $a Transportation. $3 555912
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0771
690 $a 0389
690 $a 0538
690 $a 0464
690 $a 0984
690 $a 0405
690 $a 0752
690 $a 0709
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Brigham Young University. $3 1017451
773 0 $t Masters Abstracts International $g 85-01.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30511409 $z click for full text (PQDT)