An extension of micro mouse on WEBOTS using the flood filled algorithm, A star, Dijkstra’s and Breadth first search algorithm for moving the E-puck robot from start to goal in an NxM sized maze whose map was unknown to the robot (mapping and path planning). Further, leveraged Error Correction for accurate turning and recursive Backtracking algorithm for Maze Generation
I am very happy to see such a detailed optimization process. It is very helpful to me. As a beginner of webots, I would like to ask why the map is displayed like this after opening the world. After starting the simulation, the robot keeps falling and disappearing. Is one of my settings or operations incorrect? How can I observe the simulation process from a normal perspective? Thank you again for your excellent contributions