Publication

Abstract : Path planning of a mobile robot is a budding field of research and a significant problem to solve in robot navigation. It is widely used for examination, mainly involving static and unknown surroundings. Global and local path planning problems in the presence of obstacles in a real-time environment are challenging. Finding the best possible path from the start point to the endpoint in less time and distance and avoiding collision with obstacles is a potential research field. This paper aims to develop a hybrid algorithm for finding the near-optimal solution for global path planning and enhancing the algorithm by considering the areas of improvement and real-time constraints to use the algorithm effectively in robot navigation. The proposed hybrid algorithms exhibit less computation time and path cost than conventional ones for larger grid sizes. A* algorithm performs better for an environment with a smaller grid size.