Mobile Robot Localization Based on the PSO Algorithm with Local Minima Avoiding the Fitness Function

Abstract

Localization of a semi-humanoid mobile robot Pepper is proposed based on the particle swarm optimization algorithm (PSO) that is robust to the disturbance perturbations of LIDAR-measured distances from the mobile robot to the walls of the robot real laboratory workspace. The novel PSO, with the avoiding local minima algorithm (PSO-ALM), uses a novel fitness function that can prevent the PSO search from trapping into the local minima and thus prevent the mobile robot from misidentifying the actual location. The fitness function penalizes nonsense solutions by introducing continuous integrity checks of solutions between two different consecutive locations. The proposed methodology enables accurate and real-time global localization of a mobile robot, given the underlying a priori map, with a consistent and predictable time complexity. Numerical simulations and real-world laboratory experiments with different a priori map accuracies have been conducted to prove the proper functioning of the method. The results have been compared with the benchmarks, i.e., the plain vanilla PSO and the built-in robot's odometrical method, a genetic algorithm with included elitism and adaptive mutation rate (GA), the same GA algorithm with the included ALM algorithm (GA-ALM), the state-of-the-art plain vanilla golden eagle optimization (GEO) algorithm, and the same GEO algorithm with the added ALM algorithm (GEO-ALM). The results showed similar performance with the odometrical method right after recalibration and significantly better performance after some traveled distance. The GA and GEO algorithms with or without the ALM extension gave us similar results according to the accuracy of localization. The optimization algorithms' performance with added ALM algorithms was much better at not getting caught in the local minimum, while the PSO-ALM algorithm gave us the overall best results.