An Algorithm of Micromouse Maze Solving

This paper proposes a maze exploring algorithm named "Partition-central Algorithm", which is used to find the shortest path in a micromouse competition maze. A standard 16*16 units maze is divided into 12 partitions in this algorithm. Depending on the absolute direction of the micromouse a...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 10th International Conference on Computer and Information Technology pp. 1995 - 2000
Main Authors Jianping Cai, Xuting Wan, Meimei Huo, Jianzhong Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Algorithm design and analysis
Chromium
Legged locomotion
Load modeling
Maze
Micromouse
Partition-central Algorithm
Partitioning algorithms
Simulator
Software
Software algorithms
Online AccessGet full text
ISBN1424475473
9781424475476
DOI10.1109/CIT.2010.337

Cover

More Information
Summary:This paper proposes a maze exploring algorithm named "Partition-central Algorithm", which is used to find the shortest path in a micromouse competition maze. A standard 16*16 units maze is divided into 12 partitions in this algorithm. Depending on the absolute direction of the micromouse and the locations of each partition, exploring rules alter when the micromouse walks to optimize the maze exploring process. A simulation program is developed to verify the algorithm. The test result shows that Partition-central algorithm has higher average efficiency when compared with other algorithms.
ISBN:1424475473
9781424475476
DOI:10.1109/CIT.2010.337