Open AccessA study of a discrete Bayes and a Kalman filter computational Complexity and performance in the case of 1D robot localizationOpen Access
I M Fitriani,
R A Asmara,
Tundung Subali Patma,
G A Azhar,
journal of physics
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.
Subject(s)algorithm , artificial intelligence , bayes' theorem , bayesian hierarchical modeling , bayesian probability , bayesian programming , computational complexity theory , computer science , extended kalman filter , fast kalman filter , invariant extended kalman filter , kalman filter , mobile robot , operating system , probabilistic logic , python (programming language) , recursive bayesian estimation , robot , robotics
SCImago Journal Rank0.21
Seeing content that should not be on Zendy? Contact us.