An extention of height value algorithm for micro-mouse robot applying for exploring unknown region

摘要

The micro-mouse competition is gaining immense popularity universally. This paper proposes algorithm referred to the “extended height value algorithm” which is developed to an advanced level, so that the artificial robot could be made capable of exploring unknown regions such as micro-mouse competition maze. All of the 256 units in the standard 16∗16 units maze are given a series of numbers, which represent discretely assigned potential levels of turning into the crossway during exploring task. The numbers will be taken into consideration when the robot makes the crossway choice as well as autonomous route decisions. Then the choices will alter when the micro-mouse walks in order to optimize the exploring process. The paper also demonstrates effective measures to avoid duplication exploring as much as possible with artificial intelligence technique. In order to verify the developed algorithm, a simple, yet effective simulation program is coded to show that the improved algorithm has higher average efficiency compared with the less intelligent traditional algorithms.