计算机与现代化 ›› 2012, Vol. 208 ›› Issue (12): 23-28.doi: 10.3969/j.issn.1006-2475.2012.12.007

• 算法设计与分析 • 上一篇    下一篇

物联网环境下的助盲寻物机器人动态路径规划

王震,陈跃鹏   

  1. 北京理工大学珠海学院计算机学院,广东珠海519085
  • 收稿日期:2011-12-28 修回日期:1900-01-01 出版日期:2012-12-22 发布日期:2012-12-22

Dynamic Path Planning of Blind-aid Robot Under Internet of Things Environment

WANG Zhen, CHEN Yue-peng   

  1. College of Computer Science and Technology, Zhuhai Campus, Beijing Institute of Technology, Zhuhai 519085, China
  • Received:2011-12-28 Revised:1900-01-01 Online:2012-12-22 Published:2012-12-22

摘要: 近年来,盲人及低视力患者日益增多,世界上针对盲人及低视力患者的科研开发日渐普遍,基于RFID助盲语音寻物机器人是为了解决盲人家居寻物不便而开发的一款嵌入式产品。系统以盲人生活空间作为参考,构建虚拟仿真地图,并在寻径过程中实时监测现实环境更新仿真地图,动态规划寻径算法。参考Dijkstra算法与A Star算法,构建栅格法实现局部最优路径规划;参考蚁群算法构建出路径存储修正算法,与环路修正算法一起对栅格法进行修正和补充,逐步实现对全局最优路径的规划。降低了存储空间和提高了寻径效率,减少物理实现所需要功耗与实践,准确而且高效为盲人规划出最优前进路径,并引导盲人到达寻物点。

关键词: 助盲, 实时监测, 动态规划, 环路遍历, 栅格法

Abstract: In recent years, blinds and low vision patients are increasing, the research for blinds and low vision patients becomes increasingly common. The robot based on RFID is an embedded product, it’s in order to solve the blinds household scavenger inconvenience. The system references blinds living space, constructs virtual simulation maps, and updates the simulation maps when it monitoring the realistic environment, dynamic programming algorithm for path. It references Dijkstra and A Star routing algorithm, constructs grid method to realize local optimum path planning; References ant colony algorithm, constructs the path storage correction algorithm. And together with the loop correction algorithm(userdefined), revises and adds the grid algorithm, and then realizes the global optimal path gradually. It reduces the memory space and improves the efficiency of the search path. It also reduces the power consumption and practice for physically realizable. The robot can accurate and efficient for the blind planning the optimal forward path, and lead the blinds to scavenger terminal.

Key words: blinds help, real-time detection, dynamic programming, loop traverse, grid algorithm

中图分类号: