{"title":"Research on Regional Coverage with LAVs Based on MOPSOA","authors":"Yehong Du, Bing Li, Jie Li","doi":"10.12733/JICS20105763","DOIUrl":null,"url":null,"abstract":"Regional coverage reconnaissance is a signiflcant means of obtaining the important targets in the region and a prerequisite for the precision strike. The research status of LAVs (Loitering Air Vehicles) regional coverage is analyzed in his paper, and the detector model is built which is applicable to LAV. By analyzing the difierent ways how circular target region should be divided, a conclusion is obtained that the total distance is shortest and the total turning number is least in the parallel split manner; according to the indicators requirements of turning radius and reconnaissance radius, LAV turning method is appropriately given; the objective function of this problem is established and the constraints are determined correspondingly, then this problem had been optimized with MOPSOA (Multi-object Particle Swarm Optimization Algorithm); the obtained path plan after optimization is ideal.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Information and Computational Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12733/JICS20105763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Regional coverage reconnaissance is a signiflcant means of obtaining the important targets in the region and a prerequisite for the precision strike. The research status of LAVs (Loitering Air Vehicles) regional coverage is analyzed in his paper, and the detector model is built which is applicable to LAV. By analyzing the difierent ways how circular target region should be divided, a conclusion is obtained that the total distance is shortest and the total turning number is least in the parallel split manner; according to the indicators requirements of turning radius and reconnaissance radius, LAV turning method is appropriately given; the objective function of this problem is established and the constraints are determined correspondingly, then this problem had been optimized with MOPSOA (Multi-object Particle Swarm Optimization Algorithm); the obtained path plan after optimization is ideal.