Time Constraint Finite-Horizon Path Planning Solution for Micromouse Extreme Problem

摘要

The original Micromouse competition was designed to educate future engineers, in robotic problem solving through active learning methods. The Micromouse Extreme (ME) Competition is proposed, to augment the pedagogical power of the original competition with a modern task set requiring skills in deep learning and creative solving methods. It also preserves the goal of original Micromouse Problem will to educate future engineers in robotic problem solving through active learning methods. The ME is a natural evolution to the simple programming nature of the original competition through the incorporation of advanced robotic tools and ideas. The platform described is fully virtual and inexpensive, providing an excellent platform for students to further their robotics education. As such, several methods of solving this setup are required to guide students along their path to proficiency in path planning. This paper discusses solutions to the ME problem such as the Traveling Salesman Problem and similar solvers to suit the proposed need. Once the problem is established we solve it using Time Constraint Finite Horizon Path Planning solution. The approach can provide a guaranteed global optimal path solution for the ME problem and can introduce students to solving methods for complex problems.