用于 USV 辅助近海测深绘图的联合优化覆盖路径规划框架:从理论到实践

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2024-09-03 DOI:10.1016/j.knosys.2024.112449
{"title":"用于 USV 辅助近海测深绘图的联合优化覆盖路径规划框架:从理论到实践","authors":"","doi":"10.1016/j.knosys.2024.112449","DOIUrl":null,"url":null,"abstract":"<div><p>Designing effective coverage routes for unmanned surface vehicles (USVs) is crucial to improve the efficiency of offshore bathymetric surveys. However, existing coverage planning methods for practical use are limited, primarily due to the large-scale surveying areas and intricate region geometries caused by coastal features. This study aims to address these challenges by introducing a coverage path planning framework for USV-assisted bathymetric mapping, specifically aimed at the joint optimization of paths to cover numerous complex regions. Initially, we conceptualize the large-scale bathymetric survey mission as an integer programming model. The model uses four distinct decision variables to meticulously formulate length calculations, inter-regional connections, entry and exit point selections, and line sweep direction. Then, a novel hierarchical algorithm is devised to solve the problem. The method first incorporates a bisection-based convex decomposition method to achieve optimal partitioning of complex regions. Additionally, a hierarchical heuristic optimization algorithm that seamlessly integrates the optimization of all influencing factors is designed, which includes order generation, candidate pattern finding, tour finding, and final optimization. The reliability of the framework is validated through semi-physical simulations and lake trials using a real USV. Through comparative studies, our model demonstrates clear advantages in computational efficiency and optimization capability compared to state-of-the-arts, with its superiority becoming more pronounced as the problem scale increases. The results from lake trials further affirm the efficient and reliable performance of our model in practical bathymetric survey tasks.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint-optimized coverage path planning framework for USV-assisted offshore bathymetric mapping: From theory to practice\",\"authors\":\"\",\"doi\":\"10.1016/j.knosys.2024.112449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Designing effective coverage routes for unmanned surface vehicles (USVs) is crucial to improve the efficiency of offshore bathymetric surveys. However, existing coverage planning methods for practical use are limited, primarily due to the large-scale surveying areas and intricate region geometries caused by coastal features. This study aims to address these challenges by introducing a coverage path planning framework for USV-assisted bathymetric mapping, specifically aimed at the joint optimization of paths to cover numerous complex regions. Initially, we conceptualize the large-scale bathymetric survey mission as an integer programming model. The model uses four distinct decision variables to meticulously formulate length calculations, inter-regional connections, entry and exit point selections, and line sweep direction. Then, a novel hierarchical algorithm is devised to solve the problem. The method first incorporates a bisection-based convex decomposition method to achieve optimal partitioning of complex regions. Additionally, a hierarchical heuristic optimization algorithm that seamlessly integrates the optimization of all influencing factors is designed, which includes order generation, candidate pattern finding, tour finding, and final optimization. The reliability of the framework is validated through semi-physical simulations and lake trials using a real USV. Through comparative studies, our model demonstrates clear advantages in computational efficiency and optimization capability compared to state-of-the-arts, with its superiority becoming more pronounced as the problem scale increases. The results from lake trials further affirm the efficient and reliable performance of our model in practical bathymetric survey tasks.</p></div>\",\"PeriodicalId\":49939,\"journal\":{\"name\":\"Knowledge-Based Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge-Based Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0950705124010839\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705124010839","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

为无人水面航行器(USV)设计有效的覆盖路线对于提高近海测深勘测的效率至关重要。然而,现有的覆盖规划方法在实际应用中存在局限性,这主要是由于大规模的勘测区域和海岸地貌造成的错综复杂的区域几何形状。本研究旨在通过引入 USV 辅助测深绘图的覆盖路径规划框架来应对这些挑战,特别是针对覆盖众多复杂区域的路径联合优化。首先,我们将大规模水深测量任务概念化为一个整数编程模型。该模型使用四个不同的决策变量对长度计算、区域间连接、入口和出口点选择以及测线扫描方向进行了精心设计。然后,设计了一种新颖的分层算法来解决问题。该方法首先结合了一种基于平分的凸分解方法,以实现复杂区域的最优划分。此外,还设计了一种分层启发式优化算法,可无缝集成所有影响因素的优化,包括阶次生成、候选模式查找、巡回查找和最终优化。通过使用真实 USV 进行半物理模拟和湖泊试验,验证了该框架的可靠性。通过对比研究,我们的模型在计算效率和优化能力方面都明显优于同行,而且随着问题规模的扩大,其优越性更加明显。湖泊试验的结果进一步证实了我们的模型在实际测深任务中高效可靠的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint-optimized coverage path planning framework for USV-assisted offshore bathymetric mapping: From theory to practice

Designing effective coverage routes for unmanned surface vehicles (USVs) is crucial to improve the efficiency of offshore bathymetric surveys. However, existing coverage planning methods for practical use are limited, primarily due to the large-scale surveying areas and intricate region geometries caused by coastal features. This study aims to address these challenges by introducing a coverage path planning framework for USV-assisted bathymetric mapping, specifically aimed at the joint optimization of paths to cover numerous complex regions. Initially, we conceptualize the large-scale bathymetric survey mission as an integer programming model. The model uses four distinct decision variables to meticulously formulate length calculations, inter-regional connections, entry and exit point selections, and line sweep direction. Then, a novel hierarchical algorithm is devised to solve the problem. The method first incorporates a bisection-based convex decomposition method to achieve optimal partitioning of complex regions. Additionally, a hierarchical heuristic optimization algorithm that seamlessly integrates the optimization of all influencing factors is designed, which includes order generation, candidate pattern finding, tour finding, and final optimization. The reliability of the framework is validated through semi-physical simulations and lake trials using a real USV. Through comparative studies, our model demonstrates clear advantages in computational efficiency and optimization capability compared to state-of-the-arts, with its superiority becoming more pronounced as the problem scale increases. The results from lake trials further affirm the efficient and reliable performance of our model in practical bathymetric survey tasks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
期刊最新文献
Convolutional long-short term memory network for space debris detection and tracking Adaptive class token knowledge distillation for efficient vision transformer Progressively global–local fusion with explicit guidance for accurate and robust 3d hand pose reconstruction A privacy-preserving framework with multi-modal data for cross-domain recommendation DCTracker: Rethinking MOT in soccer events under dual views via cascade association
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1