Shortest Paths of Bounded Curvature for the Dubins Interval Problem
Shortest Paths of Bounded Curvature for the Dubins Interval Problem
复制标题
杜宾斯区间问题的有界曲率最短路径
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Eloy García
中科院分区：
文献类型：
--
作者：
S. Manyam;S. Rathinam;D. Casbeer;Eloy García
Dubins间隔问题的目的是找到两个目标之间的有界曲率的最短路径，使得从第一目标的离开角和在第二目标处的到达角被约束到两个相应的间隔。我们提出了一个新的和简单的算法，这个问题的最小值原理的基础上庞特里亚金。
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.