期刊文献+

基于改进的复合自适应遗传算法的UUV水下回收路径规划 被引量:4

Path Planning for UUV Underwater Recovery based on Improved Composite Adaptive Genetic Algorithm
下载PDF
导出
摘要 传统遗传算法的变异操作会简单随机产生新的路径,对算法进化性能有不利影响,使算法易陷入局部最优的陷阱;遗传算法常配合栅格法进行路径规划,所得的最优路径并非无人水下航行器(UUV)回收路径规划可获得的最短路径,并存在UUV机动性能可能与最优路径冲突的问题。为此,设计一种具有UUV机动性约束条件的改进遗传算法,提出环境复杂度的概念用于分析机动性约束的具体取值,使路径规划适配于UUV的机动性,使算法结果更具实用性;提出复合自适应变异策略,控制变异的个体在迭代过程中发生自适应的进化;当一定迭代数内种群进化停滞时,引导最优个体进行双阶段自适应变异,从而使最优路径趋近全局近似最优解,有效提高算法的收敛速度。基于MATLAB软件的算法对比仿真结果表明一般复杂水域和复杂水域环境下,改进的复合自适应遗传算法生成的最优路径相比于遗传算法和自适应遗传算法的最优路径更加平滑,路径长度更低,可见改进的复合自适应遗传算法在路径规划上收敛性能和寻优能力更优,更具有可行性和优越性。 Mutations of traditional genetic algorithms generate new paths in a simple and random manner,which negatively influence the evolutionary performance of the algorithms and makes it easy for them to fall into the trap of local optimality.Moreover,genetic algorithms are usually used together with the grid method for path planning,and the optimal path obtained is not always the shortest path for UUV recovery path planning,and the UUV mobility performance might conflict with the optimal path.An improved genetic algorithm with UUV mobility constraints is thus proposed.The concept of environment complexity is proposed to analyze the specific value of mobility constraints,so that path planning can be adapted to UUV mobility,and the algorithm results can be more practical.The compound adaptive mutation strategy is proposed to control the adaptive evolution of the mutated individuals in the iterative process.When the population evolution stagnates after a certain number of iterations,the optimal individual is guided for a two-stage adaptive mutation so that the optimal path approaches the approximate global optimal solution,and the convergence rate of the algorithm is effectively improved.The algorithm comparison simulation results based on MATLAB software show that the optimal path generated by the improved compound adaptive genetic algorithm is smoother and shorter in length compared with the optimal path of genetic algorithm and adaptive genetic algorithm in generally complex water area and complex water area,which demonstrates that the improved compound adaptive genetic algorithm has better convergence performance and superiority seeking ability in path planning and is more feasible and superior.
作者 赵鹏程 宋保维 毛昭勇 丁文俊 ZHAO Pengcheng;SONG Baowei;MAO Zhaoyong;DING Wenjun(School of Marine Science and Technology,Northwestern Polytechnical University,Xi an 710072,Shaanxi,China;Key Laboratory of Unmanned Underwater Vehicle Ministry of Industry and Information Technology,Northwestern Polytechnical University,Xi an 710072,Shaanxi,China;Unmanned System Research Institute,Northwestern Polytechnical University,Xi an 710072,Shaanxi,China)
出处 《兵工学报》 EI CAS CSCD 北大核心 2022年第10期2598-2608,共11页 Acta Armamentarii
基金 国家自然科学基金项目(51909206) 中国博士后科学基金项目(2021M692616) 陕西省自然科学基础研究计划项目(2019JQ-607) 浙江省自然科学基金项目(LQ20E090010) 中央高校基本科研业务费专项资金项目(2020年)。
关键词 水下回收UUV 路径规划 改进遗传算法 环境复杂度 机动性约束条件 复合自适应变异策略 underwater recovery of UUV path planning improved genetic algorithm environmental complexity mobility constraints compound adaptive mutation strategy
  • 相关文献

参考文献6

二级参考文献55

  • 1金翔,王天霖,于鹏垚,赵勇.基于值迭代网络的路径规划算法[J].华中科技大学学报(自然科学版),2020,48(2):91-96. 被引量:1
  • 2孙波,陈卫东,席裕庚.基于粒子群优化算法的移动机器人全局路径规划[J].控制与决策,2005,20(9):1052-1055. 被引量:79
  • 3王海英,蔡向东,尤波,张礼勇.基于遗传算法的移动机器人动态路径规划研究[J].传感器与微系统,2007,26(8):32-34. 被引量:11
  • 4朱清新,卿利,彭博.随机运动目标搜索问题的最优控制模型[J].控制理论与应用,2007,24(5):841-845. 被引量:4
  • 5Lavis B, Furukawa T, Durrant-Whyte H F. Dynamic space reconflguration for Bayesian search and tracking with moving targets[J]. Autonomous Robots, 2008, 24(4): 387-399.
  • 6Hong S P, Cho S J, Park M J. A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search [J]. European Journal of Operational Research, 2009, 193(2): 351-364.
  • 7Stone L D. What's happened in search theory since the 1975 Lanchester prize?[J]. Operations Research, 1989, 37(3): 501-506.
  • 8Trummel K E, Weisinger J R. The complexity of the optimal searcher path problem[J]. Operations Research, 1986, 34(2): 324-327.
  • 9Eagle J N. The optimal search for a moving target when the search path is constrained[J]. Operations Research, 1984, 32(5): 1107-1115.
  • 10Eagle J N, Yee J R. An optimal Branch-and-Bound procedure for the constrained path, moving target search problem[J]. Operations Research, 1990, 38(1): 110-114.

共引文献162

同被引文献56

引证文献4

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部