SLAMベンチマークと手法の特性評価:ロバスト知覚時代に向けて
Characterizing SLAM Benchmarks and Methods for the Robust Perception Age
決定木を用いてSLAMアルゴリズムが苦手とするベンチマーク特性を特定し、さらにスローモーション再生による計算性能のプロファイリング手法を提案した論文。
著者: Wenkai Ye, Yipu Zhao, Patricio A. Vela
分類: cs.RO, cs.CV
原文アブストラクト
The diversity of SLAM benchmarks affords extensive testing of SLAM algorithms to understand their performance, individually or in relative terms. The ad-hoc creation of these benchmarks does not necessarily illuminate the particular weak points of a SLAM algorithm when performance is evaluated. In this paper, we propose to use a decision tree to identify challenging benchmark properties for state-of-the-art SLAM algorithms and important components within the SLAM pipeline regarding their ability to handle these challenges. Establishing what factors of a particular sequence lead to track failure or degradation relative to these characteristics is important if we are to arrive at a strong understanding for the core computational needs of a robust SLAM algorithm. Likewise, we argue that it is important to profile the computational performance of the individual SLAM components for use when benchmarking. In particular, we advocate the use of time-dilation during ROS bag playback, or what we refer to as slo-mo playback. Using slo-mo to benchmark SLAM instantiations can provide clues to how SLAM implementations should be improved at the computational component level. Three prevalent VO/SLAM algorithms and two low-latency algorithms of our own are tested on selected typical sequences, which are generated from benchmark characterization, to further demonstrate the benefits achieved from computationally efficient components.
関連論文
- エッジ上でのRGB-D SLAM:Raspberry Pi 5におけるRTAB-MapとORB-SLAM3のベンチマークとプロファイリングSLAM
- 拡散事前分布と来歴認識を用いた動的環境向け単眼ガウシアンスプラッティングSLAMSLAM
- V3DSAM: 意味・幾何学的ループ検証と幾何学固定の永続インスタンスマッピングによるフィードフォワード高密度SLAMSLAM
- DASH-SLAM: 深度スケール伝播によるキャリブレーション不要のメトリック単眼SLAMSLAM
- 暗黙的意味論と系列一貫性ループ閉じ込めによるVGGTベースSLAMのスケールアンカリングSLAM
- 磁気慣性を密結合したフィールドロボット向けSLAMシステムSLAM
