基于飞蛾火焰算法的AUV三维全局路径规划
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP249

基金项目:

江苏省研究生科研与实践创新计划项目(KYCX19_1694)


Three-dimension global path planning for AUV based on moth-flame algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对存在静态地形障碍和不规则海流的复杂海洋环境下的自主水下航行器(autonomous underwater vehicle,AUV)全局路径规划问题,采用飞蛾火焰优化(moth-flame optimization,MFO)算法搜索获得能耗最优的无碰路径。首先,将搜索空间栅格化后随机生成一组满足避碰需求的初始路径作为初始飞蛾种群;然后,根据MFO算法更新飞蛾位置,实现AUV路径的自主规划;最后,结合AUV巡航能耗模型和静态海流分布模型作为适应度函数,迭代搜索得到最优路径。为验证方法的有效性和优越性,进行了一系列仿真试验。试验结果显示,该算法在AUV全局自主路径规划中的规划效果相较于传统蚁群算法的规划结果具有明显优势,所得路径平滑,且在不同环境中均表现出极佳的全局收敛能力。

    Abstract:

    To solve the global path planning for autonomous underwater vehicles (AUV) in complex underwater environment with static seabed terrain obstacles and irregular ocean currents, the moth-flame optimization (MFO) algorithm was conducted to get the optimum energy comsumption path based on obstacle avoidance. First, a set of initial paths that meet the requirements of collision avoidance as the initial moth population were randomly generated after the search space was rasterized. Then, the moth position was updated using the MFO algorithm, and autonomous path planning for AUV was realized . At last, cruise energy consumption model for AUV is combined static current distribution model as a cost function to obtainthe final path through iterative searching. A series of simulation experiments were carried out to verify the effectiveness and superiority of the method. The experimental results show that the proposed algorithm has obvious advantages over the traditional ant colony algorithm in global autonomous path planning for AUV. The resulting path is smooth, and it shows excellent global convergence ability in different environments.

    参考文献
    相似文献
    引证文献
引用本文

徐炜翔,朱志宇.基于飞蛾火焰算法的AUV三维全局路径规划[J].上海理工大学学报,2021,43(2):148-155.

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2020-04-07
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2021-05-08
  • 出版日期:
文章二维码