A decision-theoretic active loop closing approach to autonomous robot exploration and mapping

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

One of the challenges of SLAM (Simultaneous Localization and Mapping) for autonomous robots is the loop closing problem. In this paper, a decision-theoretic active loop closing approach is presented, which integrates the exploration planning with loop closing. In our approach, the active loop closing process is modeled as a multi-stage decision problem, and a frontier-based auxiliary topological map is build to assist the decision process. The autonomous robot chooses its actions according to the sequential decision results. The unknown range most likely to close a loop is selected to explored, and a particle-filter-based localization and smoothing method applied to partial maps is used in the loop validating and loop constraints building process. Experiments have shown that our approach can practically implement loop closure and obviously improve the mapping precision compared to passive exploration strategy. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ji, X., Zhang, H., Hai, D., & Zheng, Z. (2009). A decision-theoretic active loop closing approach to autonomous robot exploration and mapping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5399 LNAI, pp. 507–518). https://doi.org/10.1007/978-3-642-02921-9_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free