Robust Localization Based on Mixed-Norm Minimization Criterion

Abstract

This paper presents robust positioning methods that use range measurements to estimate location parameters. The existing maximum correntropy criterion-based localization algorithm uses only the l(2) norm minimization. Therefore, the localization performance may not be satisfying because the l(2) norm minimization is vulnerable to the large error. Therefore, we propose the convex combination of l(1) and l(2) norm because the l(1) norm minimization is effective in the large noise condition. The mixed-norm maximum Versoria criterion-based unscented Kalman filter, mixed-norm least lncosh unscented Kalman filter, mixed-norm maximum Versoria criterion iterative reweighted least-squares, mixed-norm least lncosh iterative reweighted least squares and closed-form localization approaches are proposed for mixed line-of-sight/non-line-of-sight environments. The proposed mixed-norm unscented Kalman filter-based algorithms are more superior to the other methods as the line-of-sight noise level increases by the use of the convex combination of l(1) norm and l(2) norm. The iterative reweighted least sqaures-based methods employ a weight matrix. The closed-form weighted least squares algorithm has an advantage that its computational complexity is lower than that of other methods. Simulation and experiments illustrate the localization accuracies of the proposed unscented Kalman filter-based methods are found to be superior to those of the other algorithms under large noise level conditions.