Mobile Robot Platform for Real-Time search Algorithms

In our investigation we focus on the A* Algorithm, for solving path-finding problems, because it is fairly flexible and can be used in a wide range of contexts. The main problem of A* Algorithm is the finite computer memory. Using this method, the robot can decide how to move from end to end point in an efficient manner without colliding with previously mapped obstacles. When in need of finding a path on considerably large map, computer has to remember a complex list of examined and open nodes, which can occupy most of free space in computer memory. Nonetheless, this solution shows the best results and it is worth analyzing as the algorithm for the intelligent robot movements.