Bin Hu, Yahui Zhu, Zhize Du, Zixin Zhao, Yannian Zhou
{"title":"基于改进k -均值算法和最短时间机制的无人机群多目标分配狩猎策略","authors":"Bin Hu, Yahui Zhu, Zhize Du, Zixin Zhao, Yannian Zhou","doi":"10.1051/jnwpu/20224061297","DOIUrl":null,"url":null,"abstract":"Multi-target hunting of UAV swarm is an important tactical means. This paper proposes a hunting strategy based on improved K-means and the shortest time mechanism. The large-scale task assignment problem is complex in structure and difficult to solve. To obtain higher hunting efficiency and reduce the amount of calculation on the single UAV, the hybrid architecture is used to decompose the complex multi-target hunting problem into a set of tasks that the UAV need to perform, which reduces the coupling of the system and the complexity of problem. Firstly, the multi-target hunting problem is stratified by the improved K-means algorithm to form multiple independent single target hunting subsystems. In the subsystem, the single target hunting task is decomposed into multiple subtasks that are easy to be executed by UAVs, and a one-to-one matching relationship between subtasks and UAVs is established by using the shortest time mechanism. UAV swarm can achieve multi-target hunting only by executing subtasks. The simulation results show that the UAV swarm can effectively allocate the multi-target hunting problem, which proves the effectiveness of the allocation strategy is proved.","PeriodicalId":39691,"journal":{"name":"西北工业大学学报","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multi-target assignment hunting strategy of UAV swarm based on improved K-means algorithm and shortest time mechanism\",\"authors\":\"Bin Hu, Yahui Zhu, Zhize Du, Zixin Zhao, Yannian Zhou\",\"doi\":\"10.1051/jnwpu/20224061297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-target hunting of UAV swarm is an important tactical means. This paper proposes a hunting strategy based on improved K-means and the shortest time mechanism. The large-scale task assignment problem is complex in structure and difficult to solve. To obtain higher hunting efficiency and reduce the amount of calculation on the single UAV, the hybrid architecture is used to decompose the complex multi-target hunting problem into a set of tasks that the UAV need to perform, which reduces the coupling of the system and the complexity of problem. Firstly, the multi-target hunting problem is stratified by the improved K-means algorithm to form multiple independent single target hunting subsystems. In the subsystem, the single target hunting task is decomposed into multiple subtasks that are easy to be executed by UAVs, and a one-to-one matching relationship between subtasks and UAVs is established by using the shortest time mechanism. UAV swarm can achieve multi-target hunting only by executing subtasks. The simulation results show that the UAV swarm can effectively allocate the multi-target hunting problem, which proves the effectiveness of the allocation strategy is proved.\",\"PeriodicalId\":39691,\"journal\":{\"name\":\"西北工业大学学报\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"西北工业大学学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1051/jnwpu/20224061297\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"西北工业大学学报","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1051/jnwpu/20224061297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
Multi-target assignment hunting strategy of UAV swarm based on improved K-means algorithm and shortest time mechanism
Multi-target hunting of UAV swarm is an important tactical means. This paper proposes a hunting strategy based on improved K-means and the shortest time mechanism. The large-scale task assignment problem is complex in structure and difficult to solve. To obtain higher hunting efficiency and reduce the amount of calculation on the single UAV, the hybrid architecture is used to decompose the complex multi-target hunting problem into a set of tasks that the UAV need to perform, which reduces the coupling of the system and the complexity of problem. Firstly, the multi-target hunting problem is stratified by the improved K-means algorithm to form multiple independent single target hunting subsystems. In the subsystem, the single target hunting task is decomposed into multiple subtasks that are easy to be executed by UAVs, and a one-to-one matching relationship between subtasks and UAVs is established by using the shortest time mechanism. UAV swarm can achieve multi-target hunting only by executing subtasks. The simulation results show that the UAV swarm can effectively allocate the multi-target hunting problem, which proves the effectiveness of the allocation strategy is proved.