2015 IEEE International Conference on Industrial Technology (ICIT) 2015
DOI: 10.1109/icit.2015.7125079
|View full text |Cite
|
Sign up to set email alerts
|

Active SLAM-based algorithm for autonomous exploration with mobile robot

Abstract: In this paper, we present an algorithm for fully autonomous exploration and mapping of an unknown indoor robot environment. This algorithm is based on the active SLAM (simultaneous localization and mapping) approach. The mobile robot equipped with laser sensor builds a map of an environment, while keeping track of its current location. Autonomy is introduced to this system by automatically setting goal points so that either previously unknown space is mapped, or known landmarks are revisited in order to increa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(18 citation statements)
references
References 20 publications
0
18
0
Order By: Relevance
“…wheel velocities) in order to navigate unknown environments and jointly build the map of the environments. When the SLAM algorithm is used in real-time for actively planning robot paths while simultaneously building the environment map, the SLAM algorithm is named as Active SLAM (Trivun et al, 2015). The most widely used Active SLAM method so far is called frontier-based exploration (Yamauchi, 1997) which generates the control signals simply looking at whether the selected frontier (i.e.…”
Section: Introductionmentioning
confidence: 99%
“…wheel velocities) in order to navigate unknown environments and jointly build the map of the environments. When the SLAM algorithm is used in real-time for actively planning robot paths while simultaneously building the environment map, the SLAM algorithm is named as Active SLAM (Trivun et al, 2015). The most widely used Active SLAM method so far is called frontier-based exploration (Yamauchi, 1997) which generates the control signals simply looking at whether the selected frontier (i.e.…”
Section: Introductionmentioning
confidence: 99%
“…Reference [29] is aimed at solving active SLAM problems where coverage is required and certain constraints are imposed. With that end in view, reference [29] proposes a solution to it that focuses on minimization and area coverage within an MPC (Model Predictive Control) framework. It uses a sub-map joining method to improve both effectiveness and efficiency.…”
Section: Related Workmentioning
confidence: 99%
“…It uses a sub-map joining method to improve both effectiveness and efficiency. The D-opt MPC problem is resolved with recourse to a graph topology and convex optimization and the SQP method is employed to address the coverage problem.The main contribution of [29] is it presents a new method capable of generating a sound collision-free trajectory so as to better perform coverage tasks than many other systems do.…”
Section: Related Workmentioning
confidence: 99%
“…where Fo represents the created map feature; x Fo represents the th state vector with created feature. The meaning of formula (6) is that if the th measurement data is from created feature, then joint estimation of vehicle pose and the created feature is carried out. If not, the vehicle pose is estimated only and the th measurement data is saved to create a new map feature.…”
Section: Posterior Probability Distribution Decomposition Strategymentioning
confidence: 99%
“…Compared with EKF-SLAM, FastSLAM has a lower complexity and is more robust regarding the data association problem. Nevertheless, the FastSLAM based on RBPF also suffers from some drawbacks such as particle degeneration, Jacobian Matrix solving and linear processing of nonlinear function [4][5][6]. To deal with these problems, the SLAM based on square root unscented Kalman filter (SRUKF) is proposed.…”
Section: Introductionmentioning
confidence: 99%