Open AccessA study of a discrete Bayes and a Kalman filter computational Complexity and performance in the case of 1D robot localization
Author(s) -
Indah Agustien Siradjuddin,
I M Fitriani,
Rosa Andrie Asmara,
Mochammad Junus,
Tundung Subali Patma,
Gillang Al Azhar,
Heri Satria Setiawan
Publication year - 2019
Publication title -
journal of physics conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1402/4/044026
Subject(s) - kalman filter , computer science , bayesian programming , artificial intelligence , computational complexity theory , fast kalman filter , bayes' theorem , probabilistic logic , extended kalman filter , robotics , invariant extended kalman filter , mobile robot , algorithm , recursive bayesian estimation , robot , bayesian probability , bayes factor
In the robotic field of study, localization is one of the important methods for autonomous mobile robot navigation. Probabilistic approaches have received significant attention in the robotics community. The discrete Bayes and Kalman filters are the fundamental algorithms in probabilistic approach which have to be clearly understood in order to develop more advanced filtering algorithms. This paper discusses discrete Bayes and Kalman filtering algorithms. The mathematical representation of each filter algorithm, in the 1-dimensional case, presented in detail. The algorithms were implemented using python to simulate the probability of the robot position. The algorithm’s complexity was analysed with respect to the computational cost and size of memory used. From this study, it has been observed that the Kalman filter is computationally more efficient, and less memory is required.