Straight-Line: A new global path planning algorithm for Mobile Robot

Today most organizations use mobile robots for many purposes and to perform difficult and repetitive tasks. Robots are used to transport goods from one place to another within factories and warehouses. It is also used to provide different services in government and private institutions, as it can interact with people and help them to obtain different services with high quality and very quickly without any trouble. For the robot performs its functions better, it needs a path planning algorithm to avoid obstacles and works faster. Therefore, we develop a new algorithm called straight line algorithm. The new algorithm can get the optimal path with shortest length in low running time. The new algorithm searches for the optimal solution in the critical region firstly. This way capable of finding the shortest path faster. We evaluate straight-line algorithm with Genetic algorithm GA. We find that the new algorithm outperforms better than the GA in terms, distance, speed, and running time.