基于动态规划的猎雷具识别路径优化算法

The Optimizing Method of Identifying Route for Mine-hunter Vehicle Based on Dynamic Programming Arithmetic

路径长度、海流方向给猎雷具航渡、操控带来的时间消耗,是影响目标识别效率的主要因素。单纯运用动态规划算法只能解决猎雷具最短识别路径的问题,而无法顾全猎雷具在操控方面的时间损耗,从而在提升作战效率上得不偿失。本文基于动态规划算法,优化了识别路径的解算模型,并在模型解算前,提出了目标位置的预处理条件,简化了模型的解算步骤;在模型解算后,提出了识别路径的修正方法,完善了模型的解算结果。

The time that current direction and route length consume are the main factors that influences efficiency of targets＇ identifying.The dynamic programming arithmetic can only solve problem of the shortest route,but can not considerate the operation,so as to lose more time.This text is based on dynamic programming arithmetic,optimizing the model of the route calculation,and before that,put forward the preparing condition to simplified the calculation step;and after that,put forward the correction method to perfect the calculation result.