| 書目名稱 | Robotic Exploration and Landmark Determination |
| 副標(biāo)題 | Hardware-Efficient A |
| 編輯 | K. Sridharan,Panakala Rajesh Kumar |
| 視頻video | http://file.papertrans.cn/832/831107/831107.mp4 |
| 概述 | Presents recent research in robotic exploration and landmark determination using hardware-efficient algorithms and.FPGA implementations.Includes supplementary material: |
| 叢書名稱 | Studies in Computational Intelligence |
| 圖書封面 |  |
| 描述 | .Much of the research effort in mobile robots in the recent past has been on sensing and design of time-efficient algorithms for tasks such as localization, mapping and navigation. Mobile robots typically employ an embedded computer for high level computations. As applications of robots expand, there is a need to investigate architecturally efficient choices for this embedded computing platform. In particular, it is valuable to process data to obtain time, space and energy-efficient solutions for various robotic tasks....This book presents hardware-efficient algorithms and FPGA implementations for two robotic tasks, namely exploration and landmark determination. The work identifies scenarios for mobile robotics where parallel processing and selective shutdown offered by FPGAs are invaluable. The book proceeds to systematically develop memory-driven VLSI architectures for both the tasks. The architectures are ported to a low-cost FPGA with a fairly small number of system gates. A robot fabricated with this FPGA on-board serves to validate the efficacy of the approach. Numerous experiments with the robot are reported. . |
| 出版日期 | Book 2008 |
| 關(guān)鍵詞 | FPGA; VLSI; algorithm; algorithms; architecture; mobile robot; navigation; robot; robotics; sensing |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-540-75394-0 |
| isbn_softcover | 978-3-642-09465-1 |
| isbn_ebook | 978-3-540-75394-0Series ISSN 1860-949X Series E-ISSN 1860-9503 |
| issn_series | 1860-949X |
| copyright | Springer-Verlag Berlin Heidelberg 2008 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-22 12:22
發(fā)表于 2025-3-21 19:09:32
