Realtime physics engine for robots movement

In our investigation we focus on the A* Algorithm, which is widely used in the video games design theories. A* algorithm is the most common choice for solving the path-finding problems, because it´s fairly flexible and can be used in a wide range of contexts. The main problem of A* Algorithm is the finite computer memory. When in need of finding a path on considerably large map, computer have to remember complex list of examined and open nodes, which can occupy most 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.