期刊
JOURNAL OF SYSTEMS ARCHITECTURE
卷 93, 期 -, 页码 33-39出版社
ELSEVIER
DOI: 10.1016/j.sysarc.2018.12.009
关键词
Autonomous driving; FPGA Accelerator; Game theory; Lemke-Howson; Edge computing
资金
- National Key Research & Development Program of China [2016YFE0100600]
- National Natural Science Foundation of China project [U1831118]
For autonomous driving area, the communication among autonomous vehicles is quite frequent and inevitable to perceive the surrounding environment. Massive data needs to be processed in time on the edge to control vehicles to make suitable strategies. For a group of vehicles, collaborative strategies are necessary to avoid unintentional congestions. However, less attention is paid to competition and cooperation between vehicle groups. In this paper, we explore the possibility of adopting game theory for decision making to obtain win-win between autonomous vehicles. The Lemke-Howson algorithm in game theory is the best known combinatorial algorithm that computes a Nash equilibrium of a bimatrix game. More importantly, we implement the Lemke-Howson algorithm on FPGA to accelerate the computation process. We explain the design challenges of solving the performance bottleneck and how to make optimizations. We implement the Lemke-Howson accelerator on a KCU116 board and obtain a speedup of about 2.4 times versus that running on a CPU.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据