{"title":"障碍物约束下UUV多任务航路规划","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":"{\"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}","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}
UUV multi-task route planning under obstacles constrait
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.