基于改进型 A* 算法的自动潜航器路径规划,能耗最优*。

Guozheng Li, Qiyu Wang, Qinghan Hu, Zhiqing Li
{"title":"基于改进型 A* 算法的自动潜航器路径规划,能耗最优*。","authors":"Guozheng Li, Qiyu Wang, Qinghan Hu, Zhiqing Li","doi":"10.1109/ROBIO58561.2023.10355017","DOIUrl":null,"url":null,"abstract":"In the traditional path planning of the Autonomous Underwater Vehicle (AUV), the algorithm’s time and the planned path’s length are more considered. Energy consumption, which greatly affects AUVs’ endurance, is rarely considered. Therefore, a path-planning algorithm based on energy consumption is proposed in this study. Firstly, the energy consumption function of the AUV during navigation is established. Then, based on the energy consumption function, the cost function of the A* algorithm is adaptively improved. Therefore, an improved A* algorithm with optimal energy consumption is proposed. After that, the algorithm, A* algorithm, ant colony algorithm and improved ant colony algorithm were simulated under raster map. Simulation results show that compared with the other three algorithms, the energy consumption of AUV sailing on the path planned by the algorithm is reduced by 6.0%∼22.9%.","PeriodicalId":505134,"journal":{"name":"2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)","volume":"109 9","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Path planning of AUV based on improved A* algorithm with optimal energy consumption*\",\"authors\":\"Guozheng Li, Qiyu Wang, Qinghan Hu, Zhiqing Li\",\"doi\":\"10.1109/ROBIO58561.2023.10355017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the traditional path planning of the Autonomous Underwater Vehicle (AUV), the algorithm’s time and the planned path’s length are more considered. Energy consumption, which greatly affects AUVs’ endurance, is rarely considered. Therefore, a path-planning algorithm based on energy consumption is proposed in this study. Firstly, the energy consumption function of the AUV during navigation is established. Then, based on the energy consumption function, the cost function of the A* algorithm is adaptively improved. Therefore, an improved A* algorithm with optimal energy consumption is proposed. After that, the algorithm, A* algorithm, ant colony algorithm and improved ant colony algorithm were simulated under raster map. Simulation results show that compared with the other three algorithms, the energy consumption of AUV sailing on the path planned by the algorithm is reduced by 6.0%∼22.9%.\",\"PeriodicalId\":505134,\"journal\":{\"name\":\"2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"volume\":\"109 9\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBIO58561.2023.10355017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO58561.2023.10355017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在传统的自主潜水器(AUV)路径规划中,更多考虑的是算法的时间和规划路径的长度。而对 AUV 的续航能力有很大影响的能耗却很少被考虑。因此,本研究提出了一种基于能耗的路径规划算法。首先,建立 AUV 在导航过程中的能耗函数。然后,根据能耗函数,自适应地改进 A* 算法的代价函数。因此,提出了一种能耗最优的改进型 A* 算法。随后,在光栅地图下对该算法、A*算法、蚁群算法和改进的蚁群算法进行了仿真。仿真结果表明,与其他三种算法相比,在该算法规划的路径上航行的 AUV 的能耗降低了 6.0%∼22.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Path planning of AUV based on improved A* algorithm with optimal energy consumption*
In the traditional path planning of the Autonomous Underwater Vehicle (AUV), the algorithm’s time and the planned path’s length are more considered. Energy consumption, which greatly affects AUVs’ endurance, is rarely considered. Therefore, a path-planning algorithm based on energy consumption is proposed in this study. Firstly, the energy consumption function of the AUV during navigation is established. Then, based on the energy consumption function, the cost function of the A* algorithm is adaptively improved. Therefore, an improved A* algorithm with optimal energy consumption is proposed. After that, the algorithm, A* algorithm, ant colony algorithm and improved ant colony algorithm were simulated under raster map. Simulation results show that compared with the other three algorithms, the energy consumption of AUV sailing on the path planned by the algorithm is reduced by 6.0%∼22.9%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Barometric Soft Tactile Sensor for Depth Independent Contact Localization Stability Margin Based Gait Design on Slopes for a Novel Reconfigurable Quadruped Robot with a Foldable Trunk Blind Walking Balance Control and Disturbance Rejection of the Bipedal Humanoid Robot Xiao-Man via Reinforcement Learning A Closed-Loop Multi-perspective Visual Servoing Approach with Reinforcement Learning Modeling and Analysis of Pipe External Surface Grinding Force using Cup-shaped Wire Brush
×
引用
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