An evolutionary algorithm for simultaneous localization and mapping (SLAM) of mobile robots
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a novel algorithm for simultaneous localization and mapping (SLAM) of mobile robots. The algorithm, termed Evolutionary SLAM, is based on an island model genetic algorithm (IGA). The IGA searches for the most probable map(s) such that the underlying robot's pose(s) provide(s) a robot with the best localization information. The correspondence problem in SLAM is solved by exploiting the property of natural selection, to support only better-performing individuals to survive. The algorithm does not follow any explicit heuristics for loop closure, rather it maintains multiple hypotheses to solve the loop-closing problem. The algorithm processes sensor data incrementally and, therefore, has the capability to work online. Experimental results in different indoor environments validate the robustness of the proposed algorithm.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it