Diagonal paths for a micromouse using a state machine

To get the shortest possible run times, a micromouse must be able to make full use of diagonal paths. By running a diagonal, slow, tricky turns are avoided and the distance is much less. No competitive micromouse can ignore diagonals. Diagonal Paths From the point of view of a human…

Continue ReadingDiagonal paths for a micromouse using a state machine

Smooth pathfinding with a state machine

A competitive micromouse must run a path made up of smooth turns rather than stopping for in-place turns. For novice builders of micromouse, this can seem a difficult task. Here is a method for creating a smooth path using data from flooding the maze. The method described here for generating…

Continue ReadingSmooth pathfinding with a state machine