Algorithmic agent for effective mobile robot navigation in an unknown environment

摘要

The proposed algorithm for mobile robot supports for the optimal shortest path navigation in an unknown maze-type environment. The approach to find the shortest path through flood fill algorithm considers only the static maze-type environment. The proposed strategy deals with the dynamicity (moving obstacles) and plans the path accordingly. While exploring the maze by wall following, it considers also the number and the position of walls in-between to reach the goal by taking local optimal decisions.