DocumentCode :
2202965
Title :
An Algorithm of Micromouse Maze Solving
Author :
Cai, Jianping ; Wan, Xuting ; Huo, Meimei ; Wu, Jianzhong
Author_Institution :
City Coll., Sch. of Comput. Sci., Zhejiang Univ., Hangzhou, China
fYear :
2010
fDate :
June 29 2010-July 1 2010
Firstpage :
1995
Lastpage :
2000
Abstract :
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.
Keywords :
microrobots; mobile robots; path planning; embedded micro-control-chip; maze exploring algorithm; micromouse competition maze; micromouse maze solving; partition-central algorithm; simulation program; wheeled robot; Algorithm design and analysis; Chromium; Legged locomotion; Load modeling; Partitioning algorithms; Software; Software algorithms; Maze; Micromouse; Partition-central Algorithm; Simulator;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location :
Bradford
Print_ISBN :
978-1-4244-7547-6
Type :
conf
DOI :
10.1109/CIT.2010.337
Filename :
5578409
Link To Document :
بازگشت