International Journal of Computer and Communication Technology


In this paper, we study the online path planning for khepera II mobile robot in an unknown environment. The well known heuristic A* 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. The proposed path finding strategy is designed in a grid-map form of an unknown environment with static unknown obstacles. 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 and time metric as the cost function.





To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.