I am working on a project with a virtual robot (Turtles in the ComputerCraft module for Minecraft), where the robot will be in the labyrinth of tunnels and must navigate through them. The world is now divided into tiles (a 2D Cartesian graph of them with a boolean skip / non-transmittable value for each), and the construction of the tunnel robot will display them along the way.
In addition, in places where robots must quickly get between them, there are teleport porter shortcuts.
The question is: what is the best way to connect the robot with its purpose? How does the system identify areas that need teleporters? A * is the most famous algorithm, but are there others that can satisfy the application better? Please keep in mind that I have very little experience with path-finding algorithms, so you may have to deal with the basic conditions so that I can understand. Any suggestions?
source
share