{"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}
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.