Engineered for Excellence: The Fastest Robot on the Grid

Autonomous Navigation

Our autonomous navigation algorithm uses backtracking to explore all possible combinations of towers and determine the shortest path. The algorithm recursively checks each potential route between the towers, evaluating all possibilities. It then selects the shortest path found, ensuring the towers are visited in the most efficient way while avoiding obstacles. This approach solves the Traveling Salesman Problem on a grid. This method is most feasible when the grid remains small.