Adaptive Block Elevation Mapping for Large-scale Scene
Bibliographic record
Abstract
Dense map that contains the surrounding geometry and vision information of a robot is widely used for path planning, navigation, obstacle avoidance and other applications. Considering the performance of the processing unit mounted on the robot is limited, mapping algorithm has to make compromise by sacrificing speed and precision. It will be more challenging when the dense mapping scene is very large because the memory consumption will be greatly increased and the map is difficult to be extended if beyonding the initial map. To suppress the negative impact from the increased map scale, we proposed a novel block mapping approach to generate the dense map in large scale of scene. In this work, the elevation map is selected as the base dense map. The entire elevation map is segmented into numerous block maps of which size is much smaller than that of the entire map. The present moment of lidar and vision measurements are used to generate the local elevation map. The local elevation map is used to update block maps which are adaptively generated along the motion trajectory. A memory-disk interaction mechanism, which the block maps will be loaded to memory or saved to local disk when needed, is introduced. Our block mapping approach is tested on the KITTI datasets, and the results demonstrate that the mapping approach can stably operate in a large scale of scene with a much smaller consumption of memory.
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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".