Comparison of the SLAM algorithms: Hangar experiments

  • Korkmaz M
  • Yılmaz N
  • Durdu A
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

This study purposes to compare two known algorithms in an application scenario of simultaneous localization and mapping (SLAM) and to present issues related with them as well. Mostly used SLAM algorithms Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF) are compared with respect to the point of accuracy of the robot states, localization and mapping. Because of considering the most implementations in the previous studies, the simulation environments are chosen as big as possible to provide reliable results. In this study, two different hangar regions are tried to be simulated. According to the outcomes of the applications, UKF-based SLAM algorithm has superior performance over the EKF-based one, apart from elapsed time.

Cite

CITATION STYLE

APA

Korkmaz, M., Yılmaz, N., & Durdu, A. (2016). Comparison of the SLAM algorithms: Hangar experiments. MATEC Web of Conferences, 42, 03009. https://doi.org/10.1051/matecconf/20164203009

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