A Study on Looking for Shortest Trajectory of Mobile Robot Using A* Algorithm

摘要

Mobile robots are studied and researched popularly in the world. The global problems about looking for trajectory and avoiding obstacles are interested. This paper presents a study on looking for shortest trajectory of mobile robot between the started position and the goal position. Firstly, a design of mobile robot is introduced. After that, the paper concentrates on using A* algorithm to look for shortest trajectory. In this paper, an algorithm for avoiding obstacles is also considered during looking for trajectory. This algorithm is simulated in MATLAB. Finally, an experimental model is done to verify the proposed algorithm.