マルチモデル分岐と許容ヒューリスティックを用いた自動運転車のグラフベース動作計画
Graph-based Motion Planning for Automated Vehicles using Multi-model Branching and Admissible Heuristics
都市部の自動運転向けに、グラフ探索中から快適で安全な軌道を生成するため、分岐戦略と許容ヒューリスティックで探索を効率化し最適性を保つ手法を提案した。
著者: Oliver Speidel, Jona Ruof, Klaus Dietmayer
分類: cs.RO
原文アブストラクト
Automated driving in urban scenarios requires efficient planning algorithms able to handle complex situations in real-time. A popular approach is to use graph-based planning methods in order to obtain a rough trajectory which is subsequently optimized. A key aspect is the generation of trajectories implementing comfortable and safe behavior already during graph-search while keeping computation times low. To capture this aspect, on the one hand, a branching strategy is presented in this work that leads to better performance in terms of quality of resulting trajectories and runtime. On the other hand, admissible heuristics are shown which guide the graph-search efficiently, where the solution remains optimal.
