期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Constrained Weighted Least Squares Location Algorithm Using Received Signal Strength Measurements 被引量:4
1
作者 LI Zeyuan 《China Communications》 SCIE CSCD 2016年第4期81-88,共8页
Determine the location of a target has gained considerable interest over the past few years. The Received Signal Strength(RSS) measurements and Differential RSS(DRSS) measurements can be converted to distance or dista... Determine the location of a target has gained considerable interest over the past few years. The Received Signal Strength(RSS) measurements and Differential RSS(DRSS) measurements can be converted to distance or distance ratio estimates for constructing a set of linear equations. Based on these linear equations, a constrained weighted least Squares(CWLS) algorithm for target localization is derived. In addition, an iterative technique based on Newton's method is utilized to give a solution. The covariance and bias of the CWLS algorithm is derived using perturbation analysis. Simulation shows that the proposed estimator achieves better performance than existing algorithms with reasonable complexity. 展开更多
关键词 received signal strength target localization constrained weighted least squares
下载PDF
Semidefinite programming approach for TDOA/GROA based source localization
2
作者 Yanshen Du Ping Wei Huaguo Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2015年第4期680-687,共8页
Time-differences-of-arrival (TDOA) and gain-ratios-of- arrival (GROA) measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares (CWL... Time-differences-of-arrival (TDOA) and gain-ratios-of- arrival (GROA) measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares (CWLS) estimator is presented. Due to the nonconvex nature of the CWLS problem, it is difficult to obtain its globally optimal solution. However, according to the semidefinite relaxation, the CWLS problem can be relaxed as a convex semidefinite programming problem (SDP), which can be solved by using modern convex optimization algorithms. Moreover, this relaxation can be proved to be tight, i.e., the SDP solves the relaxed CWLS problem, and this hence guarantees the good per- formance of the proposed method. Furthermore, this method is extended to solve the localization problem with sensor position errors. Simulation results corroborate the theoretical results and the good performance of the proposed method. 展开更多
关键词 gain ratios of arrival (GROA) time difference of arrival(TDOA) LOCALIZATION constrained weighted least squares (CWLS) semidefinite programming problem (SDP).
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部