{"title":"Targets Assignment for Cooperative Multi-UAVs Based on Chaos Optimization Algorithm","authors":"Wei Ou, Feng-xing Zou, Xiaohong Xu, Gao Zheng","doi":"10.1109/ICYCS.2008.512","DOIUrl":null,"url":null,"abstract":"Targets assignment is one of crucial problem for multi-UAVs cooperative campaign. By taking furthest campaign benefit and survival probability of UAVs as objective function, the mathematics model of targets assignment is formulated in this paper, and an approach solving targets assignment problem based on chaos optimization is proposed, whereas a new encoding method is introduced, chaos search queues is mapped to solution space of targets assignment problem effectively by defining exchange, shift and insertion operators, and an correcting method is applied to keep the validity of solutions. Finally, the efficiency of the proposed algorithm is demonstrated by computer simulations.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 9th International Conference for Young Computer Scientists","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICYCS.2008.512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Targets assignment is one of crucial problem for multi-UAVs cooperative campaign. By taking furthest campaign benefit and survival probability of UAVs as objective function, the mathematics model of targets assignment is formulated in this paper, and an approach solving targets assignment problem based on chaos optimization is proposed, whereas a new encoding method is introduced, chaos search queues is mapped to solution space of targets assignment problem effectively by defining exchange, shift and insertion operators, and an correcting method is applied to keep the validity of solutions. Finally, the efficiency of the proposed algorithm is demonstrated by computer simulations.