利用分层语义图加速多层建筑的定位与地图优化
S-Graphs 2.0 -- A Hierarchical-Semantic Optimization and Loop Closure for SLAM
- 构建四层分层语义图:关键帧、墙、房间、楼层,支持高效数据管理
- 基于楼层语义的回环检测策略,有效避免跨层误检,提升精度
- 分层优化机制使大规模场景建图速度提升10倍,适合实际部署
三维场景图的分层结构在表示人造环境时具有高度相关性,其语义与几何信息可用于加速地图元素和机器人位姿的优化与管理。本文提出情境图2.0(S-Graphs 2.0),利用室内场景的分层结构实现高效的数据管理和优化。算法首先构建包含四层的场景图:关键帧、墙、房间、楼层。创新点一在于前端引入地板检测模块,可识别楼梯并为底层赋予楼层语义关系,从而提出基于楼层的回环闭合策略,有效排除因不同楼层间相似性导致的误闭合。创新点二在于分层优化:(1) 在最近关键帧窗口内进行局部优化,涵盖四层连接组件;(2) 楼层级全局优化,仅针对当前楼层的关键帧及其连接进行优化;(3) 房间级局部优化,对共享观测的关键帧进行边缘化,降低计算开销。在多个真实多层环境下的实验验证表明,本方法在大规模多层场景中达到当前最优精度,平均建图速度比基线快10倍。
原文摘要 · Abstract (English)
The hierarchical structure of 3D scene graphs shows a high relevance for representations purposes, as it fits common patterns from man-made environments. But, additionally, the semantic and geometric information in such hierarchical representations could be leveraged to speed up the optimization and management of map elements and robot poses. In this direction, we present our work Situational Graphs 2.0 (S-Graphs 2.0), which leverages the hierarchical structure of indoor scenes for efficient data management and optimization. Our algorithm begins by constructing a situational graph that represents the environment into four layers: Keyframes, Walls, Rooms, and Floors. Our first novelty lies in the front-end, which includes a floor detection module capable of identifying stairways and assigning floor-level semantic relations to the underlying layers. Floor-level semantics allows us to propose a floor-based loop closure strategy, that effectively rejects false positive closures that typically appear due to aliasing between different floors of a building. Our second novelty lies in leveraging our representation hierarchy in the optimization. Our proposal consists of: (1) local optimization over a window of recent keyframes and their connected components across the four representation layers, (2) floor-level global optimization, which focuses only on keyframes and their connections within the current floor during loop closures, and (3) room-level local optimization, marginalizing redundant keyframes that share observations within the room, which reduces the computational footprint. We validate our algorithm extensively in different real multi-floor environments. Our approach shows state-of-art-art accuracy metrics in large-scale multi-floor environments, estimating hierarchical representations up to 10x faster, in average, than competing baselines
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。