Pseudo-linear measurement approach for heterogeneous multi-robot relative localization
Bibliographic record
Abstract
The purpose of relative localization (RL) is to locate and track one or more robots in another moving robot body-fixed coordinate frame using relative range and/or bearing measurements. Most available RL methods assume known initial conditions at the first encounter of an arbitrary robot, and the tracking is then followed using an extended Kalman filter (EKF). In case of poor filter initialization, these EKF based methods sometimes cause instability or demand longer settling time. To overcome this issue, this paper proposes a pseudo-linear measurement (PM) based technique for RL where true nonlinear measurements are algebraically transformed into PM. The proposed RL scheme is tested in Monte Carlo simulations for a heterogeneous multi-robot system comprising both aerial and ground robots. Results demonstrate that the proposed method performs RL with 5~10 cm positional accuracy and 0.075~0.1 rad orientational accuracy. The performance of the PM based RL is then compared against traditional EKF based methods with unknown filter initialization. The results demonstrate that the proposed method able to achieve both the positional and orientational accuracy within 12 iterations, whereas the traditional methods requires more than 250 iterations to achieve the same accuracy. The experiment validation of the proposed method was performed and results are congruent with the simulations.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".