基于Dijkstra自优化模型的无人水面车辆避障路径规划

Qilong Chen, Pengfei Huang
{"title":"基于Dijkstra自优化模型的无人水面车辆避障路径规划","authors":"Qilong Chen, Pengfei Huang","doi":"10.1117/12.2653458","DOIUrl":null,"url":null,"abstract":"In order to generate an obstruction avoidance path for unmanned surface vehicle, the Dijkstra self-optimization model is proposed in this paper. First, a Maklink undirected graph is generated according to the starting point, ending point, and obstructions, the Dijkstra algorithm is used to generate an initial path to avoid obstructions. Second, a directed graph is generated based on the initial path, the Dijkstra algorithm is used to generate the optimal path with the shorter length. The experimental results show that the Dijkstra self-optimization model can generate the shortest path to avoid obstructions. Compared with the Maklink+ACO model, this model has smaller time complexity and is the optimal solution.","PeriodicalId":32903,"journal":{"name":"JITeCS Journal of Information Technology and Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Obstruction avoidance path planning of unmanned surface vehicle based on Dijkstra self-optimization model\",\"authors\":\"Qilong Chen, Pengfei Huang\",\"doi\":\"10.1117/12.2653458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to generate an obstruction avoidance path for unmanned surface vehicle, the Dijkstra self-optimization model is proposed in this paper. First, a Maklink undirected graph is generated according to the starting point, ending point, and obstructions, the Dijkstra algorithm is used to generate an initial path to avoid obstructions. Second, a directed graph is generated based on the initial path, the Dijkstra algorithm is used to generate the optimal path with the shorter length. The experimental results show that the Dijkstra self-optimization model can generate the shortest path to avoid obstructions. Compared with the Maklink+ACO model, this model has smaller time complexity and is the optimal solution.\",\"PeriodicalId\":32903,\"journal\":{\"name\":\"JITeCS Journal of Information Technology and Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JITeCS Journal of Information Technology and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2653458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JITeCS Journal of Information Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2653458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了生成无人水面车辆的避障路径,本文提出了Dijkstra自优化模型。首先,根据起点、终点和障碍物生成Maklink无向图,利用Dijkstra算法生成避开障碍物的初始路径。其次,在初始路径的基础上生成有向图,利用Dijkstra算法生成长度较短的最优路径;实验结果表明,Dijkstra自优化模型能够生成避开障碍物的最短路径。与Maklink+ACO模型相比,该模型具有更小的时间复杂度,是最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Obstruction avoidance path planning of unmanned surface vehicle based on Dijkstra self-optimization model
In order to generate an obstruction avoidance path for unmanned surface vehicle, the Dijkstra self-optimization model is proposed in this paper. First, a Maklink undirected graph is generated according to the starting point, ending point, and obstructions, the Dijkstra algorithm is used to generate an initial path to avoid obstructions. Second, a directed graph is generated based on the initial path, the Dijkstra algorithm is used to generate the optimal path with the shorter length. The experimental results show that the Dijkstra self-optimization model can generate the shortest path to avoid obstructions. Compared with the Maklink+ACO model, this model has smaller time complexity and is the optimal solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
12
审稿时长
20 weeks
×
引用
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学术官方微信