{"title":"多艘无人船协同编队任务分配方法","authors":"Jie Wu, Zikang Hao, Zhenning Z Liu, Yanyan Li","doi":"10.1109/ICCAR57134.2023.10151719","DOIUrl":null,"url":null,"abstract":"The cluster operation of unmanned marine vehicle (UMV) has become an important trend in the future with the development of marine industry. Nevertheless, the existing methods have several problems such as delayed task allocation, slow convergence and tendency to fall into local optimization. Therefore, a new task allocation method is proposed to control oil pollution, which closely combines the tour planning process with the task allocation process. Firstly, Hungarian Algorithm (HA) is used to establish Multi-UMV cost matrix. Secondly, Ant Colony Optimization (ACO) is used to solve the tour planning problems. Finally, it is feasible to get the result of the shortest closed-loop itinerant path. The simulation results show that the total track length is reduced by 15.13%, and the average running time is reduced by 46.57%, which can be used to improve the rationality of task allocation.","PeriodicalId":347150,"journal":{"name":"2023 9th International Conference on Control, Automation and Robotics (ICCAR)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Task Allocation Method for Multiple Unmanned Marine Vehicles Cooperative Formation\",\"authors\":\"Jie Wu, Zikang Hao, Zhenning Z Liu, Yanyan Li\",\"doi\":\"10.1109/ICCAR57134.2023.10151719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The cluster operation of unmanned marine vehicle (UMV) has become an important trend in the future with the development of marine industry. Nevertheless, the existing methods have several problems such as delayed task allocation, slow convergence and tendency to fall into local optimization. Therefore, a new task allocation method is proposed to control oil pollution, which closely combines the tour planning process with the task allocation process. Firstly, Hungarian Algorithm (HA) is used to establish Multi-UMV cost matrix. Secondly, Ant Colony Optimization (ACO) is used to solve the tour planning problems. Finally, it is feasible to get the result of the shortest closed-loop itinerant path. The simulation results show that the total track length is reduced by 15.13%, and the average running time is reduced by 46.57%, which can be used to improve the rationality of task allocation.\",\"PeriodicalId\":347150,\"journal\":{\"name\":\"2023 9th International Conference on Control, Automation and Robotics (ICCAR)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 9th International Conference on Control, Automation and Robotics (ICCAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAR57134.2023.10151719\",\"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 9th International Conference on Control, Automation and Robotics (ICCAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAR57134.2023.10151719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Task Allocation Method for Multiple Unmanned Marine Vehicles Cooperative Formation
The cluster operation of unmanned marine vehicle (UMV) has become an important trend in the future with the development of marine industry. Nevertheless, the existing methods have several problems such as delayed task allocation, slow convergence and tendency to fall into local optimization. Therefore, a new task allocation method is proposed to control oil pollution, which closely combines the tour planning process with the task allocation process. Firstly, Hungarian Algorithm (HA) is used to establish Multi-UMV cost matrix. Secondly, Ant Colony Optimization (ACO) is used to solve the tour planning problems. Finally, it is feasible to get the result of the shortest closed-loop itinerant path. The simulation results show that the total track length is reduced by 15.13%, and the average running time is reduced by 46.57%, which can be used to improve the rationality of task allocation.