期刊文献+

一种水面无人艇多任务点路径规划方法 被引量:2

A multi-task point path planning method for unmanned surface vehicles
下载PDF
导出
摘要 为解决多障碍物环境下水面无人艇(unmanned surface vehicle,USV)多任务点路径规划问题,提出一种基于改进的快速探索随机树(rapidly-exploring random tree,RRT)的路径规划算法。在分析USV运动数学模型和经典RRT算法的基础上,将USV的运动数学模型融合到RRT算法中,预报两个任务点之间的路径曲线和距离;针对RRT算法随机性的特点,设计RRT路径优化算法,删除冗余路径点,得到优化路径;最后利用改进遗传算法,确定多任务点的访问顺序,生成多任务点路径,节省USV巡航路径距离。仿真结果证明,在多任务点及多障碍物存在的条件下,该方法能够确定一条合理的路径,具有一定的实际意义。 In order to solve the problem of multi-task point path planning for unmanned surface vehicles(USVs)in the multi-obstacle environment,a path planning algorithm based on the improved rapidly-exploring random tree(RRT)is proposed.Based on the analysis of USV’s motion mathematical model and the classical RRT algorithm,the USV’s motion mathematical model is integrated into the RRT algorithm,and the path curve and distance between two task points are forecasted.According to the randomness of RRT algorithm,an RRT path optimization algorithm is designed to delete the redundant path points so as to get an optimized path.Finally,the improved genetic algorithm is used to determine the access sequence of multi-task points and generate the multi-task point path,which can save the USV cruise path distance.The simulation result shows that the proposed method can determine a reasonable path under the condition of multi-task points and multiple obstacles,and has a certain practical significance.
作者 刘渐道 张英俊 朱飞祥 LIU Jiandao;ZHANG Yingjun;ZHU Feixiang(Navigation College,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处 《上海海事大学学报》 北大核心 2021年第4期1-6,共6页 Journal of Shanghai Maritime University
基金 国家自然科学基金(51679025) 中央高校基本科研业务费专项资金(3132019313) 大连海事大学教学改革项目(00390001)。
关键词 水面无人艇(USV) 多任务点路径规划 快速探索随机树(RRT) 运动学约束 unmanned surface vehicle(USV) multi-task point path planning rapidly-exploring random tree(RRT) kinematical constraint
  • 相关文献

参考文献15

二级参考文献141

  • 1刘磊,向平,王永骥,俞辉.非完整约束下的轮式移动机器人轨迹跟踪[J].清华大学学报(自然科学版),2007,47(z2):1884-1889. 被引量:20
  • 2孙波,陈卫东,席裕庚.基于粒子群优化算法的移动机器人全局路径规划[J].控制与决策,2005,20(9):1052-1055. 被引量:76
  • 3李源惠,潘明阳,吴娴.基于动态网格模型的航线自动生成算法[J].交通运输工程学报,2007,7(3):34-39. 被引量:24
  • 4L Kayraki, Svestka P, Latombe J, et al. Probabilistic roadmaps for path planning in high-dimensional configurations paces[ J]. IEEE Transactions on Robotics and Automation, 1996, 12(4) : 566 - 580.
  • 5B Milam M.Real-Time Optimal Trajectory Generation for Constrained Dynamical Systems [ D ]. California Institute of Technology, 2003.
  • 6Emer Koyuncu, G I. A probabilistic B-spline motion planning algorithm for unmanned helicopters flying in dense 3D environment[ A ]. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems[ C ], Nice, France, 2008,815 - 821.
  • 7S LaValle, J Kuffner. Rapidly-exploring random trees: Progress and prospects[ A]. Proceedings of Algorithmic and Computational Robotics:New Directions[ C] .2001,293 - 308.
  • 8J Kuffner, S LaValle. An efficient approach to single-query path planning[ A]. Proceedings of IEEE International Conference on Robotics and Automation[ C]. IEEE Press,2000.995 - 1001.
  • 9M B Miliam. Real-Time Optimal Trajectory Generation for Constrained Dynamical Systems [ D ]. California Institute of Technology, 2003.
  • 10Arkin R C. Behavior-based robotics[M]. 1st ed. Cambridge, USA: MIT Press, 1998: 1-3.

共引文献328

同被引文献22

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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