3点を通る最短Dubins経路の効率的計算
On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points
曲率制約付き前方移動Dubins車両が3つの連続点を通る最適経路を、中間点の向きを幾何学的に解析して高速に求める手法を提案し、Dubins TSPツアーの改善に応用した。
著者: Armin Sadeghi, Stephen L. Smith
分類: eess.SY, cs.RO, cs.SY, math.OC
原文アブストラクト
In this paper, we address the problem of computing optimal paths through three consecutive points for the curvature-constrained forward moving Dubins vehicle. Given initial and final configurations of the Dubins vehicle, and a midpoint with an unconstrained heading, the objective is to compute the midpoint heading that minimizes the total Dubins path length. We provide a novel geometrical analysis of the optimal path, and establish new properties of the optimal Dubins' path through three points. We then show how our method can be used to quickly refine Dubins TSP tours produced using state-of-the-art techniques. We also provide extensive simulation results showing the improvement of the proposed approach in both runtime and solution quality over the conventional method of uniform discretization of the heading at the mid-point, followed by solving the minimum Dubins path for each discrete heading.
