Multipath Identification, User Localization, and Environment Mapping in Radio SLAM
Bibliographic record
Abstract
Radio simultaneous localization and mapping (SLAM) is challenging due to multipath propagation. While line-of-sight (LoS) and first-order non-LoS (NLoS) paths, referred to as NLoS-1 paths, play a critical role in SLAM, no existing techniques can effectively separate them from high-order NLoS paths, i.e., NLoS-npaths (n≥ 2). This paper presents a new framework to accurately identify the LoS/NLoS-1 paths and conduct SLAM. The key idea is to define the virtual user equipment (UE) of a NLoS-npath as then-th order reflection of the UE. We discover that the centers of the circles encompassing the UE, a virtual UE associated with a LoS/NLoS-1 path, and each of some other virtual UEs are aligned in a line, if and only if those virtual UEs are all associated with NLoS-1 paths. Accordingly, we propose to identify the LoS/NLoS-1 paths using Hough transform-based line detection, and estimate the UE’s location and the environments with the identified LoS/NLoS-1 paths using maximum likelihood estimation and mean-shift clustering. We analytically confirm that the localization error asymptotically approaches the Cramér-Rao Lower Bound. Simulations show that our approach outperforms the state of the art in localization accuracy by up to 91.93%, even when the latter assumed all NLoS-1 paths are perfectly identifieda-priori.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".