Efficient Computation of Map-scale Continuous Mutual Information on Chip in Real Time
Keshav Gupta, Peter Zhi Xuan Li, Sertac Karaman, Vivienne Sze

TL;DR
This paper presents a specialized FPGA hardware architecture that enables real-time, energy-efficient computation of mutual information across large maps, significantly outperforming traditional GPU and CPU methods for robotic exploration tasks.
Contribution
The authors introduce a novel FPGA-based accelerator architecture for fast, low-energy mutual information computation on large maps, optimized for robotic exploration applications.
Findings
Computes MI for a 201x201 grid in 1.55 ms
Consumes only 1.7 mJ per map computation
Outperforms GPU and CPU implementations by two to three orders of magnitude
Abstract
Exploration tasks are essential to many emerging robotics applications, ranging from search and rescue to space exploration. The planning problem for exploration requires determining the best locations for future measurements that will enhance the fidelity of the map, for example, by reducing its total entropy. A widely-studied technique involves computing the Mutual Information (MI) between the current map and future measurements, and utilizing this MI metric to decide the locations for future measurements. However, computing MI for reasonably-sized maps is slow and power hungry, which has been a bottleneck towards fast and efficient robotic exploration. In this paper, we introduce a new hardware accelerator architecture for MI computation that features a low-latency, energy-efficient MI compute core and an optimized memory subsystem that provides sufficient bandwidth to keep the cores…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
