Inspection of Ship Hulls with Multiple UAVs: Exploiting Prior Information for Online Path Planning

Pasquale Grippa, A. Renzaglia, Antoine Rochebois, M. Schranz, Olivier Simonin
{"title":"Inspection of Ship Hulls with Multiple UAVs: Exploiting Prior Information for Online Path Planning","authors":"Pasquale Grippa, A. Renzaglia, Antoine Rochebois, M. Schranz, Olivier Simonin","doi":"10.1109/IROS47612.2022.9981357","DOIUrl":null,"url":null,"abstract":"This paper addresses a path planning problem for a fleet of Unmanned Aerial Vehicles (UAVs) that uses both prior information and online gathered data to efficiently inspect large surfaces such as ship hulls and water tanks. UAVs can detect corrosion patches and other defects on the surface from low-resolution images. If defects are detected, they get closer to the surface for a high-resolution inspection. The prior information provides expected defects locations and is affected by both false positives and false negatives. The mission objective is to prioritize the close-up inspection of defected areas while keeping a reasonable time for the coverage of the entire surface. We propose two solutions to this problem: a coverage algorithm that divides the problem into a set of Traveling Salesman Problems (Part-TSP) and a cooperative frontier approach that introduces frontier utilities to incorporate the prior information (Coop-Frontier). We finally provide extensive simulation results to analyze the performance of these approaches and compare them with alternative solutions. These results suggest that both Part-Tspand Coop-Frontier perform better than the baseline solution. Part-Tsphas the best performance in most cases. However, coop-Frontier is preferable in extreme cases because more robust to inhomogeneous corrosion distribution and imperfect information.","PeriodicalId":431373,"journal":{"name":"2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS47612.2022.9981357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper addresses a path planning problem for a fleet of Unmanned Aerial Vehicles (UAVs) that uses both prior information and online gathered data to efficiently inspect large surfaces such as ship hulls and water tanks. UAVs can detect corrosion patches and other defects on the surface from low-resolution images. If defects are detected, they get closer to the surface for a high-resolution inspection. The prior information provides expected defects locations and is affected by both false positives and false negatives. The mission objective is to prioritize the close-up inspection of defected areas while keeping a reasonable time for the coverage of the entire surface. We propose two solutions to this problem: a coverage algorithm that divides the problem into a set of Traveling Salesman Problems (Part-TSP) and a cooperative frontier approach that introduces frontier utilities to incorporate the prior information (Coop-Frontier). We finally provide extensive simulation results to analyze the performance of these approaches and compare them with alternative solutions. These results suggest that both Part-Tspand Coop-Frontier perform better than the baseline solution. Part-Tsphas the best performance in most cases. However, coop-Frontier is preferable in extreme cases because more robust to inhomogeneous corrosion distribution and imperfect information.
多无人机船体检测:利用先验信息进行在线路径规划
本文解决了无人驾驶飞行器(uav)机队的路径规划问题,该机队使用先验信息和在线收集的数据来有效地检查船体和水箱等大型表面。无人机可以从低分辨率图像中检测表面的腐蚀斑块和其他缺陷。如果检测到缺陷,它们会靠近表面进行高分辨率检查。先验信息提供了预期的缺陷位置,并受到假阳性和假阴性的影响。任务目标是优先对有缺陷的区域进行近距离检查,同时保持对整个表面覆盖的合理时间。针对这一问题,我们提出了两种解决方案:一种将问题划分为一组旅行商问题的覆盖算法(Part-TSP)和一种引入前沿实用程序来整合先验信息的合作前沿方法(Coop-Frontier)。最后,我们提供了大量的仿真结果来分析这些方法的性能,并将它们与替代解决方案进行比较。这些结果表明,Part-Tspand Coop-Frontier方案的性能都优于基线方案。在大多数情况下,part - tsp具有最佳性能。然而,在极端情况下,coop-Frontier更受欢迎,因为它对非均匀腐蚀分布和不完全信息更强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信