Steve of SHARC was kind enough to set up the test maze in his garage so several of us from the club did a hacking session over there. We made pretty good progress. George had his bot going through the entire maze (then made some tweaks... you know how that goes...). I worked on primitive behaviors: wall following, turning a corner, and turning at the end of a hallway, and initially stitched these together a little bit to see how it'd work.
The next step is to put these behaviors into functions that drop out when "something" changes, then the control routine calls each of these primitive routines in the correct order to get through the maze. For example, follow the right hand wall until the wall disappears, then the control routine knows to call turn corner right or maybe keep going straight until there's a wall again. Looking at the Trinity arena map, these and a few other navigational primitives "should" get the robot through the entire maze. From the home position, wall follow right, turn corner right, turn at the end of the hall and you're in the room to the right of the home circle.
Mind you, all this is (so far) done without encoders or dead reckoning. More on that topic later.
Speaking of topics I've left dangling, don't worry, I'll get back to systems engineering eventually.
Meanwhile I have a crap ton to do and time is just about out!