计算机工程 ›› 2018, Vol. 44 ›› Issue (9): 9-14.doi: 10.19678/j.issn.1000-3428.0048175

所属专题: 智能机器人专题

• 智能机器人专题 • 上一篇    下一篇

基于概率距离的电脑鼠走迷宫融合算法研究

袁臣虎,路亮,王岁,李海杰,刘奇   

  1. 天津工业大学 电工电能新技术天津市重点实验室,天津 300387
  • 收稿日期:2017-07-30 出版日期:2018-09-15 发布日期:2018-09-15
  • 作者简介:袁臣虎(1979—),男,副教授,主研方向为电脑鼠软硬件开发、嵌入式控制系统、运动控制与线控转向技术;路亮、王岁、李海杰、刘 奇,硕士研究生。
  • 基金项目:

    国家自然科学基金面上项目(51577133)。

Research on Micromouse Walking Maze Fusion Algorithm Based on Probability Distance

YUAN Chenhu,LU Liang,WANG Sui,LI Haijie,LIU Qi   

  1. Tianjin Key Laboratory of Advanced Technology of Electrical Engineering and Energy, Tianjin Polytechnic University,Tianjin 300387,China
  • Received:2017-07-30 Online:2018-09-15 Published:2018-09-15

摘要:

针对传统电脑鼠迷宫搜索算法无法适应随机迷宫图搜索的问题,提出一种新的电脑鼠走迷宫融合算法。运用概率距离将迷宫划分为八 区域,标定各区域概率距离特征并进行算法填充,实现概率距离向心算法和洪水算法的高效融合,提高迷宫搜索效率并降低对高性能 CPU的依赖性。通过对6张迷宫的测试结果表明,与传统向心和洪水算法相比,该算法迷宫搜索时间可减少50%,搜索成功率达到100%,是 一种高效的迷宫融合搜索算法。

关键词: 电脑鼠, 向心算法, 概率距离, 区域划分, 迷宫

Abstract:

Aiming at the problem that the traditional micromouse maze search algorithm can not adapt to the random mazemap search,a new micromouse walking maze fusion algorithm is proposed.The algorithm uses the probability distance to divide the maze into eight regions,calibrates the probability distance features of each region and fills the algorithm to achieve efficient fusion of the probabilistic distance centripetal algorithm and the flood algorithm,improving the maze search efficiency and reducing the dependence on the high-performance CPU.Test results of 6 mazes show that,compared with the traditional centripetal and flooding algorithms,the algorithm can reduce the maze search time by 50% and the search success rate by 100%,it is an efficient maze fusion search algorithm.

Key words: micromouse, centripetal algorithm, probability distance, region division, maze

中图分类号: