Spider Monkey Optimization Algorithm Based Collision-Free Navigation and Path Optimization for a Mobile Robot in the Static Environment

This paper concentrates on the recognition of a navigational algorithm, which can resolve path optimization challenges in minimum time. This navigational algorithm helps the mobile robot to avoid collision with obstacles. Implementation of spider monkey optimization (SMO) algorithm is carried out to explain the objectives of this paper. SMO algorithm is established upon the splitting-combination nature of spider monkeys. The proposed algorithm is examined in various terrains to determine the robustness and effectuality of the proposed algorithm. Simulation results confirmed that spider monkey optimization algorithm selects a path, which guides the robot to reach the target in minimum possible time. Subsequently, it decreases the computational cost, as the time for computation is minimized. In extension, we replicated the previously used environment, and the proposed algorithm is compared with the corresponding implemented algorithm. Our results demonstrate that Spider monkey optimization (SMO) provides better results on the basis of time by selecting a path with lesser complexity. To determine the adequacy of the prescribed standard route-outlining control design, the common element of this paper is the numerical simulation.