期刊文献+

未知环境下改进的基于RRT算法的移动机器人路径规划 被引量:49

Improved Path Planning Based on Rapidly-Exploring Random Tree for Mobile Robot in Unknown Environment
原文传递
导出
摘要 将快速扩展随机树(RRT)算法与基于滚动窗口的路径规划相结合,提出一种改进的移动机器人路径规划算法.该方法利用机器人实时测得的局部环境信息,以滚动方式进行在线规划,克服了RRT算法通常只能在已知环境中进行移动机器人路径规划的限制,拓展了应用范围.规划时只考虑窗口环境地图,不必计算障碍物边线的解析式,节省了存储空间,算法实时性得以保证.在此基础上,算法引入启发式估价函数,使得随机树易于朝目标点方向生长.同时,运用回归分析生成新节点,避免了可能产生的局部极小,增强了算法搜索未知空间的能力.最后仿真实验验证了该方法的有效性. An improved path planning algorithm is proposed by combining rapidly-exploring random tree (RRT) and rolling path planning. In this algorithm, the real-time local environment information detected by the robot is fully used and the on-line planning is performed in a rolling style. Therefore, the RRT algorithm can be used in both known and unknown environment. Only the local environmental map is calculated in the planning to improve the planning efficiency, and thus the planning in real time is guaranteed. The calculation of analytical expressions of the obstacle can be ignored. Hence, the memory is saved greatly. Based on the algorithm of rapidly-exploring random, the heuristic evaluation function is introduced into the improved algorithm, so that the exploring random tree can grow in the direction of target point. The regression analysis, which avoids local minimum, enhances the capability of searching unknown space. The simulation results verify the effectiveness of the improved algorithm.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2009年第3期337-343,共7页 Pattern Recognition and Artificial Intelligence
基金 国家863计划资助项目(No.2006AA04Z238)
关键词 移动机器人 路径规划 滚动规划 快速扩展随机树(RRT) Mobile Robot, Path Planning, Rolling Plan, Rapidly-Exploring Random Tree (RRT)
  • 相关文献

参考文献19

  • 1蔡自兴,贺汉根,陈虹.未知环境中移动机器人导航控制研究的若干问题[J].控制与决策,2002,17(4):385-390. 被引量:119
  • 2LaValle S M. Planning Algorithms. Illinois, USA: University of Illinois Press, 2004.
  • 3LaValle S M. Rapidly-Exploring Random Trees: A New Tool for Path Planning. Technical Report, TR98-11, Ames, USA: Iowa State University. Department of Computer Science, 1998.
  • 4LaValle S M, Kuffner J. Rapidly-Exploring Random Trees: Progress and Prospects// Proc of the International Workshop on Algorithmic Foundations of Robotics. Hanover, USA, 2000:45 -59.
  • 5张纯刚,席裕庚.动态未知环境中移动机器人的滚动路径规划及安全性分析[J].控制理论与应用,2003,20(1):37-44. 被引量:31
  • 6Laumond J P, Sekhavat S, Lamiraux F. Guidelines in Nonholonomic Motion Planning for Mobile Robots. Lectures Notes in Control and Information Sciences, 1998, 229:1-53.
  • 7Melchior N A, Simmons R. Particle RRT for Path Planning with Uncertainty// Proc of the IEEE International Conference on Robotics and Automation, Roma, Italy, 2007 : 1617 - 1624.
  • 8Kuffncr J J Jr, LaValle S M. RRT-Conncct : An Efficient Approach to Single-Query Path Planning // Proc of the IEEE International Conference on Robotics and Automation. San Francisco, USA, 2000, II: 995 -1001.
  • 9Cheng Peng. Reducing RRT Metric Sensitivity for Motion Planning with Differential Constraints. Master Dissertation. Ames, USA: Iowa State University. Graduate College, 2001.
  • 10de Smith J. Distance and Path: The Development, Interpretation and Application of Distance Measurement in Mapping and Modeling. Ph. D Dissertation. London, UK: University of London, 2003.

二级参考文献25

  • 1张纯刚,席裕庚.Robot path planning in globally unknown environments based on rolling windows[J].Science China(Technological Sciences),2001,44(2):131-139. 被引量:12
  • 2朱淼良,吴春明,张友军,金毅,李捷.基于多智能体的实时并发式智能机器人结构[J].高技术通讯,1995,5(10):20-24. 被引量:4
  • 3贺汉根 徐昕.增强学习在移动机器人导航控制中的应用[J].中南工业大学学报,2000,31:170-173.
  • 4徐昕.增强学习及其在移动机器人导航与控制中的应用[M].长沙:国防科技大学,2002..
  • 5席裕庚,预测控制,1993年
  • 6REIF J, SHARIR M. Motion planning in the presence of moving obstacles [ A]. Proc of the 26 th IEEE Conf on Foundations of Computer Science [ C]. Washington, DC: IEEE Computer Society Press, 1985,144- 154.
  • 7CANNY J, REIF J. New lower bound techniques for robot motion planning problems [ A]. Proc of the 28th IEEE Conf on Foundations of Computer Science [C]. Washington, DC: IEEE Computer Society Press, 1987,49 - 60.
  • 8KANT K, ZUCKER S W. Toward efficient trajectory planning: the path-velocity decomposition [J]. Int J of Robotics Research, 1986, 5(3) :72 - 89.
  • 9ERDMANN M, LOZANO-PEREZ T. On multiple moving objects[J]. Algorithmica, 1987,2(4) :477 - 521.
  • 10FUJIMURA K, SAMET H. Time-minimal paths among moving obstacles [A]. Proc of IEEE Conf on Robotics and Automation [C].Washington, DC:IEEE Computer Society Press, 1989, 1110- 1115.

共引文献215

同被引文献363

引证文献49

二级引证文献444

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部