Capping computation time and storage requirements for appearance-based localization with CAT-SLAM | IEEE Conference Publication | IEEE Xplore

Capping computation time and storage requirements for appearance-based localization with CAT-SLAM


Abstract:

Appearance-based localization is increasingly used for loop closure detection in metric SLAM systems. Since it relies only upon the appearance-based similarity between im...Show More

Abstract:

Appearance-based localization is increasingly used for loop closure detection in metric SLAM systems. Since it relies only upon the appearance-based similarity between images from two locations, it can perform loop closure regardless of accumulated metric error. However, the computation time and memory requirements of current appearance-based methods scale linearly not only with the size of the environment but also with the operation time of the platform. These properties impose severe restrictions on longterm autonomy for mobile robots, as loop closure performance will inevitably degrade with increased operation time. We present a set of improvements to the appearance-based SLAM algorithm CAT-SLAM to constrain computation scaling and memory usage with minimal degradation in performance over time. The appearance-based comparison stage is accelerated by exploiting properties of the particle observation update, and nodes in the continuous trajectory map are removed according to minimal information loss criteria. We demonstrate constant time and space loop closure detection in a large urban environment with recall performance exceeding FAB-MAP by a factor of 3 at 100% precision, and investigate the minimum computational and memory requirements for maintaining mapping performance.
Date of Conference: 14-18 May 2012
Date Added to IEEE Xplore: 28 June 2012
ISBN Information:

ISSN Information:

Conference Location: Saint Paul, MN, USA

Contact IEEE to Subscribe

References

References is not available for this document.