Path planning for autonomous driving with dynamic obstacles poses a challenge because it needs to perform a higher-dimensional search (including time) while still meeting real-time constraints. This paper proposes an algorithm-hardware co-optimization approach to accelerate path planning with high-dimensional search space. First, we reduce the time for a nearest neighbor search and collision detection by mapping nodes and obstacles to a lower-dimensional space and memorizing recent search results. Then, we propose a hardware extension for efficient memorization. The experimental results on a modern processor and a cycle-level simulator show that the execution time is reduced significantly.
翻译:具有动态障碍的自主驾驶的路径规划是一个挑战,因为它需要进行更高维的搜索(包括时间),同时仍要面对实时限制。本文建议采用算法硬件共同优化方法,以加速高维搜索空间的路径规划。 首先,我们通过绘制节点和对低维空间的障碍,减少近邻搜索和碰撞探测的时间,并记住最近的搜索结果。 然后,我们提出一个用于高效记忆的硬件扩展。 现代处理器和循环模拟器的实验结果显示,执行时间大大缩短了。