AUV“SLOCUM滑翔机”最优路径规划实用要求的解决方案
Solutions for Practice-oriented Requirements for Optimal Path Planning for the AUV "SLOCUM Glider"
摘要：
本文提出了几个重要的面向实践的要求，最优路径规划的AUV“SLOCUM滑翔机”，以及解决方案，使用快速图为基础的算法。这些算法建立在TVE（时变环境）搜索算法的基础上。该算法的经验，沿纽芬兰和拉布拉多大陆架的实际任务的要求和想法，找到最佳的出发时间的动机，以解决该领域的研究，这是本文所描述的。本文的主要重点是讨论可能的方法来加速路径规划算法，而不会恶化的结果。
英文摘要：
This paper presents a few important practiceoriented requirements for optimal path planning for the AUV "SLOCUM Glider" as well as solutions using fast graph basedalgorithms. These algorithms build upon the TVE (time-varying environment) search algorithm. The experience with this algorithm, requirements of real missions along the Newfoundland and Labrador Shelf and the idea to find the optimal departure time are the motivation to address the field of research, which is described in this paper. The main focus of this paper is a discussion of possible methods to accelerate the path planning algorithm, without deterioration of the results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
