关于Dubins旅行商最优解的紧界
On Tightly Bounding the Dubins Traveling Salesman's Optimum
摘要：
Dubins流动推销员问题（DTSP）在过去的十年中产生了巨大的兴趣，由于其发生在一些民用和军事监视应用。目前，还没有算法可以找到一个最优解的问题。此外，放松运动约束和解决所产生的欧几里德TSP（ETSP）提供了唯一的下界可用于该问题。然而，在许多问题的情况下，通过求解ETSP计算出的下界远低于通过一些已知的DTSP算法获得的可行解的成本。本文解决了这个基本问题，并提出了第一个系统的程序开发紧下界的DTSP。
英文摘要：
The Dubins Traveling Salesman Problem (DTSP) has generated significant interest over the last decade due to its occurrence in several civil and military surveillance applications. Currently, there is no algorithm that can find an optimal solution to the problem. In addition, relaxing the motion constraints and solving the resulting Euclidean TSP (ETSP) provides the only lower bound available for the problem. However, in many problem instances, the lower bound computed by solving the ETSP is far below the cost of the feasible solutions obtained by some well-known algorithms for the DTSP. This article addresses this fundamental issue and presents the first systematic procedure for developing tight lower bounds for the DTSP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
