ポーズグラフSLAMのためのスペクトラム計測スパース化
Spectral Measurement Sparsification for Pose-Graph SLAM
ポーズグラフSLAMにおいて、グラフの代数的連結度を最大化するように計測を間引く凸緩和ベースの手法MACを提案し、長期ナビゲーションでのメモリ・計算量削減と推定精度維持を両立した。
著者: Kevin J. Doherty, David M. Rosen, John J. Leonard
分類: cs.RO
原文アブストラクト
Simultaneous localization and mapping (SLAM) is a critical capability in autonomous navigation, but in order to scale SLAM to the setting of "lifelong" SLAM, particularly under memory or computation constraints, a robot must be able to determine what information should be retained and what can safely be forgotten. In graph-based SLAM, the number of edges (measurements) in a pose graph determines both the memory requirements of storing a robot's observations and the computational expense of algorithms deployed for performing state estimation using those observations; both of which can grow unbounded during long-term navigation. To address this, we propose a spectral approach for pose graph sparsification which maximizes the algebraic connectivity of the sparsified measurement graphs, a key quantity which has been shown to control the estimation error of pose graph SLAM solutions. Our algorithm, MAC (for "maximizing algebraic connectivity"), which is based on convex relaxation, is simple and computationally inexpensive, and admits formal post hoc performance guarantees on the quality of the solutions it provides. In experiments on benchmark pose-graph SLAM datasets, we show that our approach quickly produces high-quality sparsification results which retain the connectivity of the graph and, in turn, the quality of corresponding SLAM solutions, as compared to a baseline approach which does not consider graph connectivity.
関連論文
- エッジ上でのRGB-D SLAM:Raspberry Pi 5におけるRTAB-MapとORB-SLAM3のベンチマークとプロファイリングSLAM
- 拡散事前分布と来歴認識を用いた動的環境向け単眼ガウシアンスプラッティングSLAMSLAM
- V3DSAM: 意味・幾何学的ループ検証と幾何学固定の永続インスタンスマッピングによるフィードフォワード高密度SLAMSLAM
- DASH-SLAM: 深度スケール伝播によるキャリブレーション不要のメトリック単眼SLAMSLAM
- 暗黙的意味論と系列一貫性ループ閉じ込めによるVGGTベースSLAMのスケールアンカリングSLAM
- 磁気慣性を密結合したフィールドロボット向けSLAMシステムSLAM
