Which pathfinding algorithm should i use with my robot?

Question

We want to make a robot which takes the shortest path from start to finish. The arena consists of multiple obstacles in between. In this case which path finding algorithm would be useful.

Answer 1

Of course, this will depend on many factors such as what information is available to the robot (can the robot see the entire arena?, etc.), what your processing power is, etc.

A good starting point that does not require too much computation is to create a 2d binary matrix of walkable/obstacle values to represent the arena and run an A* algorithm on it.

Good luck : )

Answer 2

Thanks for your suggestion