Three-Dimensional Coverage Path Planning for Cooperative Autonomous Underwater Vehicles: A Swarm Migration Genetic Algorithm Approach

IF 2.7 3区 地球科学 Q1 ENGINEERING, MARINE Journal of Marine Science and Engineering Pub Date : 2024-08-11 DOI:10.3390/jmse12081366
Yangmin Xie, Wenbo Hui, Dacheng Zhou, Hang Shi
{"title":"Three-Dimensional Coverage Path Planning for Cooperative Autonomous Underwater Vehicles: A Swarm Migration Genetic Algorithm Approach","authors":"Yangmin Xie, Wenbo Hui, Dacheng Zhou, Hang Shi","doi":"10.3390/jmse12081366","DOIUrl":null,"url":null,"abstract":"Cooperative marine exploration tasks involving multiple autonomous underwater vehicles (AUVs) present a complex 3D coverage path planning challenge that has not been fully addressed. To tackle this, we employ an auto-growth strategy to generate interconnected paths, ensuring simultaneous satisfaction of the obstacle avoidance and space coverage requirements. Our approach introduces a novel genetic algorithm designed to achieve equivalent and energy-efficient path allocation among AUVs. The core idea involves defining competing gene swarms to facilitate path migration, corresponding to path allocation actions among AUVs. The fitness function incorporates models for both energy consumption and optimal path connections, resulting in iterations that lead to optimal path assignment among AUVs. This framework for multi-AUV coverage path planning eliminates the need for pre-division of the working space and has proven effective in 3D underwater environments. Numerous experiments validate the proposed method, showcasing its comprehensive advantages in achieving equitable path allocation, minimizing overall energy consumption, and ensuring high computational efficiency. These benefits contribute to the success of multi-AUV cooperation in deep-sea information collection and environmental surveillance.","PeriodicalId":16168,"journal":{"name":"Journal of Marine Science and Engineering","volume":"33 1","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2024-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Marine Science and Engineering","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.3390/jmse12081366","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MARINE","Score":null,"Total":0}
引用次数: 0

Abstract

Cooperative marine exploration tasks involving multiple autonomous underwater vehicles (AUVs) present a complex 3D coverage path planning challenge that has not been fully addressed. To tackle this, we employ an auto-growth strategy to generate interconnected paths, ensuring simultaneous satisfaction of the obstacle avoidance and space coverage requirements. Our approach introduces a novel genetic algorithm designed to achieve equivalent and energy-efficient path allocation among AUVs. The core idea involves defining competing gene swarms to facilitate path migration, corresponding to path allocation actions among AUVs. The fitness function incorporates models for both energy consumption and optimal path connections, resulting in iterations that lead to optimal path assignment among AUVs. This framework for multi-AUV coverage path planning eliminates the need for pre-division of the working space and has proven effective in 3D underwater environments. Numerous experiments validate the proposed method, showcasing its comprehensive advantages in achieving equitable path allocation, minimizing overall energy consumption, and ensuring high computational efficiency. These benefits contribute to the success of multi-AUV cooperation in deep-sea information collection and environmental surveillance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
合作式自主水下航行器的三维覆盖路径规划:群迁移遗传算法方法
涉及多个自动潜航器(AUV)的合作海洋探测任务提出了一个复杂的三维覆盖路径规划挑战,而这一挑战尚未完全解决。为了解决这个问题,我们采用了自动增长策略来生成相互连接的路径,确保同时满足避障和空间覆盖的要求。我们的方法引入了一种新型遗传算法,旨在实现自动潜航器之间等效、节能的路径分配。其核心思想是定义相互竞争的基因群,以促进路径迁移,这与 AUV 之间的路径分配行动相对应。适配函数包含能耗和最佳路径连接模型,从而通过迭代实现 AUV 之间的最佳路径分配。这种用于多 AUV 覆盖路径规划的框架无需预先划分工作空间,在三维水下环境中被证明是有效的。大量实验验证了所提出的方法,展示了其在实现公平路径分配、最大限度降低总体能耗和确保高计算效率方面的综合优势。这些优势有助于多无人潜航器在深海信息收集和环境监测方面的成功合作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Marine Science and Engineering
Journal of Marine Science and Engineering Engineering-Ocean Engineering
CiteScore
4.40
自引率
20.70%
发文量
1640
审稿时长
18.09 days
期刊介绍: Journal of Marine Science and Engineering (JMSE; ISSN 2077-1312) is an international, peer-reviewed open access journal which provides an advanced forum for studies related to marine science and engineering. It publishes reviews, research papers and communications. Our aim is to encourage scientists to publish their experimental and theoretical results in as much detail as possible. There is no restriction on the length of the papers. The full experimental details must be provided so that the results can be reproduced. Electronic files and software regarding the full details of the calculation or experimental procedure, if unable to be published in a normal way, can be deposited as supplementary electronic material.
期刊最新文献
Estimation of Source Range and Location Using Ship-Radiated Noise Measured by Two Vertical Line Arrays with a Feed-Forward Neural Network Uncertainty of Wave Spectral Shape and Parameters Associated with the Spectral Estimation Dynamic Response Analysis and Liquefaction Potential Evaluation of Riverbed Induced by Tidal Bore Thermodynamic Analysis of a Marine Diesel Engine Waste Heat-Assisted Cogeneration Power Plant Modified with Regeneration Onboard a Ship Performance of a Cable-Driven Robot Used for Cyber–Physical Testing of Floating Wind Turbines
×
引用
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