Robust TOA Localization Based on Convex Relaxation With Unknown Transmission Time
This paper discusses the Time of Arrival(TOA)based source localization problem when the transmission time is unknown.A constrained weighted least squares(CWLS)problem based on weighted least squares(WLS)criterion is proposed.To provide an effective solution algorithm,this problem is relaxed into a novel quasi-convex fractional programming(FP)problem by using the con-vex relaxation technique,which is then transformed into an equivalent mixed semidefinite and second-order cone programming(SD/SOCP)problem.By adding a series of second order cone con-straints and a penalty term,this SD/SOCP problem is further tightened to increase the estimation ac-curacy.Computer simulation results show that the proposed method can reach the Cramer-Rao lower bound(CRLB)and has good robustness in selecting penalty factors.
source localizationtime-of-arrivalfractional programmingsemi-definite and second-order cone programming
NETL
NSTL
万方数据
