首页 | 本学科首页   官方微博 | 高级检索  
     

基于栅格法的机器人快速路径规划
引用本文:于红斌,李孝安.基于栅格法的机器人快速路径规划[J].微电子学与计算机,2005,22(6):98-100.
作者姓名:于红斌  李孝安
作者单位:西北工业大学计算机学院,陕西,西安,710072
基金项目:西北工业大学校科研和教改项目,西北工业大学校科研和教改项目
摘    要:在栅格法表示的机器人路径规划问题研究中,定义出路径记忆量、路径方位的重要性等概念,通过可行路径中两两结点之间关联程度的改变,按照比例选择概率确定下一结点,由此得到一条新的可行路径.路径和关联程度之间形成一种正反馈机制,二者相互激励,从而简化了路径搜索方法,提高了路径搜索的效率.仿真研究表明,该算法能有效地提高路径搜索的效率.

关 键 词:栅格法  路径规划  避障
文章编号:1000-7180(2005)06-098-03

Fast Path Planning Based on Grid Model of Robot
YU Hong-bin,LI Xiao-an.Fast Path Planning Based on Grid Model of Robot[J].Microelectronics & Computer,2005,22(6):98-100.
Authors:YU Hong-bin  LI Xiao-an
Abstract:A new and fast path planning method based on grid model is proposed for robot. Through our research, the concept of memory quantity and importance of path direction are put forward. The choice of next node is solved with proportional select probability by the change between the relations of two nodes in a feasible path, and a new feasible path can be finally fixed. So, A positive feedback exists between paths and the relations of two crunodes, they inspire with each other. The simulation result indicates that our method is efficient for improving the efficiency of path searching.
Keywords:Grid model  Path planning  Obstacle-avoidance    
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号