A novel efficient algorithm for mobile robot localization

• Coverage of some previous works.
• Localization is viewed as an optimization problem and is solved by a harmony search.
• Proposing a hybrid method and proposing 2 methods in total.

Being autonomous is one of the most important goals in mobile robots. One of the fundamental works to achieve this goal is giving the ability to a robot for finding its own correct position and orientation. Different methods have been introduced to solve this problem. In this paper, a novel method based on the harmony search (HS) algorithm for robot localization through scan matching is proposed. Simulation results show that the proposed method in comparison with a genetic algorithm-based approach has better accuracy and higher performance. Furthermore a new hybrid algorithm based on harmony search and differential evolution (DE) algorithms is proposed and evaluated on different benchmark functions. Finally the hybrid algorithm has been applied for mobile robot localization and it outperformed the HS-based approach.