离散探测点序列的最优化计算  

Optimization Calculation of Discrete Detection Point Sequences

作　　者：陈长康 陈建勇 周家新 Chen Changkang;Chen Jianyong;Zhou Jiaxin(Administrant Brigade of Postgraduate,Navay Aeronautical University,Yantai 264001,China;Department of Electronic ＆ Information Engineering,Navay Aeronautical University,Yantai 264001,China)

机构地区：[1]海军航空大学研究生管理大队,山东烟台264001 [2]海军航空大学电子信息工程系,山东烟台264001

出　　处：《兵工自动化》2018年第10期85-88,共4页Ordnance Industry Automation

摘　　要：针对离散时间探测随机运动目标这类问题,设计一种新的最优探测点序列逼近算法。在搜索状态建模和求解一阶搜索状态方程特征迹线解的基础上,建立对随机运动进行离散时间探测的发现概率最优控制模型,结合动态规划原理,实现该算法步骤。在满足1阶搜索状态方程的随机恒速目标条件以及有限指数探测函数条件下,将算法应用到算例。结果表明:当随机恒速运动目标初始位置和速度均服从圆正态分布时,该算法能由任意给定的初始探测点序列优化收敛,满足精度要求的最大发现概率的最优探测点序列。Aiming at the problem of discrete-time random moving target detection, a new algorithm for optimal detection point sequence approximation is designed. On the basis of search state model and solving the characteristic trace solution of the first order search state equation, the optimal control model of the probability to find a random motion target with discrete time detection is established, combined with the dynamic programming principle, the algorithm steps are implemented. The algorithm is applied to the example under the condition of satisfying of the first order search equation of the random constant speed target condition and the finite exponential detection function, the simulation result shows that when the initial location and velocity of the random constant velocity target obey the circular normal distribution, the algorithm can be optimally converged by any given initial detection point sequence to the optimal detection point sequence with the maximum detection probability of satisfying the accuracy requirement.

关 键 词：最优搜索 离散时间 探测点 最优化 运动目标 动态规划 

分 类 号：TP20[自动化与计算机技术—检测技术与自动化装置]