TY - JOUR
T1 - Learning-Based Maximum Likelihood Estimator for Angle-of-Arrival Localization
AU - Zhou, Chengyi
AU - Liu, Meiqin
AU - Zhang, Senlin
AU - Zheng, Ronghao
AU - Dong, Shanling
AU - Liu, Zhunga
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - The estimation of target positions from angle-of-arrival (AOA) measurements has been extensively researched, and various estimators have been proposed to tackle this challenge. Among these, the maximum likelihood estimator (MLE) is notable for its well-recognized properties, including asymptotic unbiasedness and efficiency. However, traditional MLEs, such as the Gauss-Newton algorithm, often encounter difficulties due to the need for a first-order linearization step in computing the Jacobian matrix. This requirement introduces the potential for significant errors and convergence issues, especially in highly nonlinear systems. To overcome this limitation, this paper introduces a learning framework to address the maximum likelihood estimation problem, where the iterative increments are treated as the output of the agent's actions. Building upon this framework, we develop a learning-based MLE. Comprehensive numerical simulation results demonstrate the effectiveness and superiority of our approach. First, it effectively resolves convergence issues associated with linearization in traditional MLEs. Second, it exhibits robust adaptability by successfully solving both two-dimensional and three-dimensional AOA localization problems. Last, the proposed method significantly enhances localization accuracy compared to existing estimators.
AB - The estimation of target positions from angle-of-arrival (AOA) measurements has been extensively researched, and various estimators have been proposed to tackle this challenge. Among these, the maximum likelihood estimator (MLE) is notable for its well-recognized properties, including asymptotic unbiasedness and efficiency. However, traditional MLEs, such as the Gauss-Newton algorithm, often encounter difficulties due to the need for a first-order linearization step in computing the Jacobian matrix. This requirement introduces the potential for significant errors and convergence issues, especially in highly nonlinear systems. To overcome this limitation, this paper introduces a learning framework to address the maximum likelihood estimation problem, where the iterative increments are treated as the output of the agent's actions. Building upon this framework, we develop a learning-based MLE. Comprehensive numerical simulation results demonstrate the effectiveness and superiority of our approach. First, it effectively resolves convergence issues associated with linearization in traditional MLEs. Second, it exhibits robust adaptability by successfully solving both two-dimensional and three-dimensional AOA localization problems. Last, the proposed method significantly enhances localization accuracy compared to existing estimators.
KW - Angle-of-arrival localization
KW - deep reinforcement learning
KW - first-order linearization
KW - Gauss-Newton algorithm
KW - maximum likelihood estimator
UR - http://www.scopus.com/inward/record.url?scp=85200266084&partnerID=8YFLogxK
U2 - 10.1109/TSP.2024.3434979
DO - 10.1109/TSP.2024.3434979
M3 - 文章
AN - SCOPUS:85200266084
SN - 1053-587X
VL - 72
SP - 5388
EP - 5405
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
ER -