海军航空工程学院学报2017，Vol.32Issue(6)：511-516,6.DOI:10.7682/j.issn.1673-1522.2017.06.003
探测点序列的最优化与简化计算方法
Optimization and Simplified Calculation Method of Detection Point Sequence
摘要
Abstract
On the basis of the first order search state model,the optimal control model of the probability to find a random motion target with discrete time detection was established. Then, an approximation algorithm and the simplified form of short time of the algorithm for the optimal detection point sequences were given based on the dynamic programming princi?ple.The algorithm and its simplified form of short time were 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 results showed that when the initial location and velocity of the random constant velocity target obeyed the cir?cular normal distribution,the algorithm and its simplified form of short time could be converged by any given initial detec?tion point sequence to the optimal detection point sequence satisfying the accuracy requirement.关键词
最优搜索/探测点序列/最优化/运动目标/动态规划/简化计算Key words
optimal search/detection point sequence/optimization/moving target/dynamic programming/simplified calcu⁃lation分类
数理科学引用本文复制引用
陈长康,陈建勇,周家新..探测点序列的最优化与简化计算方法[J].海军航空工程学院学报,2017,32(6):511-516,6.基金项目
装备预先研究基金资助项目(302020210) （302020210）
