欢迎访问《兵工学报》官方网站,今天是 分享到:

兵工学报 ›› 2020, Vol. 41 ›› Issue (4): 750-762.doi: 10.3969/j.issn.1000-1093.2020.04.014

• 论文 • 上一篇    下一篇

自主水下航行器多终点航路规划的距离正则化混合水平集算法研究

盛亮1,2, 邱志明3, 于邵祯3, 焦俊杰4   

  1. (1.海军航空大学 航空基础学院, 山东 烟台 264001;2.海军工程大学 兵器工程学院, 湖北 武汉 430033;3.海军研究院, 北京 102442;4.南京理工大学 机械工程学院, 江苏 南京 210094)
  • 收稿日期:2019-06-12 修回日期:2019-06-12 上线日期:2020-06-02
  • 作者简介:盛亮(1982—),男,讲师。E-mail:sl_hust@sina.com
  • 基金资助:
    国家自然科学基金项目(11504173)

A Novel Distance Regularized Hybrid Level Set Method for AUV Multi-destination Route Planning

SHENG Liang1,2, QIU Zhiming3, YU Shaozhen3, JIAO Junjie4   

  1. (1.College of Aeronautical Basics, Naval Aeronautical University, Yantai 264001, Shandong, China;2.School of Weaponry Engineering, Naval University of Engineering, Wuhan 430033, Hubei, China; 3.Naval Research Academy, Beijing 102442, China; 4.School of Mechanical Engineering, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China)
  • Received:2019-06-12 Revised:2019-06-12 Online:2020-06-02

摘要: 为进一步提升水平集算法求解自主水下航行器(AUV)时间最优航路的计算效率,结合局部化思想和多项式距离正则化方程,提出一种用于AUV多终点航路规划的混合水平集算法。通过引入简单多项式距离正则化项,融合海流模型,推导新的水平集演化方程,并给出数值实现方法。所提算法无需重复初始化窄带且一次演化就能获得至多终点的所有最优航路集,解决了AUV多终点航路规划时计算效率不高、规划时间过长的问题。仿真结果表明,相较于蚁群算法和量子粒子群算法,在AUV的多终点航路规划中,混合水平集算法计算效率是蚁群算法的6.4倍,是量子粒子群算法的1.6倍,且鲁棒性更佳。

关键词: 自主水下航行器, 多项式距离正则化, 混合水平集, 多终点, 航路规划

Abstract: To further enhance the computational efficiency of level set method for solving AUV time-optimal route, a hybrid level set method for AUV multi-destination route planning is proposed by combining the localization and the polynomial distance regularized equation. The new level set evolution equation is derived and the numerical implementation method is given by introducing a simple polynomial distance regularized term and fusing the ocean current model. The proposed method can be used to obtain all the optimal routes to all destinations in one evolution without re-initialization of narrowband, and solve the problems of low computational efficiency and long-time multi-destination route planning of AUV. The simulated results show that the computational efficiency of the proposed method is 6.4 times of that of the ant colony algorithm, and 1.6 times of that of the quantum particle swarm algorithm in multi-destinations route planning of AUV, and it also has better robustness. Key

Key words: autonomousunderwatervehicle, polynomial-distanceregularization, hybridlevelset, multi-destination, routeplanning

中图分类号: