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.