階層構造を活用したS-Graphsの高速最適化
Faster Optimization in S-Graphs Exploiting Hierarchy
3DシーングラフSLAMのS-Graphsを階層的に圧縮し、部屋単位の局所グラフ生成と冗長キーフレームの周辺化で計算時間を約40%削減した。
著者: Hriday Bavle, Jose Luis Sanchez-Lopez, Javier Civera, Holger Voos
分類: cs.RO, cs.AI
原文アブストラクト
3D scene graphs hierarchically represent the environment appropriately organizing different environmental entities in various layers. Our previous work on situational graphs extends the concept of 3D scene graph to SLAM by tightly coupling the robot poses with the scene graph entities, achieving state-of-the-art results. Though, one of the limitations of S-Graphs is scalability in really large environments due to the increased graph size over time, increasing the computational complexity. To overcome this limitation in this work we present an initial research of an improved version of S-Graphs exploiting the hierarchy to reduce the graph size by marginalizing redundant robot poses and their connections to the observations of the same structural entities. Firstly, we propose the generation and optimization of room-local graphs encompassing all graph entities within a room-like structure. These room-local graphs are used to compress the S-Graphs marginalizing the redundant robot keyframes within the given room. We then perform windowed local optimization of the compressed graph at regular time-distance intervals. A global optimization of the compressed graph is performed every time a loop closure is detected. We show similar accuracy compared to the baseline while showing a 39.81% reduction in the computation time with respect to the baseline.
関連論文
- エッジ上でのRGB-D SLAM:Raspberry Pi 5におけるRTAB-MapとORB-SLAM3のベンチマークとプロファイリングSLAM
- 拡散事前分布と来歴認識を用いた動的環境向け単眼ガウシアンスプラッティングSLAMSLAM
- V3DSAM: 意味・幾何学的ループ検証と幾何学固定の永続インスタンスマッピングによるフィードフォワード高密度SLAMSLAM
- DASH-SLAM: 深度スケール伝播によるキャリブレーション不要のメトリック単眼SLAMSLAM
- 暗黙的意味論と系列一貫性ループ閉じ込めによるVGGTベースSLAMのスケールアンカリングSLAM
- 磁気慣性を密結合したフィールドロボット向けSLAMシステムSLAM
