Unified and Efficient Factor Graph Accelerator Design for Robotic Optimization
Despite extensive efforts, existing approaches to design accelerators for optimization-based robotic applications have limitations related to insufficient real-time performance and high energy consumption. Some methods focus on designing general-purpose matrix computation units, but fail to consider specific characteristics of robotic algorithms. Other methods aim at designing dedicated accelerators that achieve excellent performance but suffer from limited flexibility. To balance between general-purpose and specialized designs, this article proposes a hardware accelerator that, through a unified pose representation and factor graph abstraction, can solve nonlinear optimization algorithms for localization, planning, and control on the same piece of circuits. Through carefully designed pipeline, circuit structure optimization, fixed-point arithmetic, and sparse data compression, the accelerator design achieves high performance and high energy efficiency. The experimental results on FPGA demonstrate that compared to state-of-the-art acceleration solutions, our design achieves up to 107.9× speedup, 7.2× energy reduction, while achieving similar accuracy.
Authors
- Yu Bo (ORCID: https://orcid.org/0000-0002-0139-3622)
- Yuhui Hao (ORCID: https://orcid.org/0000-0003-1301-5271)
- Shaoshan Liu (ORCID: https://orcid.org/0000-0002-5132-8351)
- Qiang Liu (ORCID: https://orcid.org/0000-0003-1375-0508)
- Yiming Gan (ORCID: https://orcid.org/0009-0000-2532-6259)
- Yihao Hua
Institutions
- Tianjin University (CN)
- Chinese Academy of Sciences (CN)
- Institute of Computing Technology (CN)
- Institute of Art (PL)
- University of Chinese Academy of Sciences (CN)
Publication Details
- Journal
- ACM Transactions on Architecture and Code Optimization
- Published
- 2025-10-22
- DOI
- https://doi.org/10.1145/3771846
- Primary Topic
- Modular Robots and Swarm Intelligence
- Type
- article
- Field-Weighted Citation Impact
- 0.00