UUV multi-task route planning under obstacles constrait

Cao Xin, Zhou Yuan, Chen Yi, Mai Weiqiang
{"title":"UUV multi-task route planning under obstacles constrait","authors":"Cao Xin, Zhou Yuan, Chen Yi, Mai Weiqiang","doi":"10.1109/ICCEA53728.2021.00096","DOIUrl":null,"url":null,"abstract":"Aiming at the path planning problem of UUV under obstacles constrait, this paper proposes a simple and feasible algorithm. The optimal path plan is obtained through the tangent theory based on the principle of minimum turning radius, and a detailed mathematical proof is given. The UUV multi-task route planning problem is transformed into a TSP model solution through the continuous Hopfield neural net-work. The simulation results show that the method can quickly and accurately solve UUV multi tasking route planning problem.","PeriodicalId":325790,"journal":{"name":"2021 International Conference on Computer Engineering and Application (ICCEA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer Engineering and Application (ICCEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEA53728.2021.00096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the path planning problem of UUV under obstacles constrait, this paper proposes a simple and feasible algorithm. The optimal path plan is obtained through the tangent theory based on the principle of minimum turning radius, and a detailed mathematical proof is given. The UUV multi-task route planning problem is transformed into a TSP model solution through the continuous Hopfield neural net-work. The simulation results show that the method can quickly and accurately solve UUV multi tasking route planning problem.
障碍物约束下UUV多任务航路规划
针对障碍物约束下UUV的路径规划问题,提出了一种简单可行的算法。基于最小转弯半径原则,利用切线理论得到了最优路径规划,并给出了详细的数学证明。通过连续Hopfield神经网络将UUV多任务路径规划问题转化为TSP模型解。仿真结果表明,该方法能够快速、准确地解决UUV多任务路径规划问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信