Efficient Autonomous Robotic Exploration With Semantic Road Map in Indoor Environments
Bibliographic record
Abstract
This letter presents a novel and integrated framework for Next-Best-View (NBV) selection toward autonomous robotic exploration in indoor environments. A topological map, named semantic road map (SRM), is proposed to represent the explored environment during the exploration. The basic concept of the SRM is to construct a graph with nodes containing the exploration states and with edges satisfying the collision-free constraints. Especially, the SRM integrates both semantic and structure information of the environment, which possesses the beneficial properties of using a topological map in the exploration. It is worth noting that the proposed SRM is incrementally built along with the exploration process, thereby, avoiding the unnecessary reconsideration of the explored areas when constructing the topological map. Based on the SRM, a novel decision model with semantic information is presented for determining the NBV during the exploration. Moreover, the decision model takes into account both information gain and cost-to-go of a candidate NBV, which can be queried efficiently on the SRM, enabling the efficient exploration of the environment. The effectiveness and efficiency of the proposed system are assessed and demonstrated using both simulated and real-world indoor experiments.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".