GLAC: High-Precision Tracking of Mobile Objects With COTS RFID Systems
Bibliographic record
Abstract
This paper presents GLAC, the first 3D localization system that enables millimeter-level object manipulation for robotics using only COTS RFID devices. The key insight of GLAC is that mobility reduces ambiguity (One-to-many mapping relationship between phase and distance) and thus improves accuracy. Unlike state-of-the-art systems that require extra time or hardware to boost performance, it draws the power of modeling mobility in a delicate way. In particular, we build a novel framework for real-time tracking using the Hidden Markov Model (HMM). In our framework, multiple Kalman filters are designed to take a single phase observation for updating mobility states, and a fast inference algorithm is proposed to efficiently process an exponentially large number of candidate trajectories. We prototype GLAC with only UHF tags and a commercial reader of four antennas. Comprehensive experiments show that the median position accuracies of x/y/z dimensions are within 1 cm for both LoS and NLoS cases. The median position accuracy for slow-moving targets is 0.41 cm, which is 2.2$\times$, 17.3$\times$, and 14.9$\times$better than TurboTrack, Tagoram, and RF-IDraw, respectively. Also, its median velocity accuracy is at least 20$\times$better than all three competitors for fast-moving targets. Besides accuracy, it achieves more than 4$\times$localization time gains over state-of-the-art systems.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.003 |
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".