期刊
AUTONOMOUS ROBOTS
卷 44, 期 7, 页码 1359-1376出版社
SPRINGER
DOI: 10.1007/s10514-020-09932-x
关键词
Dubins vehicle; Multi-goal planning; Generalized Dubins Interval Problem; Dubins Touring Regions Problem
资金
- Czech Science Foundation [19-20238S]
The Generalized Dubins Interval Problem (GDIP) stands to determine the minimal length path connecting two disk-shaped regions where the departure and terminal headings of Dubins vehicle are within the specified angle intervals. The GDIP is a generalization of the existing point-to-point planning problem for Dubins vehicle with a single heading angle per particular location that can be solved optimally using closed-form expression. For the GDIP, both the heading angles and locations need to be chosen from continuous sets which makes the problem challenging because of infinite possibilities how to connect the regions by Dubins path. We provide the optimal solution of the introduced GDIP based on detailed problem analysis. Moreover, we propose to employ the GDIP to provide the first tight lower bound for the Dubins Touring Regions Problem which stands to find the shortest curvature-constrained path through a set of regions in the prescribed order.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据