Navigational approach for mobile robots

In this paper work, we present an algorithm for path planning to a target for mobile robot in unknown environment. An algorithm allows a mobile robot to navigate through static obstacles, and finding the path in order to reach the target without collision. The proposed strategy is designed in a grid-map form of an unknown environment with static unknown obstacles. Mobile robots move by sensing and avoiding the obstacles coming across, to get an optimal or feasible solution with minimum cost. Finally a graphical notation is used to present the implementation of Obstacle avoidance problem & Quadtree based heuristic search.