A* Algorithm for Shortest Path in Robot Motion

Abstract

Mobile robot motion in real-time has many challenges in terms of reaching the exact destination and avoid obstacles. In this work, A * algorithm has been selected to show the robot motion in simulation through Matlab software. Different destinations are selected with several obstacles. A * algorithm shows the ability to achieve the shortest path distance for mobile robot motion as well to avoid different obstacles. Thus, the A * algorithm can be an attractive choice to achieve the best shortest path distance for Mobile robot motion.