GA-PSO-FASTSLAM: A hybrid optimization approach in improving fastSLAM performance

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

FastSLAM algorithm is one of the introduced Simultaneous Localization and Mapping (SLAM) algorithms for autonomous mobile robot. It decomposes the SLAM problem into one distinct localization problem and a collection of landmarks estimation problems. In recent discovery, FastSLAM suffers particle depletion problem which causes it to degenerate over time in terms of accuracy. In this work, a new hybrid approach is proposed by integrating two soft computing techniques that are genetic algorithm (GA) and particle swarm optimization (PSO) into FastSLAM. It is developed to overcome the particle depletion problem occur by improving the FastSLAM accuracy in terms of robot and landmark set position estimation. The experiment is conducted in simulation where the result is evaluated using root mean square error (RMSE) analysis. The experiment result shows that the proposed hybrid approach able to minimize the FastSLAM problem by reducing the degree of error occurs (RMSE value) during robot and landmark set position estimation.

Cite

CITATION STYLE

APA

Khairuddin, A. R., Talib, M. S., Haron, H., & Abdullah, M. Y. C. (2017). GA-PSO-FASTSLAM: A hybrid optimization approach in improving fastSLAM performance. In Advances in Intelligent Systems and Computing (Vol. 557, pp. 57–66). Springer Verlag. https://doi.org/10.1007/978-3-319-53480-0_6

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