{'fraction_non_alphanumeric': 0.008857395925597875, 'fraction_numerical': 0.001771479185119575, 'mean_word_length': 4.8549222797927465, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Robust Maze Solving Algorithm for a Micromouse Robot

The problem of micromouse is 30 years old but its importance in the field of robotics is unparalleled, as it requires a complete analysis & proper planning to solve the problem. This paper proposes two computationally efficient algorithms for maze solving. Most of the reported algorithms explore complete maze before finding the shortest path to the center of the maze, thereby taking large exploration time. Our proposed algorithms take less time in maze exploration by exploring the maze partially and by traversing less number of cells to reach the center of the maze. An optimal method for maze solving with partial exploration of the maze can hardly be found applicable to all type of mazes, but our algorithms are found to be efficient in most of the cases. Simulation of our proposed algorithms on the some standard mazes show that one of the two algorithms described in this paper gives the better solution by only partially exploring the maze and the other algorithm also gives the comparative results when compared with the algorithms reported in the literature.