Abstract:Autonomous exploration of multi-floor buildings remains challenging for ground robots because conventional 2D and 2.5D maps cannot represent overlapping traversable surfaces such as stairs, ramps, and multiple reachable elevations. This letter presents a multi-floor exploration framework based on an incremental reachable graph. Built as a sparse graph over reachable support surfaces, the graph preserves potentially valid connectivity through tentative graph elements under sparse observations and enables stable, physically reachable frontier detection. To guide exploration beyond the currently mapped floor, we project task-zone priors from an explored floor to initialize a hypothetical graph on the target floor and reconcile it incrementally with incoming observations. A hierarchical planner then jointly reasons over confirmed and hypothetical structures for global guidance. In simulation, the proposed method demonstrates improved exploration efficiency and mapping completeness compared to evaluated baselines. Furthermore, onboard real-world experiments validate its practical feasibility and real-time performance.
| Subjects: | Robotics (cs.RO) |
| Cite as: | arXiv:2605.23350 [cs.RO] |
| (or arXiv:2605.23350v1 [cs.RO] for this version) | |
| https://doi.org/10.48550/arXiv.2605.23350 arXiv-issued DOI via DataCite (pending registration) |
From: Zhiwen Zhu [view email]
[v1]
Fri, 22 May 2026 08:13:19 UTC (4,140 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。