Fast grid based collision avoidance for vessels using A∗ search algorithm

Michael Blaich, M. Rosenfelder, Michael Schuster, O. Bittel, J. Reuter
{"title":"Fast grid based collision avoidance for vessels using A∗ search algorithm","authors":"Michael Blaich, M. Rosenfelder, Michael Schuster, O. Bittel, J. Reuter","doi":"10.1109/MMAR.2012.6347858","DOIUrl":null,"url":null,"abstract":"In this work a real-time grid based collision avoidance algorithm for vessels in maritime environments is presented. Most grid based collision avoidance approaches use Lee's algorithm to find an optimal collision-free path. The drawback of this algorithm is the long runtime for large grids. To reduce this runtime, in this work the A* search is used instead of Lee's algorithm. The algorithm additionally regards the physical constrains of the vessel and pays attention to the COLREGs. The runtime and the resulting path of Lee's algorithm and the A* search are compared in computational experiments. Furthermore, the performance of the collision avoidance on a real vessel on the Lake Constance is presented.","PeriodicalId":305110,"journal":{"name":"2012 17th International Conference on Methods & Models in Automation & Robotics (MMAR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 17th International Conference on Methods & Models in Automation & Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2012.6347858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

In this work a real-time grid based collision avoidance algorithm for vessels in maritime environments is presented. Most grid based collision avoidance approaches use Lee's algorithm to find an optimal collision-free path. The drawback of this algorithm is the long runtime for large grids. To reduce this runtime, in this work the A* search is used instead of Lee's algorithm. The algorithm additionally regards the physical constrains of the vessel and pays attention to the COLREGs. The runtime and the resulting path of Lee's algorithm and the A* search are compared in computational experiments. Furthermore, the performance of the collision avoidance on a real vessel on the Lake Constance is presented.
基于A *搜索算法的船舶快速网格避碰
本文提出了一种基于网格的船舶实时避碰算法。大多数基于网格的避碰方法使用Lee的算法来寻找最优的无碰撞路径。该算法的缺点是对于大型网格运行时间长。为了减少这个运行时间,在这项工作中使用了A*搜索而不是Lee的算法。该算法还考虑了血管的物理约束,并关注了COLREGs。在计算实验中比较了李氏算法和A*搜索的运行时间和结果路径。最后,对康士坦茨湖上一艘真实船舶的避碰性能进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信