Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T01:58:04.203Z Has data issue: false hasContentIssue false

A robust, multi-hypothesis approach to matching occupancy grid maps

Published online by Cambridge University Press:  11 January 2013

Jose-Luis Blanco*
Affiliation:
Department of Engineering, University of Almería, Almería, Spain
Javier González-Jiménez
Affiliation:
Department of System Engineering and Automation, University of Málaga, Malaga, Spain
Juan-Antonio Fernández-Madrigal
Affiliation:
Department of System Engineering and Automation, University of Málaga, Malaga, Spain
*
*Corresponding author. E-mail: joseluisblancoc@gmail.com
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper presents a new approach to matching occupancy grid maps by means of finding correspondences between a set of sparse features detected in the maps. The problem is stated here as a special instance of generic image registration. To cope with the uncertainty and ambiguity that arise from matching grid maps, we introduce a modified RANSAC algorithm which searches for a dynamic number of internally consistent subsets of feature pairings from which to compute hypotheses about the translation and rotation between the maps. By providing a (possibly multi-modal) probability distribution of the relative pose of the maps, our method can be seamlessly integrated into large-scale mapping frameworks for mobile robots. This paper provides a benchmarking of different detectors and descriptors, along extensive experimental results that illustrate the robustness of the algorithm with a 97% success ratio in loop-closure detection for ~1700 matchings between local maps obtained from four publicly available datasets.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2013