Mingxing Zhang, Jiaming Zhang, Guangquan Cheng, Chao Chen, Zhong Liu
{"title":"多武器协同作战的火力调度","authors":"Mingxing Zhang, Jiaming Zhang, Guangquan Cheng, Chao Chen, Zhong Liu","doi":"10.1109/SKIMA.2016.7916197","DOIUrl":null,"url":null,"abstract":"In the multi-weapon platform cooperative combat conditions, coordination of weapons between different weapons platforms in order to quickly calculate the launch time of all weapons become very urgent and extremely difficult. To solve the problem of multi — weapon cooperative launch scheduling, the mixed integer programming model of multi — weapon platform multi — attack targets is established by minimizing the final launch time of weapon platform. A fast heuristic algorithm based on task priority is designed, which can provide the commander with the weapon firing timing scheme with priority strike requirement. A trajectory cross-processing scheme based on time dimension optimization is proposed, and the algorithm of launch time solution and space compression Evolutionary Strategy of Feasibility of Thought. Finally, the model and algorithm are validated by case study, and the feasibility of feasible solution evolution strategy is discussed. The experimental results show that the model and method can effectively solve the problem of multi-weapon cooperative battle launch sequence planning.","PeriodicalId":417370,"journal":{"name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fire scheduling for multiple weapons cooperative engagement\",\"authors\":\"Mingxing Zhang, Jiaming Zhang, Guangquan Cheng, Chao Chen, Zhong Liu\",\"doi\":\"10.1109/SKIMA.2016.7916197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the multi-weapon platform cooperative combat conditions, coordination of weapons between different weapons platforms in order to quickly calculate the launch time of all weapons become very urgent and extremely difficult. To solve the problem of multi — weapon cooperative launch scheduling, the mixed integer programming model of multi — weapon platform multi — attack targets is established by minimizing the final launch time of weapon platform. A fast heuristic algorithm based on task priority is designed, which can provide the commander with the weapon firing timing scheme with priority strike requirement. A trajectory cross-processing scheme based on time dimension optimization is proposed, and the algorithm of launch time solution and space compression Evolutionary Strategy of Feasibility of Thought. Finally, the model and algorithm are validated by case study, and the feasibility of feasible solution evolution strategy is discussed. The experimental results show that the model and method can effectively solve the problem of multi-weapon cooperative battle launch sequence planning.\",\"PeriodicalId\":417370,\"journal\":{\"name\":\"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SKIMA.2016.7916197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKIMA.2016.7916197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fire scheduling for multiple weapons cooperative engagement
In the multi-weapon platform cooperative combat conditions, coordination of weapons between different weapons platforms in order to quickly calculate the launch time of all weapons become very urgent and extremely difficult. To solve the problem of multi — weapon cooperative launch scheduling, the mixed integer programming model of multi — weapon platform multi — attack targets is established by minimizing the final launch time of weapon platform. A fast heuristic algorithm based on task priority is designed, which can provide the commander with the weapon firing timing scheme with priority strike requirement. A trajectory cross-processing scheme based on time dimension optimization is proposed, and the algorithm of launch time solution and space compression Evolutionary Strategy of Feasibility of Thought. Finally, the model and algorithm are validated by case study, and the feasibility of feasible solution evolution strategy is discussed. The experimental results show that the model and method can effectively solve the problem of multi-weapon cooperative battle launch sequence planning.