Range-only Target Localisation using Geometrically Constrained Optimisation

Defence Science Journal

En Fan³  Weixin Xie¹  Zongxiang Liu¹  Peng-fei Li² 

[1]Shenzhen University, Shenzhen

[2]Air Defense Forces Academy, Zhengzhou

[3]Xidian University, Xi’an

关键词: Range-only target localisation;    target localisation;    nonlinear optimisation;    Cramer-Rao lower bound;    Levenberg-Marquardt algorithm;    radar networking;    two-dimensional search radar;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Defence Scientific Information & Documentation Centre

【 摘 要 】

The problem of optimal range-only localisation of a single target is of considerable interest in two-dimensional search radar networking. For coping with this problem, a range-only target localisation method using synchronous measurements from radars is presented in the real ellipsoidal earth model. In the relevant radar localisation scenario, geometric relationships between the target and three radars were formed. A set of localisation equations was derived on range error in such a scenario. Using these equations, the localisation task has been formulated as a nonlinear weighted least squares problem that can be performed using the Levenberg- Marquardt (LM) algorithm to provide the optimal estimate of the target’s position. To avoid the double value solutions and to accelerate the convergence speed for the LM algorithm, the initial value was approximately given according to observations from two radars. In addition, the relative validity has been defined to evaluate the performance of the proposed method. The performance of the proposed approach is evaluated using two simulation experiments and a real-test experiment, and it has been found to possess higher localisation accuracy than the other conventional method. Defence Science Journal, Vol. 65, No. 1, January 2015, pp.70-76, DOI:http://dx.doi.org/10.14429/dsj.65.5474

【 授权许可】

Unknown