arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1604.05064cs.ROcs.SYeess.SY
收藏

一种短路径问题的近似算法

An Approximation Algorithm for a Shortest Dubins Path Problem

Associate Professor Department of Mechanical Engineering Texas A \& M University College station, Texas, U.S.A, 77843;Professor Department of Electrical;Computer Engineering University of Florida Gainesville, Florida, U.S.A., 32611

Sivakumar Rathinam, Pramod Khargonekar

AI总结:

本文提出了一种改进的近似算法,将短路径问题的解的质量保证从3.04降低到2.04,通过实验证明了该方法的有效性。

摘要:

在车辆必须遵循运动约束的情况下,寻找访问给定目标点序列的最短路径是一个重要的问题,出现在多个无人 aerial 车辆的监控和监视应用中。目前尚无算法能找到最优解,因此具有解质量保证的启发式方法很有用。当任意两个相邻目标点之间的距离至少等于车辆最小半径的两倍时,现有的最佳近似算法保证为3.04。本文提供了一种新的近似算法,将此保证提高到2.04。开发的算法还对涉及最多30个点的数百个典型实例进行了实现,以验证所提出方法的性能。

英文摘要:

The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications involving unmanned aerial vehicles. There is currently no algorithm that can find an optimal solution to this problem. Therefore, heuristics that can find approximate solutions with guarantees on the quality of the solutions are useful. The best approximation algorithm currently available for the case when the distance between any two adjacent target points in the sequence is at least equal to twice the minimum radius of the vehicle has a guarantee of 3.04. This article provides a new approximation algorithm which improves this guarantee to 2.04. The developed algorithm is also implemented for hundreds of typical instances involving at most 30 points to corroborate the performance of the proposed approach.

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

↑