L. Geng, Yunfeng Zhang, J. Wang, J. Fuh, Swee Huat Rodney Teo
{"title":"基于图表示和遗传算法的多自主无人机协同任务规划","authors":"L. Geng, Yunfeng Zhang, J. Wang, J. Fuh, Swee Huat Rodney Teo","doi":"10.1109/ICCA.2013.6564991","DOIUrl":null,"url":null,"abstract":"This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"288 5-6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm\",\"authors\":\"L. Geng, Yunfeng Zhang, J. Wang, J. Fuh, Swee Huat Rodney Teo\",\"doi\":\"10.1109/ICCA.2013.6564991\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.\",\"PeriodicalId\":336534,\"journal\":{\"name\":\"2013 10th IEEE International Conference on Control and Automation (ICCA)\",\"volume\":\"288 5-6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th IEEE International Conference on Control and Automation (ICCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCA.2013.6564991\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th IEEE International Conference on Control and Automation (ICCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2013.6564991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm
This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.