Journal
2019 IEEE 7TH INTERNATIONAL CONFERENCE ON CONTROL, MECHATRONICS AND AUTOMATION (ICCMA 2019)
Volume -, Issue -, Pages 78-83Publisher
IEEE
DOI: 10.1109/iccma46720.2019.8988710
Keywords
computation complexity; FastSLAM; particle filter; UGV
Ask authors/readers for more resources
Two decades ago, FastSLAM algorithm for mobile robots was introduced. Since then, dozens of research work focused on FastSLAM algorithm performance enhancement while keeping reduced computation cost. Since experimental evaluation of computation cost is dependent on the hardware capabilities of the platform, the present work introduces a quantitative theoretical method for predicting the computation cost of the FastSLAM algorithm. The method relies on the big (0) computation complexity which represents the worst case. The method was evaluated experimentally with different number of particles and different number of map features. The computation cost evaluation analysis was broken down into prediction, observation, data association and resampling computation cost evaluation. The proposed method was proven to be helpful in customization of FastSLAM parameters like number of particles and data association optimization for FastSLAM algorithm developers.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available