Enhancing Mobile Robot Path Planning with New Dung Beetle Optimization Algorithm incorporating Multi-Strategy Improvements

Abstract

In order to enhance the efficacy of mobile robots, a new dung beetle optimization algorithm (NewDBO) is proposed. It is improved using four strategies to improve the search capability and convergence speed of the algorithm. The efficacy of the enhanced algorithm is evaluated through the use of test functions and its application to the path planning problem. The results indicate that the improved algorithm exhibits faster convergence speed and better optimization ability than the comparison algorithm, and the shortest path can be obtained while ensuring the minimum number of turns in the path planning problem, which verifies the algorithm's feasibility and robustness.