2019
DOI: 10.1109/lsp.2019.2929860
|View full text |Cite
|
Sign up to set email alerts
|

TOA-Based Localization With NLOS Mitigation via Robust Multidimensional Similarity Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
19
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 33 publications
(21 citation statements)
references
References 31 publications
1
19
0
Order By: Relevance
“…While the recent efforts tend to perform error mitigation using as little NLOS information as possible, it is increasingly common to generalize the NLOS bias error term (i.e., one does not assume any specific non-Gaussian distribution) in the derivation of robust location estimators [4,[19][20][21]23,25,32]. Depending on what kind of distributions are applied to generate the NLOS errors for simulation, these studies can be classified into the exponential [21] and uniform [4,19,20,23,25,32] ones.…”
Section: Preliminaries and Problem Formulationmentioning
confidence: 99%
See 3 more Smart Citations
“…While the recent efforts tend to perform error mitigation using as little NLOS information as possible, it is increasingly common to generalize the NLOS bias error term (i.e., one does not assume any specific non-Gaussian distribution) in the derivation of robust location estimators [4,[19][20][21]23,25,32]. Depending on what kind of distributions are applied to generate the NLOS errors for simulation, these studies can be classified into the exponential [21] and uniform [4,19,20,23,25,32] ones.…”
Section: Preliminaries and Problem Formulationmentioning
confidence: 99%
“…The dominant complexity of our SR-MCC algorithm is thus O(N HQ K L), where N HQ denotes the number of HQ iterations. In Table 1, the computational complexity of SR-MCC is compared to several state-of-the-art approaches for TOA-based localization with NLOS mitigation, 2 where N ADMM is the iteration number of the alternating direction method of multipliers in [25]. As our empirical results show, the proposed SR-MCC algorithm can already exhibit decent performance with a few number of N HQ and K and, hence, is fairly computationally simple.…”
Section: Mcc-based Optimization Problem (mentioning
confidence: 99%
See 2 more Smart Citations
“…To avoid the use of triangular inequality by the S-Lemma, the final target position could be obtained through the optimization problems. In [ 20 ], in order to deal with the abnormal row and column structure in the multi-dimensional similarity (MDS) matrix caused by NLOS propagation, the authors propose an improved robust matrix approximation program that uses the 2,1-norm and applies alternating directions of multipliers method to resolve the resulting nonlinear constraint optimization problem. Voting is a good idea that can be used to mitigate the influence of NLOS.…”
Section: Related Workmentioning
confidence: 99%