面向TDOA被动定位的定位节点选择方法  

Sensor Selection Method for TDOA Passive Localization

作　　者：郝本建[1] 王林林 李赞[1] 赵越 HAO Benjian;WANG Linlin;LI Zan;ZHAO Yue(State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China)

机构地区：[1]西安电子科技大学ISN国家重点实验室,西安710071

出　　处：《电子与信息学报》2019年第2期462-468,共7页Journal of Electronics & Information Technology

基　　金：国家自然科学基金重点项目(61631015);国家自然科学基金(61471395);陕西省重点科技创新团队计划(2016KCT-01);中央高校基础科研业务费(7215433803)~~

摘　　要：该文主要研究一种面向到达时间差(TDOA)被动定位的定位节点选择方法。首先,通过经典的闭式解析算法将TDOA非线性方程转化为伪线性方程,并使用位置误差的协方差矩阵来度量定位精度。其次,在可用节点数量给定的条件下,在数学上将定位节点选择问题转化为最小化位置误差协方差矩阵的迹这一非凸优化问题。然后,将非凸优化问题凸松弛并化为半正定规划问题,从而快速有效地求解出最优的定位节点组合。仿真结果表明,所提节点优选方法的性能非常接近穷尽搜索方法,而且克服了穷尽搜索方法运算复杂度高、时效性差的不足,从而验证了所提方法的有效性。This paper focuses on the sensor selection optimization problem in Time Difference Of Arrival(TDOA)passive localization scenario.Firstly,the localization accuracy metric is given by the error covariance matrix of classical closed-form solution,which is introduced to convert the TDOA nonlinear equations into pseudo linear equations.Secondly,the problem of sensor selection can be mathematically transformed into the non-convex optimization problem,to minimize the trace of localization error covariance matrix under the condition that the number of active sensors is given.Then,the non-convex optimization problem is relaxed and transformed into a positive semi-definite programming problem so that the optimal subset of positioning nodes can be solved quickly and effectively.Simulation results validate that the performance of proposed sensor selection method is very close to the exhausted-search method,and overcomes the shortcomings of the high computation complexity and poor timeliness of the exhausted-search method.

关 键 词：到达时间差 被动定位 节点优选 

分 类 号：TN911.23[电子电信—通信与信息系统]