G¹連続かつ曲率有界な高速最短経路ポリライン平滑化
Fast Shortest Path Polyline Smoothing With $G^1$ Continuity and Bounded Curvature
曲率制約のある車両の動作計画において、ポリラインをG¹連続で最短長、かつ衝突回避を保証する高速な平滑化手法を提案し、従来手法より計算時間と経路長で優れることを示した。
著者: Patrick Pastorelli, Simone Dagnino, Enrico Saccon, Marco Frego, Luigi Palopoli
分類: cs.RO
原文アブストラクト
In this work, we propose a novel and efficient method for smoothing polylines in motion planning tasks. The algorithm applies to motion planning of vehicles with bounded curvature. In the paper, we show that the generated path: 1) has minimal length, 2) is $G^1$ continuous, and 3) is collision-free by construction, if the hypotheses are respected. We compare our solution with the state-of.the-art and show its convenience both in terms of computation time and of length of the compute path.
