多水下滑翔机海洋采样路径规划

Path Planning of Multiple Underwater Gliders for Ocean Sampling

  • 摘要: 提出了以时间为优化准则的多水下滑翔机海洋采样路径规划算法.首先,根据水下滑翔机的个数,通过空间聚类算法, 把多水下滑翔机的路径规划问题转化为单水下滑翔机的路径规划问题;然后,利用2步CLK(chained Lin-Kernighan)算法,优化每一个采样子空间中的采样路径; 设计了扩散算法,调节各个采样子空间的采样点,使得完成整个采样任务需要的时间最短;最后,以Sea-wing水下滑翔机为例,对上述方法进行了仿真验证, 结果显示所提出的方法能够有效地降低采样作业的采样时间.

     

    Abstract: An approach to path planning of the multiple underwater gliders for ocean sampling is presented based on the optimization criterion of sampling time. Firstly, according to the number of the gliders, the path planning problem of the multiple underwater gliders is transformed into a single glider path planning problem by the spatial clustering algorithm. Secondly, the two-step CLK (chained Lin-Kernighan) algorithm is applied to optimizing the sampling path in each sampling subspace. A diffusion algorithm is designed to adjust the sampling points among the sampling subspaces, which minimizes the sampling time of the whole sampling mission. Finally, taking the Sea-wing underwater glider as an example, the simulation experiments are carried out to verify the proposed methods. The results show that the methods can efficiently reduce the sampling time spent on the sampling task.

     

/

返回文章
返回