2014 年 80 巻 816 号 p. DR0242
In this paper, we propose to calculate a likelihood based on a quasi-euclidean norm for a fast and robust particle-filter-based self-localization of mobile robots. The quasi-euclidean norm can be calculated faster than the conventional L2 norm. Furthermore, such norm is much robust to noises than the L1 or L2 norm. In this work, we perform self-localization experiments based on the L1 norm, L2 norm and quasi euclidean norm likelihood to compare the robustness and processing time. Through these experiments, we confirm the effectiveness of our method.