期刊文献+

融合改进A^(*)与DWA的轮式机器人路径规划 被引量:1

Path planning of wheeled robot based on improved A^(*) and DWA
下载PDF
导出
摘要 针对轮式机器人在路径规划中存在的问题,提出融合改进A^(*)和DWA的轮式机器人路径规划方法。首先针对A^(*)算法冗余点多、耗时长、拐点多等问题,提出双向A^(*)和跳点算法相结合来提升全局路径规划效率;其次针对DWA寻找的路径非最优以及无法应变环境的问题,选取全局最优路径上优化后的跳点作为DWA的关键点,引入关键点评价子函数和自适应速度权值。融合改进的A^(*)和DWA算法,既保证了全局路径最优,还可根据障碍物数量和分布,调整速度权值,兼顾速度和安全性。经在MATLAB仿真环境中验证:融合改进A^(*)和DWA的轮式机器人路径规划方法与传统A^(*)算法相比,大幅减少了规划时长和拓展节点数量,效率明显提升;与DWA算法相比,加入全局路径关键点和自适应速度权值,能遵循全局最优路径以及降低了运行时间,提升效率。 Aiming at the problems of path planning for wheeled robots,a path planning method for wheeled robots based on improved A^(*)and DWA is proposed.Firstly,aiming at the problems of redundant points,time-consuming and inflection points of A^(*)algorithm,a combination of bidirectional A^(*)and hop point algorithm is proposed to improve the efficiency of global path planning;Secondly,aiming at the problem that the path searched by DWA is not optimal and cannot adapt to the environment,the optimized jump point on the global optimal path is selected as the key point of DWA,and the key point evaluation sub function and adaptive speed weight are introduced.The fusion of improved A^(*)and DWA algorithm not only ensures the global optimal path,but also adjusts the speed weight according to the number and distribution of obstacles,taking into account the speed and safety.In the MATLAB simulation environment,it shows that:compared with the traditional A^(*)algorithm,the planning time and the number of expansion nodes are greatly reduced,and the efficiency is significantly improved;Compared with DWA algorithm,adding global path key points and adaptive speed weights can follow the global optimal path,reduce the running time and improve the efficiency.
作者 游向荣 方海龙 唐瑞东 YOU Xiangrong;FANG Hailong;TANG Ruidong(College of Automobile and Traffic Engineering,Wuhan University of Science and Technology,Wuhan 430065,China)
出处 《智能计算机与应用》 2021年第11期14-20,共7页 Intelligent Computer and Applications
关键词 双向A^(*) JPS DWA 自适应速度权值 路径规划 Bidirectional A^(*) JPS DWA Adaptive velocity weights Path planning
  • 相关文献

参考文献7

二级参考文献54

  • 1HaraborD, Grastien A. Online Graph Pruning for Pathfinding on Grid Maps[C]//Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. San Francisco, California, USA: The AAAI Press, 2011:1114-1119.
  • 2Patel A. Amit's A* Pages[EB/OL]. 199712015-08-26]. http://theory.stanford.edu/~amitp/GameProgramming/.
  • 3KorfR E. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search[J]. ArtificialIntelligence, 1985,(27):97-109.
  • 4Stentz A. Optimal and Efficient Path Planning forPartially-Known Environments[C].Proceedings IEEEInternational Con- ference on Robotics and Automation. SanDiego:[s.n.], 1994:3310-3314.
  • 5Koenig S, Likhachey M,Furcy D. Lifelong Planning A*[J]. ArtificialIntelligence Journal, 2004, 155(1-2): 93-146.
  • 6BoteaA, M"ullerM, SchaefferJ. Near OptimalHierarchical Path-Finding[J]Journal of Game Development, 2004, 1(1):7-28.
  • 7Likhachev M,Ferguson D,Gordon G, et al. Anytime Dynamic A*: An Anytime, replanningAlgorithm[C]//Proceedings of the International Conference on Automated Planning and Scheduling(ICAPS). Menlo Park, CA, USA: AAAI, 2005: 262-271.
  • 8Nash A, Daniel K, Koenig S, et al. Theta*: Any-Angle Path Planning on Grids[C]//Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. Vancouver,Canada:, AAAI Press, 2007: 1177-1183.
  • 9Harabor D, Botea A, Kilby P. Path Symmetries in Uniform-Cost Grid Maps[C].Proceedings of 9th Symposium on Abstrac- tion Reformulation and Approximation (SARA). Barcelona, Spain, 2011.
  • 10Podhraski T.How to Speed Up A* Pathfindingwith the Jump Point Search Algorithm[EB/OL].(2013-03-12)[2015-08-26]. htt p: //gamedevelopment .tutsplus.com/t utorials/ how-to-speed-up-a-pat hfinding-wit h-t he-j ump-point-search-algorithm-ga medev-5818.

共引文献140

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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