I'm doing a line maze robot without the use of a microcontroller. I use backtracking to determined the correct paths and store them in memory but the thing is, after the robot reaches the end goal, it has to go back and traverse the successful path back to the start line.My instructor advises us to follow a stacking algorithm but how do we determine that the data inputted is that of the successful path??
I'm doing a line maze robot without the use of a microcontroller. I use backtracking to determined the correct paths and store them in memory but the thing is, after the robot reaches the end goal, it has to go back and traverse the successful path back to the start line.My instructor advises us to follow a stacking algorithm but how do we determine that the data inputted is that of the successful path??
When you say "without the use of a microcontroller", do you mean your control software is running on a PC or similar?
A stack should do the trick. Think about what happens as the robot moves through the maze: as you explore each new segment, push it onto the stack; if it's a dead end, backtrack to the previous unexplored segment branch and pop the bad segment off the stack. What's left when you finally make it to the end of the maze is your path.
Glad to have helped. Pretty impressive doing this without a uC or PC. We get a lot of cries for help on this board from "final year engineering" students whose schools (or instructors) don't seem to teach them anything.
Sounds like a near impossible task to me. You would end up with something like the early pong games. A board about 20 inches on each side fully populated with ttl chips.