Robust time-of-arrival localization via ADMM

Abstract

This article considers the problem of source localization (SL) using possibly unreliable time-of-arrival (TOA) based range measurements. Adopting the strategy of statistical robustification, we formulate TOA SL as minimization of a versatile loss that possesses resistance against the occurrence of outliers. We then present an alternating direction method of multipliers (ADMM) to tackle the nonconvex optimization problem in a computationally attractive iterative manner. Moreover, we prove that the solution obtained by the proposed ADMM will correspond to a Karush-Kuhn-Tucker point of the formulation when the algorithm converges, and discuss reasonable assumptions about the robust loss function under which the approach can be theoretically guaranteed to be convergent. Numerical investigations demonstrate the superiority of our method over many existing TOA SL schemes in terms of positioning accuracy and computational simplicity. In particular, the proposed ADMM achieves estimation results with mean square error performance closer to the Cramér-Rao lower bound than its competitors in our simulations of impulsive noise environments.

arXiv commentShould you have any questions regarding this contribution, please don't hesitate to reach out to me via email at [email protected]

References in corpus (6)

• TDOA-based localization with NLOS mitigation via robust model transformation and neurodynamic optimization
• On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradient
• Optimized Signal Distortion for PAPR Reduction of OFDM Signals with IFFT/FFT Complexity via ADMM Approaches
• Maximum correntropy criterion for robust TOA-based localization in NLOS environments
• Local Strong Convexity of Source Localization and Error Bound for Target Tracking under Time-of-Arrival Measurements
• STRONG: Synchronous and asynchronous RObust Network localization, under Non-Gaussian noise