The first article that I used as a reference for Zeetah I’s solver was published in Byte Magazine back in 1987. Fortunately for me, this article was printed right around the time we were making Zeetah I. Stephen E. Belter, Computer-aided Routing of Printed Circuit Boards: an Examination of Lee’s Algorithm and Possible Enhancements, BYTE, June… Read More »
This part of the series on creating a diagonal micromouse maze solver presents the actual pseudo code that was used to implement a diagonal solver and it closely matches the C implementation. You will want to check out some of the data structures in the previous post (Diagonal Solver Data Structures).
This post describes the data structures used in the diagonal solver.
This post provides more details on how the flooding is done.
Edo Franzi is the designer of the famous Khepera Robot. He first developed uKOS, a multi-tasking OS for the 68k processors, as part of that project. uKOS was subsequently re-written in C and is now available, as uKOS-II, for a range of processors including the ARM Cortex M3 and M4 processors like the STM32 series.
If the maze has a region as shown on the left, and the mouse enters the region on the bottom left and exits on the right side, which path will your solver generate for the mouse?
Came across this visualization for a maze solver. http://qiao.github.com/PathFinding.js/visual/
It seems every time I implement fixed point math, I have to relearn it. In my latest project, I’m using the notation below and it has gone the easiest I can remember.