Anderson加速を用いたICPの高速化
AA-ICP: Iterative Closest Point with Anderson Acceleration
ICPを固定点問題として捉え、Anderson加速で反復を高速化する手法を提案し、PCLに実装して実データで有効性を示した。
著者: A. L. Pavlov, G. V. Ovchinnikov, D. Yu. Derbyshev, D. Tsetserukou, I. V. Oseledets
分類: cs.RO
原文アブストラクト
Iterative Closest Point (ICP) is a widely used method for performing scan-matching and registration. Being simple and robust method, it is still computationally expensive and may be challenging to use in real-time applications with limited resources on mobile platforms. In this paper we propose novel effective method for acceleration of ICP which does not require substantial modifications to the existing code. This method is based on an idea of Anderson acceleration which is an iterative procedure for finding a fixed point of contractive mapping. The latter is often faster than a standard Picard iteration, usually used in ICP implementations. We show that ICP, being a fixed point problem, can be significantly accelerated by this method enhanced by heuristics to improve overall robustness. We implement proposed approach into Point Cloud Library (PCL) and make it available online. Benchmarking on real-world data fully supports our claims.
関連論文
- 再帰的ベイズ比較によるLiDAR計測のオンライン幾何整合性評価SLAM/位置推定
- Hilti-Trimble-Oxfordデータセット:フロアプラン事前情報を用いた360度視覚慣性SLAMと位置推定のベンチマークSLAM/位置推定
- 局所化が失敗する時と場所:変化する環境におけるICPの分析SLAM/位置推定
- 最悪の事態に備える:ICPアルゴリズムのレジリエンス解析のための学習ベース敵対的攻撃SLAM/位置推定
- SEM-GAT: 学習済みグラフアテンションによる説明可能なセマンティック姿勢推定SLAM/位置推定
- X-ICP: 極限環境でのロバストな自己位置推定のための局所化可能性を考慮したLiDAR位置合わせSLAM/位置推定
