期刊文献+

基于改进PRM算法的路径规划研究 被引量:25

Study on path planning based on improved PRM method
下载PDF
导出
摘要 为了解决传统PRM算法在处理窄通道问题时的缺陷,提出了一种改进的PRM算法。通过在规划环境中引入人工势场,对落在威胁体内的点施加势场力,使之移动到自由空间内,从而增加窄通道内的节点数量,在不增加采样次数的情况下完成路线图的构建。仿真结果表明,改进PRM算法提高了采样点的利用率,缩短了存在窄通道环境中的路径构建时间,在突发威胁时能快速完成路径生成。 This paper proposed an improved PRM,which focused on the problem of narrow passages in the configuration space.Considering the configuration space with narrow passages,it introduced the artificial potential field to apply force to the initial points on the obstacle.The force drove these points to the free space.Then these points could be used to construct the roadmap.The roadmap could be gotten by less sampling.The simulation results shows that the improved PRM method can increase the planning efficiency.The improved PRM method enables road maps to reliably capture the connectivity of configuration spaces with narrow passages,and it performs well when the threaten break out.
出处 《计算机应用研究》 CSCD 北大核心 2012年第1期104-106,139,共4页 Application Research of Computers
基金 航空科学基金资助项目(20090753008)
关键词 航迹规划 概率图法 无人机 窄通道 path planning probability roadmap method(PRM) UAV narrow passages
  • 相关文献

参考文献9

  • 1KAVRAKI L, LATOMBE J. Randomized preprocessing of configuration space for fast path planning [ C ]//Proc of IEEE International Conference on Robotics and Automation. 1994:3020-3026.
  • 2陈岩,苏菲,沈林成.概率地图UAV航线规划的改进型蚁群算法[J].系统仿真学报,2009,21(6):1658-1662. 被引量:10
  • 3BOOR V, OVERMARS M, Van der STAPPEN F. The Gaussian sampiing strategy for probabilistic roadmap planners [ C ]//Proc of IEEE International Conference on Robotics and Automation. New York: IEEE Prass, 1999 : I018-1023.
  • 4HSU D, JIANG T, REIF J,et al. The bridge test for sampling narrow passages with probabilistic roadmap planners [C]//Proc of IEEE International Conference on Robotics and Automation. New York:IEEE Press, 2003:4420 - 4426.
  • 5HSU D, SANCHEZ-ANTE G, CHENG Ho-lun. Multi-level free- space dilation for sampling narrow passages in PRM planning [ C ]//Proc of IEEE International Conference on Robotics and Automation. [ S. l, ] : IEEE Press ,2006 : 1255-1260.
  • 6FLAVIGNE D, TAIX M. Improving motion planning in weakly connected configuration spaces [ C ]//Proc of IEEE International Conference on Intelligent Robot and Systems. 2010:5900-5905.
  • 7PARK B, CHUNG W K. Adaptive node sampling method for probabilistic roadmap planners[ C]//Proc of IEEE/RSJ International Conference on Intelligent Robots and Systems. Piscataway, NJ:IEEE Press, 2009:4399-4405.
  • 8殷路,尹怡欣.基于动态人工势场法的路径规划仿真研究[J].系统仿真学报,2009,21(11):3325-3328. 被引量:51
  • 9孙汉昌,朱华勇.基于概率地图方法的无人机路径规划研究[J].系统仿真学报,2006,18(11):3050-3054. 被引量:18

二级参考文献29

  • 1金飞虎,洪炳熔,高庆吉.基于蚁群算法的自由飞行空间机器人路径规划[J].机器人,2002,24(6):526-529. 被引量:52
  • 2张捍东,郑睿,岑豫皖.移动机器人路径规划技术的现状与展望[J].系统仿真学报,2005,17(2):439-443. 被引量:119
  • 3马云红,周德云.基于遗传算法的无人机航路规划[J].电光与控制,2005,12(5):24-27. 被引量:60
  • 4况菲,王耀南.基于混合人工势场-遗传算法的移动机器人路径规划仿真研究[J].系统仿真学报,2006,18(3):774-777. 被引量:43
  • 5高国华.大范围多路径规划问题研究[D].长沙:国防科技大学,1999.
  • 6Robert J Szczerba, Peggy Galkowski, Ira S Glickstein, et al. Robust algorithm for real-time route planning [J]. IEEE Transaction on Aerospace and Electronic System (S0018-9251). 2000, 36(3): 869-878.
  • 7Israel A. Wagner, Michael Lindenbaum, Alfred M Bruckstein. Distributed Covering by Ant-Robots Using Evaporating Traces [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION (S1042-296X), 1999, 15(5): 918-933.
  • 8S S Ge, Y J Cui. New Potential Functions for Mobile Robot Path Planning [J]. IEEE Transactions on robotics and automation (S 1046-296X), 2000, 16(5): 615-620.
  • 9Barraquand J, Langlois B, Latom be J-C. Numerical Potential Field Techniques for Robot Path Planning [J]. IEEE Transactions on Systems, Manand Cybernetics (S0018-9472), 1992, 22(2): 224-241.
  • 10Sub S-H, Shin K G.A. Variational Dynamic Programming Approach to Robot-path Planning with a Distance-safety Criterion [J]. IEEE Journal of Robotics and Automation (S0882--4967), 1998, 4(3):334-349.

共引文献75

同被引文献244

引证文献25

二级引证文献186

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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