Optimal Navigation for Mobile Robot in Known Environment

Abstract

Optimal navigation is a subset of robot navigation in an environment. It is also known as a path planning. The aim of the optimal navigation is to choose optimal path between the initial state and the desired state of the robot. There are many methods how to choose the optimal path. In this article A* algorithm was chosen, because it is widely applied. The main idea was to propose an algorithm, which is able to select the optimal path in a typical indoor environment. Despite that our real robot uses metric maps and A* algorithm is primarily designated for the topological maps, it was verified in the experiments that this algorithm can be used for off-line path planning.