Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Ordnance Industry Automation》 2018-10
Add to Favorite Get Latest Update

Optimization Calculation of Discrete Detection Point Sequences

Chen Changkang;Chen Jianyong;Zhou Jiaxin;Administrant Brigade of Postgraduate,Navay Aeronautical University;Department of Electronic & Information Engineering,Navay Aeronautical University;  
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.
【CateGory Index】: E91
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved