well in this kind of competition there is time to map the whole maze, because you don't know where the end is, so the time in the mapping part is not important
Nice! I have a couple observations and questions, though. First: What is the goal and/or how does your mouse detect the end state? Next, aren't you using a data structure that can map the path to the coordinates in the maze? I would think that if you were, you would (a) truncate the little pocket under the 6 (at 0:25) so you wouldn't need to revisit it later, and (b) even if you needed to backtrack to that 6, you could do so via 12->5->6 rather than the more circuitous route. Finally, how are your sensors configured? Are they simple optical proximity detectors, or do you use several sensors such that you can estimate wall distance? Are you developing with the intent to compete in the micromouse competitions? I think it's a pretty interesting competition, I've watched a good few videos on them.
yt feed gave me a random video about a micromouse competition, n after watched i became very curious about how the heck that tiny mouse can solve the maze n then know the quick way to go from start to the goal n vice versa with turbo speed :/
I get the same thing when playing Diablo 2 maps. Just pick one edge to follow. But Left or Right? Doesn't really matter, the choice will be wrong far more than 50% of the time, lol.
Can you please Explain to me, from where does the robot know that he has reached the end ? Whats the difference in geometry between field 12 and ,,End“ ?
If you know the start and end indices of the matrix, the robot will stop when its position matches the end index. The challenging part is mapping the maze using some form of position control with sensors.
as a begineer you can start with arduino and get familiar with the concepts while tinkering. And later you can achieve the depth of embedded systems by programming your own board with the baremetal programming for boards like stm32 based on arm m architecture
The micromouse knows where it is at all times. It knows this because it knows where it isn't. By subtracting where it is from where it isn't, or where it isn't from where it is (whichever is greater), it obtains a difference, or deviation. The guidance subsystem uses deviations to generate corrective commands to drive the micromouse from a position where it is to a position where it isn't, and arriving at a position where it wasn't, it now is. Consequently, the position where it is, is now the position that it wasn't, and it follows that the position that it was, is now the position that it isn't. In the event that the position that it is in is not the position that it wasn't, the system has acquired a variation, the variation being the difference between where the mouse is, and where it wasn't. If variation is considered to be a significant factor, it too may be corrected by the GEA. However, the mouse must also know where it was. The micromouse guidance computer scenario works as follows. Because a variation has modified some of the information the missile has obtained, it is not sure just where it is. However, it is sure where it isn't, within reason, and it knows where it was. It now subtracts where it should be from where it wasn't, or vice-versa, and by differentiating this from the algebraic sum of where it shouldn't be, and where it was, it is able to obtain the deviation and its variation, which is called error.
