経路計画arXiv:1507.06980
ドゥビン区間問題における有界曲率の最短経路
Shortest Paths of Bounded Curvature for the Dubins Interval Problem
出発角と到着角がそれぞれ区間で制約された2点間の有界曲率最短経路を求めるドゥビン区間問題に対し、ポントリャーギンの最小原理に基づく簡潔な新アルゴリズムを提案した。
著者: Satyanarayana Manyam, Sivakumar Rathinam, David Casbeer, Eloy Garcia
分類: math.OC, cs.RO
原文アブストラクト
The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the second target are constrained to two respective intervals. We propose a new and a simple algorithm to this problem based on the minimum principle of Pontryagin.
