A New Shortest Path Finding Algorithm for a Maze Solving Robot With Simulator

The problem of Micromouse i.e. A Maze Solving Robot is about 32 years old but its importance in the field of Robotics is unparalleled because it requires thorough analysis and paper work. Before it is implemented on the hardware it requires a great deal of planning i.e. an algorithm. The algorithm is the way or scheme using which the machine will solve the maze. The Algorithm for a Maze solving robot to find the shortest path in an unknown maze from a starting position to a destination probably the center. The algorithm plays a great role in the efficiency of the robot to solve the maze.

Resource Details

Provided by:
Kurukshetra University