Path-planning algorithm for small environmental surveillance unmanned surface vehicles

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhenyang Wang, Ping Yang, Diju Gao, Chunteng Bao
{"title":"Path-planning algorithm for small environmental surveillance unmanned surface vehicles","authors":"Zhenyang Wang,&nbsp;Ping Yang,&nbsp;Diju Gao,&nbsp;Chunteng Bao","doi":"10.1016/j.asoc.2025.113342","DOIUrl":null,"url":null,"abstract":"<div><div>Ports are essential hub facilities that provide support for economic development. However, the construction, development, and operation of ports increase the risk of environmental pollution in marine areas. Small environmental surveillance unmanned surface vehicles (ESUSVs) are being deployed to monitor port environments and prevent pollution. This study proposes a bidirectional elastic force contraction algorithm (BEFCA) and a Lévy flight weighted whale optimization (LFWWOA) and BEFCA hybrid algorithm (LFWWOA-BEFCA) to solve the path planning problem of ESUSVs. BEFCA solves the slow convergence and unsmooth path-characteristic problem of the elastic force contraction algorithm (EFCA) by employing a bidirectional search strategy and ship kinematics to smoothen the turning points in the path, respectively. LFWWOA uses a Lévy flight-based strategy in the global exploration phase of the whale optimization algorithm (WOA) to increase the solution diversity and improves the global and local search performance by modifying the coefficient calculation method and adding adaptive weighting coefficients. Thirteen benchmark functions were selected for the LFWWOA optimization performance experiments and compared with other intelligence algorithms. The results demonstrate that the proposed algorithm achieved the best global performance. Therefore, LFWWOA was used to optimize the BEFCA parameters, which resulted in higher-quality planned paths. Simulation experiments of real scenarios and complex environments showed that the path lengths and algorithm runtimes of BEFCA and LFWWOA-BEFCA outperformed those of the state prediction rapidly exploring random trees (spRRT) and spRRT-informed algorithms, respectively. The planned paths are consistent with the motion characteristics of ESUSVs, which can be used directly for tracking. The findings of this study indicate that shorter travel paths can be planned for ESUSVs in harbors for environmental monitoring, effectively solving the difficulty of tracking the paths of ESUSVs, and reducing energy consumption during the travel process.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"178 ","pages":"Article 113342"},"PeriodicalIF":7.2000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625006532","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Ports are essential hub facilities that provide support for economic development. However, the construction, development, and operation of ports increase the risk of environmental pollution in marine areas. Small environmental surveillance unmanned surface vehicles (ESUSVs) are being deployed to monitor port environments and prevent pollution. This study proposes a bidirectional elastic force contraction algorithm (BEFCA) and a Lévy flight weighted whale optimization (LFWWOA) and BEFCA hybrid algorithm (LFWWOA-BEFCA) to solve the path planning problem of ESUSVs. BEFCA solves the slow convergence and unsmooth path-characteristic problem of the elastic force contraction algorithm (EFCA) by employing a bidirectional search strategy and ship kinematics to smoothen the turning points in the path, respectively. LFWWOA uses a Lévy flight-based strategy in the global exploration phase of the whale optimization algorithm (WOA) to increase the solution diversity and improves the global and local search performance by modifying the coefficient calculation method and adding adaptive weighting coefficients. Thirteen benchmark functions were selected for the LFWWOA optimization performance experiments and compared with other intelligence algorithms. The results demonstrate that the proposed algorithm achieved the best global performance. Therefore, LFWWOA was used to optimize the BEFCA parameters, which resulted in higher-quality planned paths. Simulation experiments of real scenarios and complex environments showed that the path lengths and algorithm runtimes of BEFCA and LFWWOA-BEFCA outperformed those of the state prediction rapidly exploring random trees (spRRT) and spRRT-informed algorithms, respectively. The planned paths are consistent with the motion characteristics of ESUSVs, which can be used directly for tracking. The findings of this study indicate that shorter travel paths can be planned for ESUSVs in harbors for environmental monitoring, effectively solving the difficulty of tracking the paths of ESUSVs, and reducing energy consumption during the travel process.
小型环境监视无人水面车辆路径规划算法
港口是支撑经济发展的重要枢纽设施。然而,港口的建设、开发和运营增加了海洋环境污染的风险。小型环境监测无人水面车辆(esusv)被部署用于监测港口环境和防止污染。本研究提出了一种双向弹性力收缩算法(BEFCA)和一种lsamvy飞行加权鲸鱼优化算法(LFWWOA)和BEFCA混合算法(LFWWOA-BEFCA)来解决esusv的路径规划问题。该算法分别采用双向搜索策略和船舶运动学对路径上的拐点进行平滑处理,解决了弹性力收缩算法(EFCA)收敛缓慢和路径特征不光滑的问题。LFWWOA在鲸鱼优化算法(WOA)的全局搜索阶段采用基于lsamvy飞行的策略,通过修改系数计算方法和增加自适应加权系数来增加解的多样性,提高全局和局部搜索性能。选取13个基准函数进行LFWWOA优化性能实验,并与其他智能算法进行比较。结果表明,该算法具有最佳的全局性能。因此,利用LFWWOA对BEFCA参数进行优化,得到质量更高的规划路径。真实场景和复杂环境的仿真实验表明,BEFCA和LFWWOA-BEFCA的路径长度和算法运行时间分别优于状态预测快速探索随机树(spRRT)和spRRT通知算法。规划的路径符合esusv的运动特性,可直接用于跟踪。本研究结果表明,可以为esusv在港口规划较短的行驶路径进行环境监测,有效解决esusv路径跟踪困难的问题,降低行驶过程中的能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术官方微信