A Micromouse Scanning and Planning Algorithm based on Modified Floodfill Methodology with Optimization

摘要

Micromouse is one of the most popular competitions among mobile robotics researchers. This competition brings together several challenges in the field of mobile robotics. It represents an excellent tool in competition field since it stimulates the development and multidisciplinary knowledge as well as group cooperation to carry out the best approach. This work presents a contribution to this issue on exploring the unknown environment and the robot location to obtain an optimized trajectory in the maze, using the modified Floodfill algorithm that considers the cost for the robot rotations around its axis. A comparison is conducted between the modified algorithm and the traditional Floodfill procedure.