A bit of routine maintenance on the maze code for my micromouse turned into a possible real problem that has been waiting to surface for years now. In spite of running much the same flooding and path generating code since my first successful mouse many years back, I now discover it could have failed on… Read More »
With googletest set up for use with the the Netbeans IDE it is relatively easy to start working on your code using Test Driven Development Methods. This article shows you how to develop a simple set of library functions using TDD.
Netbeans is my favoured IDE for C/C++ development. It has some support for test driven development but not for Googletest which I like for its simplicity. Find out how to use Googletest in Netbeans for embedded TDD.
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.
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.
State machines are very useful tools in any computer system. They make it easy to visualise and solve all kinds of problems. Any small robot is likely to have a use for several state machines. This introduction looks at some basic types of state machine and an easy way to implement them.
Learn how you can calculate the standard deviation, or spread, of your sensor readings on-the-fly while collecting data without having to first record all the values and then do the statistics.
Designing electronic circuits takes knowledge and experience. Sooner or later, you have to put your idea to the test. Generally, this means building a prototype. Even with the best circuit simulator software, you ended up with unfriendly or expensive products. Or both. Now you can do a good job with an online circuit simulator tool… Read More »
The commonly published approach to using the bit banding feature of the Cortex Mx family of processors is to use macros – see Bit Banding in the STM32. This post describes an alternate implementation that uses a dedicated RAM section for bit banding.
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 »