arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.09265math.OC
收藏

关于圆的Dubins路

On Dubins Paths to a Circle

Zheng Chen

摘要:

本文研究了Dubins车辆从一个给定航向角的位置到一个目标圆的最短路径问题,其最终航向与目标圆相切。这种最短路径非常重要,因为它通常在现实世界的场景中需要,例如拍摄禁区的快照或在地面传感器上方徘徊以在最短时间内通过固定翼无人驾驶飞行器收集数据。应用庞特里亚金的最大值原理,在不考虑最小转弯半径与目标圆半径之间关系的前提下,建立了最短路径的若干几何性质,证明了最短路径必定存在于一个由12种类型组成的充分族中.通过使用这些几何性质,设计了每种类型的解析解,以便可以在恒定时间内计算出每种类型的长度。此外,一些性质依赖于问题的参数,使最短路径可以计算没有检查所有的12种类型。最后,通过数值模拟,验证了本文的研究成果。

英文摘要:

This paper is concerned with characterizing the shortest path of a Dubins vehicle from a position with a prescribed heading angle to a target circle with the final heading tangential to the target circle. Such a shortest path is of significant importance as it is usually required in real-world scenarios, such as taking a snapshot of a forbidden region or loitering above a ground sensor to collect data by a fixed-wing unmanned aerial vehicle in a minimum time. By applying Pontryagin's maximum principle, some geometric properties for the shortest path are established {without considering any assumption on the relationship between the minimum turning radius and radius of the target circle}, showing that the shortest path must lie in a sufficient family of 12 types. By employing those geometric properties, the analytical solution to each type is devised so that the length of each type can be computed in a constant time. In addition, some properties depending on problem parameters are found so that the shortest path can be computed without checking all the 12 types. Finally, some numerical simulations are presented, illustrating and validating the developments of the paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑