基于探测概率的UUV搜潜路径规划  

Submarine searching path planning with UUV based on detection probability

作　　者：付留芳 周明[1] 李文哲[1] 董晓明[1] FU Liu-fang;ZHOU Ming;LI Wen-zhe;DONG Xiao-ming(Department of Underwater Weaponry and Chemical Defense,Dalian Naval Academy,Dalian 116013,China)

机构地区：[1]海军大连舰艇学院水武与防化系,辽宁大连116013

出　　处：《舰船科学技术》2024年第9期82-87,共6页Ship Science and Technology

摘　　要：针对无人航行器(Unmanned UnderwaterVehicle,UUV)在潜搜索中目标运动状态难以准确描述、传统搜索方法难以保证有限搜索时间内发现概率最大的问题,本文提出一种基于探测概率的UUV搜潜路径规划方法。首先,将搜索区域栅格化,建立基于隐马尔科夫模型(HiddenMarkovModel,HMM)的目标运动模型,可实时更新目标的后验概率分布。然后,以探测概率为目标函数,采用改进的遗传算法对UUV搜索路径进行规划,使得在确定的搜索时间内对潜探测概率最大。在仿真实验中,通过与经典算例对比,验证了方法的正确性;通过与矩形搜索、随机搜索2种常用搜索方法的对比,验证了该方法的有效性。Aiming at the status of the target is hard to describe accurately and the traditional submarine searching methods can't get optimal detection probability,a submarine searching path planning method is provided for Unmanned Underwater Vehicle(UUV)based on detection probability.Firstly,the searching area is divided into grids and the target motion model is built based on Hidden Markov Model(HMM).Then,the submarine searching path panning is done by genetic algorithm(GA)with UUV to get largest detection probability which is taken as the objective function.In the simulation experiments,compared with classic example,the results illustrate the correctness of the method.Compared with two common methods of rectangle searching and random searching,the results showed the effectiveness of the method.

关 键 词：对潜搜索 路径规划 隐马尔科夫模型 遗传算法 

分 类 号：E925.2[军事—军事装备学]