arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04868cs.RO
收藏

基于搜索的自动驾驶最优运动规划

Search-based optimal motion planning for automated driving

Delft University of Technology(代尔夫特理工大学);Graz University of Technology(格拉茨工业大学)

Zlatan Ajanovic, Bakir Lacevic, Barys Shyrokau, Michael Stolz, Martin Horn

摘要:

本文提出了一种快速和强大的运动规划,旨在促进自动驾驶的框架。该框架允许实时计算,即使是几百米的视野,从而实现在城市条件下的自动驾驶。这是通过几个功能来实现的。首先,一个方便的几何表示的搜索空间和驾驶约束,使经典的路径规划方法的使用。因此,可以同时处理各种各样的约束(其他车辆、交通灯等)。其次,一个精确的成本去地图,通过解决一个放松的问题,然后使用基于A* 的算法与模型预测味,以计算最佳的运动轨迹。该算法同时考虑了距离和时间范围。该方法是在一个模拟研究与现实的交通场景进行验证。我们证明了该算法的能力,制定计划,在快速和缓慢的驾驶条件下,即使是完全停止是必需的。

英文摘要:

This paper presents a framework for fast and robust motion planning designed to facilitate automated driving. The framework allows for real-time computation even for horizons of several hundred meters and thus enabling automated driving in urban conditions. This is achieved through several features. Firstly, a convenient geometrical representation of both the search space and driving constraints enables the use of classical path planning approach. Thus, a wide variety of constraints can be tackled simultaneously (other vehicles, traffic lights, etc.). Secondly, an exact cost-to-go map, obtained by solving a relaxed problem, is then used by A*-based algorithm with model predictive flavour in order to compute the optimal motion trajectory. The algorithm takes into account both distance and time horizons. The approach is validated within a simulation study with realistic traffic scenarios. We demonstrate the capability of the algorithm to devise plans both in fast and slow driving conditions, even when full stop is required.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑