SLAM Method Based on Independent Particle Filters for Landmark Mapping and Localization for Mobile Robot Based on HF-band RFID System

a novel simultaneous localization and mapping (slam) technique based on independent particle filters for landmark mapping and localization for a mobile robot based on a high-frequency (hf)-band radio-frequency identification (rfid) system is proposed in this paper. slam is a technique for performing self-localization and map building simultaneously. fastslam is a standard landmark-based slam method. rfid is a robust identification system with id tags and readers over wireless communication; further, it is rarely affected by obstacles in the robot area or by lighting conditions. therefore, rfid is useful for self-localization and mapping for a mobile robot with a reasonable accuracy and sufficient robustness. in this study, multiple hf-band rfid readers are embedded in the bottom of an omnidirectional vehicle, and a large number of tags are installed on the floor. the hf-band rfid tags are used as the landmarks of the environment. we found that fastslam is not appropriate for this condition for two reasons. first, the tag detection of the hf-band rfid system does not follow the standard gaussian distribution, which fastslam is supposed to have. second, fastslam does not have a sufficient scalability, which causes its failure to handle a large number of landmarks. therefore, we propose a novel slam method with two independent particle filters to solve these problems. the first particle filter is for self-localization based on monte carlo localization. the second particle filter is for landmark mapping. the particle filters are nonparametric so that it can handle the non-gaussian distribution of the landmark detection. the separation of localization and landmark mapping reduces the computational cost significantly. the proposed method is evaluated in simulated and real environments. the experimental results show that the proposed method has more precise localization and mapping and a lower computational cost than fastslam.