复杂海战场环境下AUV全局路径规划方法  

AUV global path planning method in complex sea battle field environment

作　　者：赵苗 高永琪[1] 吴笛霄[1] 王鹏[1] 张洪刚[1] ZHAO Miao;GAO Yongqi;WU Dixiao;WANG Peng;ZHANG Honggang(College of Weaponry Engineering, Naval University of Engineering, Wuhan 430033, China;College of Missile Engineering, Rocket Force University of Engineering, Xi′an 710025, China)

机构地区：[1]海军工程大学兵器工程学院,湖北武汉430033 [2]火箭军工程大学导弹工程学院,陕西西安710025

出　　处：《国防科技大学学报》2021年第1期41-48,共8页Journal of National University of Defense Technology

基　　金：国家部委基金资助项目(3020605010201)。

摘　　要：针对无人自主水下航行器(Autonomous Underwater Vehicle,AUV)在复杂海战场环境中路径规划时环境模型复杂、约束条件多的情况,建立了包括战场地形、敌方威胁、障碍物和海流场等在内的比较完善的海战场环境模型。以AUV航行时间、威胁时间最短为优化目标,给出了一种基于振荡型入侵野草优化(Invasive Weeds Optimization,IWO)算法的AUV全局路径规划方法,并分别与标准IWO算法、全振荡型IWO算法以及粒子群算法等三种路径规划算法比较。仿真结果表明,所提方法具有较强的寻优能力和鲁棒性,可在复杂海战场环境下为AUV高效地规划出满足性能要求的航行路径。In view of the path planning of the unmanned AUV(autonomous underwater vehicle)in the complex sea battlefield environment,the environment model is complex and there are many constraints.A relatively perfect sea battlefield environment model including battlefield shape,enemy threats,obstacles,and sea current field was established.The AUV navigation time and threat time were the shortest as the optimization goal,and an oscillation-based type was given.The AUV global path planning method of the oscillation IWO(invasive weeds optimization)algorithm was compared with other three path planning algorithms,such as the standard IWO algorithm,the full-oscillation IWO algorithm and the PSO(particle swarm optimization)algorithm respectively.Simulation results show that the proposed method which has strong searching ability and excellent robustness,can effectively plan the navigation path which meets the performance requirements for the AUV in the complex sea battlefield environment.

关 键 词：无人自主水下航行器 海战场 全局路径规划 振荡型入侵野草优化算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]