欧阳子路, 王鸿东, 王检耀, 易宏. 基于改进Bi-RRT的无人水面艇自动避碰算法[J]. 中国舰船研究, 2019, 14(6): 8-14. DOI: 10.19693/j.issn.1673-3185.01450
引用本文: 欧阳子路, 王鸿东, 王检耀, 易宏. 基于改进Bi-RRT的无人水面艇自动避碰算法[J]. 中国舰船研究, 2019, 14(6): 8-14. DOI: 10.19693/j.issn.1673-3185.01450
Ouyang Zilu, Wang Hongdong, Wang Jianyao, Yi Hong. Automatic collision avoidance algorithm for unmanned surface vessel based on improved Bi-RRT algorithm[J]. Chinese Journal of Ship Research, 2019, 14(6): 8-14. DOI: 10.19693/j.issn.1673-3185.01450
Citation: Ouyang Zilu, Wang Hongdong, Wang Jianyao, Yi Hong. Automatic collision avoidance algorithm for unmanned surface vessel based on improved Bi-RRT algorithm[J]. Chinese Journal of Ship Research, 2019, 14(6): 8-14. DOI: 10.19693/j.issn.1673-3185.01450

基于改进Bi-RRT的无人水面艇自动避碰算法

Automatic collision avoidance algorithm for unmanned surface vessel based on improved Bi-RRT algorithm

  • 摘要:
      目的  提出一种实现无人水面艇(USV)在高速航行时自动规避障碍物的方法。
      方法  将双向搜索树(Bi-RRT)算法与速度障碍法相结合,得到基于改进Bi-RRT的无人水面艇自动避碰算法。针对Bi-RRT算法扩展操作中父节点延伸方向位于锥形碰撞区内的情况,提出避碰危险度系数与障碍物排斥向量,使父节点延伸方向有远离障碍物中心的趋势。同时,针对算法实时性问题,提出两棵搜索树并行延伸扩展的方式,以及当父节点延伸方向位于锥形碰撞区外时触发的目标吸引向量,以加速算法收敛。
      结果  结果显示,采用上述改进方法设计的算法搜索树延伸失败次数降低,规划的避碰路径短且更加平滑。
      结论  该改进Bi-RRT算法实时性强、路径规划质量高,对实际工程应用有重要意义。

     

    Abstract:
      Objectives  This method is proposed for automatic collision avoidance during high-speed running of the Unmanned Surface Vessel(USV).
      Methods  The Bi-RRT algorithm was combined with the velocity obstacle algorithm for automatic collision avoidance algorithm for USV based on improved Bi-RRT algorithm. In view of the situation of the extension direction of the parent node inside the collision cone in the extended operation of Bi-RRT algorithm, the 'collision risk index' and 'obstacle repellent vector' were presented, making the extension direction of the parent node tend to move away from the obstacle. In addition, in view of the real time problem of the algorithm, the strategy of parallelly extending two search trees and the 'target attraction vector' when the extension direction of the parent node is outside the collision cone were introduced to accelerate the convergence of the algorithm.
      Results  The results show that the algorithm using above-mentioned improvement method has reduced failed extension times of search tree, and the planned collision-free paths are shorter and smoother.
      Conclusions  The research shows that the improved Bi-RRT algorithm has the advantages of high real-time performance and high path planning quality, which are of great significance for practical engineering application.

     

/

返回文章
返回