Practical And Robust Approach For A Neural Networks Based Indoor Positioning System Using Ultrawide Band
Bibliographic record
Abstract
With the increasing widespread of sensor technology, new solutions for indoor positioning systems are continuously being developed and with them, new services requiring accurate positioning data have seen a great rise in popularity. In this thesis, a new design technique and deployment methodology for an indoor positioning system using neural networks is proposed to offer more flexibility and simplicity in the development of such a system which is currently very context-bound. The usage of battery-powered tags implies also that systems should not require excessive power consumption and the large number of targets to position requires a method that is not only accurate but also scalable. The proposed positioning system utilizes a small “swarm” of neural networks tasked to position targets based on distance measurements from Ultrawide Band sensors and requires shorter fingerprint collection campaigns and enables more flexibility in system deployment and alterations. Instead of relying solely on real data collected on the field for the training of neural networks, synthetic data is used for an initial training phase. Together, these propositions allow flexibility in terms of adding, removing or altering positions of reference nodes and simplifies offline deployment operations of an indoor positioning system. This thesis presents a system operating in a laboratory-workshop environment capable of good positioning accuracies and maintains robust performances in poor signal propagation.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.003 | 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".