| 基于机器人迷宫搜索中心算法的优化 |
| |
| 引用本文： | 康冰,梁艳磊.基于机器人迷宫搜索中心算法的优化[J].长春师范学院学报,2011(8):25-29. |
| |
| 作者姓名： | 康冰 梁艳磊 |
| |
| 作者单位： | 吉林大学通信工程学院 |
| |
| 摘 要： | 迷宫问题是图论等领域中的经典问题。为了缩短迷宫搜索中机器人的运行时间,本文以IEEE举办的电脑鼠大赛为背景,介绍一种含优先级权限设置的路口记忆模式算法,并通过数学建模和定性分析,证明了此模式的可行性。
|
| 关 键 词： | 电脑鼠 算法 终点绕行 优先级 |
The Optimization of Central Algorithm Based on Robot Maze Searching |
| |
| KANG Bing,LIANG Yan-lei.The Optimization of Central Algorithm Based on Robot Maze Searching[J].Journal of Changchun Teachers College,2011(8):25-29. |
| |
| Authors: | KANG Bing LIANG Yan-lei |
| |
| Institution: | (College of Communication Engineering,Jilin University,Changchun 130023,China) |
| |
| Abstract: | Maze problem is a classical problem in graph theory and other fields.In order to shorten the searching time of robot in maze,an intersection memory mode algorithm with priority rights configuration based on IEEE Micromouse Competition is introduced,and the feasibility of the mode is proved by mathematical modeling and qualitative analysis. |
| |
| Keywords: | Micromouse algorithm destination circuitousness priority |
| 本文献已被 CNKI 等数据库收录！ |
|
