A* Search Algorithms are used to find the shortest path from A to B while avoiding obstacles in the path.
There are a number of such algorithms, and I'm not going to explain them here, but rather point you to some very good videos and some working Open Source Code that you can use in your own robot or game design.
Path Finding 0.1.1
- A* (using Manhattan distance)
- A* (using Euclidean distance)
- A* (using Chebyshev distance)
- Bi-Directional Breadth-First-Search
Meanwhile, this is a Client/Server application. You should start the server first and then the client.
Also, you can start the server on one machine and run the client on a different machine, as long as the two machines are connected.
Requires Python 2.6+ and Pygame
Win32 Binary Distribution:
Guiding a Robot with A*
Visual explanation of A* Algorithm
For a tutorial on how A* Path finding works please check out --> https://www.youtube.com/watch?v=KNXfSOx4eEE
Wikipedia: A* Search Algorithm