A 1.5-μJ/Task Path-Planning Processor for 2-D/3-D Autonomous Navigation of Microrobots

被引:9
作者
Chung, Chieh [1 ]
Yang, Chia-Hsiang [1 ,2 ]
机构
[1] Natl Taiwan Univ, Grad Inst Elect Engn, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Dept Elect Engn, Taipei 10617, Taiwan
关键词
Autonomous navigation; digital integrated circuits; microrobot; path planning; rapidly exploring random tree (RRT);
D O I
10.1109/JSSC.2020.3037138
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Autonomous microrobots have been utilized in a wide range of applications. Energy-efficient, real-time path planning for navigation is essential. This work presents a pathplanning processor for 2-D/3-D autonomous navigation. Energy and latency are minimized through algorithm-architecture optimization. The processor utilizes the rapidly exploring random tree (RRT) algorithm to ensure efficient planning on maps that have higher dimensions and a higher resolution. Dual-tree planning, branch extension, and parallel expansion are adopted in order to reduce both computational complexity and memory requirements. A prune-and-reuse strategy is also adopted so as to quickly respond to dynamic scenarios. An array of processing engines (PEs) is deployed in order to enable parallel expansion. The number of PEs is minimized through latency analysis. Low-complexity implementation for the PE is proposed while maintaining a high performance. Fabricated in a 40-nm CMOS technology, the chip integrates 2M logic gates in an area of 3.65 mm2. The processor supports path-planning tasks for both 2-D and 3-D maps, with latencies of less than 1 and 10 ms, respectively. For a 2-D map that has 100 x 100 grids, the proposed processor dissipates 1.5 mu/task at a clock frequency of 200 MHz from a 0.9-V supply. Compared with the state-of-the-art designs, the proposed path-planning processor achieves a 1467x shorter processing latency based on an energy dissipation that is 2133x lower, despite the capability for larger maps.
引用
收藏
页码:112 / 122
页数:11
相关论文
共 34 条
[1]  
Agmon N, 2011, J ARTIF INTELL RES, V42, P887
[2]  
[Anonymous], 2006, Planning Algorithms
[3]   Autonomy for Mars Rovers: Past, Present, and Future [J].
Bajracharya, Max ;
Maimone, Mark W. ;
Helmick, Daniel .
COMPUTER, 2008, 41 (12) :44-+
[4]  
Bialkowski J, 2011, IEEE INT C INT ROBOT, P3513, DOI 10.1109/IROS.2011.6048813
[5]   Mobile hospital robots cure numerous logistic needs [J].
Bloss, Richard .
INDUSTRIAL ROBOT-AN INTERNATIONAL JOURNAL, 2011, 38 (06) :567-571
[6]  
Bruce J, 2002, 2002 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-3, PROCEEDINGS, P2383, DOI 10.1109/IRDS.2002.1041624
[7]  
Chung CE, 2020, ISSCC DIG TECH PAP I, P324
[8]  
Devaurs D, 2011, IEEE INT CONF ROBOT, P2261
[9]   Replanning with RRTs [J].
Ferguson, Dave ;
Kalra, Nidhi ;
Stentz, Anthony .
2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10, 2006, :1243-1248
[10]   Lazy reconfiguration forest (LRF) - An approach for motion planning with multiple tasks in dynamic environments [J].
Gayle, Russell ;
Klingler, Kristopher R. ;
Xavier, Patrick G. .
PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-10, 2007, :1316-+