Classical localization methods use Cartesian or Polar coordinates, which require a priori range information to determine whether to estimate position or to only find bearings. The modified polar representation (MPR) u...Classical localization methods use Cartesian or Polar coordinates, which require a priori range information to determine whether to estimate position or to only find bearings. The modified polar representation (MPR) unifies near-field and farfield models, alleviating the thresholding effect. Current localization methods in MPR based on the angle of arrival (AOA) and time difference of arrival (TDOA) measurements resort to semidefinite relaxation (SDR) and Gauss-Newton iteration, which are computationally complex and face the possible diverge problem. This paper formulates a pseudo linear equation between the measurements and the unknown MPR position,which leads to a closed-form solution for the hybrid TDOA-AOA localization problem, namely hybrid constrained optimization(HCO). HCO attains Cramér-Rao bound (CRB)-level accuracy for mild Gaussian noise. Compared with the existing closed-form solutions for the hybrid TDOA-AOA case, HCO provides comparable performance to the hybrid generalized trust region subproblem (HGTRS) solution and is better than the hybrid successive unconstrained minimization (HSUM) solution in large noise region. Its computational complexity is lower than that of HGTRS. Simulations validate the performance of HCO achieves the CRB that the maximum likelihood estimator (MLE) attains if the noise is small, but the MLE deviates from CRB earlier.展开更多
In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an o...In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.展开更多
基金supported by the National Natural Science Foundation of China (62101359)Sichuan University and Yibin Municipal People’s Government University and City Strategic Cooperation Special Fund Project (2020CDYB-29)+1 种基金the Science and Technology Plan Transfer Payment Project of Sichuan Province (2021ZYSF007)the Key Research and Development Program of Science and Technology Department of Sichuan Province (2020YFS0575,2021KJT0012-2 021YFS-0067)。
文摘Classical localization methods use Cartesian or Polar coordinates, which require a priori range information to determine whether to estimate position or to only find bearings. The modified polar representation (MPR) unifies near-field and farfield models, alleviating the thresholding effect. Current localization methods in MPR based on the angle of arrival (AOA) and time difference of arrival (TDOA) measurements resort to semidefinite relaxation (SDR) and Gauss-Newton iteration, which are computationally complex and face the possible diverge problem. This paper formulates a pseudo linear equation between the measurements and the unknown MPR position,which leads to a closed-form solution for the hybrid TDOA-AOA localization problem, namely hybrid constrained optimization(HCO). HCO attains Cramér-Rao bound (CRB)-level accuracy for mild Gaussian noise. Compared with the existing closed-form solutions for the hybrid TDOA-AOA case, HCO provides comparable performance to the hybrid generalized trust region subproblem (HGTRS) solution and is better than the hybrid successive unconstrained minimization (HSUM) solution in large noise region. Its computational complexity is lower than that of HGTRS. Simulations validate the performance of HCO achieves the CRB that the maximum likelihood estimator (MLE) attains if the noise is small, but the MLE deviates from CRB earlier.
文摘In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.
