エリアグラフに基づく高速2D地図マッチング
Fast 2D Map Matching Based on Area Graphs
2D占有格子地図をエリアグラフ表現に変換し、その空間での投票により剛体変換や類似スケールの仮定なしで2つの地図を高速に統合する手法を提案した。
著者: Jiawei Hou, Haofei Kuang, Sören Schwertfeger
分類: cs.RO
原文アブストラクト
We present a novel area matching algorithm for merging two different 2D grid maps. There are many approaches to address this problem, nevertheless, most previous work is built on some assumptions, such as rigid transformation, or similar scale and modalities of two maps. In this work we propose a 2D map matching algorithm based on area segmentation. We transfer general 2D occupancy grid maps to an area graph representation, then compute the correct results by voting in that space. In the experiments, we compare with a state-of-the-art method applied to the matching of sensor maps with ground truth layout maps. The experiment shows that our algorithm has a better performance on large-scale maps and a faster computation speed.
関連論文
- 不確実なループなし地図のための変形可能な地図マッチング地図マッチング
