期刊文献+

浮空平台对区域覆盖的优化部署算法研究

An Optimized Algorithm for Area-Coverage Deployment of Aerostat Platform
在线阅读 下载PDF
导出
摘要 保证对区域目标的覆盖率、重叠率以及部署平台数量的均衡是浮空平台对区域覆盖部署的重要工作。提出基于遗传算法的浮空平台部署规划算法,使用变长染色体对方案进行编码;采用启发式与随机生成两种方法构造初始种群,既考虑到平台分布性又考虑到种群多样性,使算法能尽快搜索出优化解;根据应用需要设置合理的加权系数,采用平方加权法设计方案评价函数;设计了动态插入、删除算子,使搜索过程中自动根据方案效果进行动态调整。仿真实验表明,该算法能在较短时间内求得满足要求的部署方案,提高了浮空平台对区域覆盖规划的效率。 The area-coverage deployment of aerostat platforms is to ensure the coverage rate,overlapping rate and the balance of platform amount.A platform deployment algorithm based on genetic algorithm was proposed,in which the variable-length chromosomes were used to encode the program,and both the heuristics and randomly generated methods used for constructing the initial population.Both platform distribution and the diversity of population were taken into consideration,so that the algorithm can search out the optimum solution as quickly as possible.A reasonable weighting factor was set up depending on the application needs,and squared weighting method was used to design the evaluation function.A dynamic insert/delete operator was used,thus adjustment could be made automatically according to the program effectiveness during searching.Simulation results showed that this algorithm can obtain a program in a relatively short period of time,which meets the requirements of the deployment and improves the efficiency of the platform deploying planning.
出处 《电光与控制》 北大核心 2010年第11期9-12,共4页 Electronics Optics & Control
基金 "八六三"项目基金资助(2006AA701117)
关键词 浮空平台 区域覆盖 遗传算法 多目标优化 aerostat platform area coverage genetic algorithm multi-objective optimization
  • 相关文献

参考文献8

二级参考文献28

  • 1马云红,周德云.基于遗传算法的无人机航路规划[J].电光与控制,2005,12(5):24-27. 被引量:60
  • 2曹秀云.近空间飞行器成为各国近期研究的热点(上)[J].中国航天,2006(6):32-35. 被引量:42
  • 3BRUMBAUGH S J, SHIER D. An Empirical Investigation of Some Bicriterion Shortest Path Algorithms [ J ]. European Journal of Operational Research, 1989, 43:216-224.
  • 4AZVEDO J, MARTINS E Q V. An Algorithm for the Multiobjective Shortest Path Problem on Acyclic Networks[J]. Investigacao Operational, 1991,11:52-69.
  • 5GAREY M, JOHNSON D. Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. 1979.
  • 6ZITZLER E. SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization[ A] . In Evolutionary Methods for Design, Optimisation and Control [ C].Barcelona, Spain, 2002:19-26.
  • 7RUDOLPH G, AGAPIE A. Convergence Properties of Some Multi-Objective Evolutionary Algorithms[A]. Proceedings of the 2000 Congress on Evolutionary Computation [C]. 2000,2:1010-1016.
  • 8AHN C W, RAMAKRISHNA R S. A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations[J]. IEEE Transactions on Evolutionary Computation, 2002,6(6) :566-579.
  • 9玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..
  • 10QU Liang-sheng,SUN Rui-xiang.A synergetic approach to genetic algorithms for solving traveling salesman problem[J].Information Sciences,1999,117:267-283.

共引文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部