In this paper, we study the path planning for khepera II mobile robot in an unknown environment. The well known heuristic D* lite algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. and to perform efficient re-planning during exploration. The proposed path finding strategy is designed in a grid-map form of an unknown environment with static unknown obstacles. The robot moves within the unknown environment by sensing and avoiding the obstacles coming across its way towards the target. When the mission is executed, it is necessary to plan an optimal or feasible path for itself avoiding obstructions in its way and minimizing a cost such as time, energy, and distance. In our study we have considered the distance metric as the cost function
Das, Pradipta kumar; Patro, S .N.; Panda, C. N.; and Balabantaray, Bunil
"D* lite algorithm based path planning of mobile robot in static Environment,"
International Journal of Computer and Communication Technology: Vol. 3
, Article 13.
Available at: https://www.interscience.in/ijcct/vol3/iss4/13