Path Planning of Mobile Robot Using Hybrid Algorithm Based on GA-IACO

In recent years, path planning is considered the optimization problem which is important for mobile robot navigation. This study focuses on the algorithm based on GA and IACO to work in a static environment and solve the global path planning (GPP) issues. The considering approach is effective in solving the issues. The aim is to construct an efficient algorithm that finds the best possible path. This study combines GA-IACO to form a hybrid algorithm for the quick action of selecting the path and altering crossover operators, which decrease the falling risk. The simulations results verify that the robot travels from one to another point safely. It reaches the endpoint by eluding all the obstacles that are present in the way. It signifies that the proposed scheme is accurate and finds an optimal solution with higher efficiency and probability in a short time.