火力与指挥控制2011，Vol.36Issue(7)：174-177,4.
面向新任务插入的电子侦察卫星任务规划方法
Mission Planning for Electronic Reconnaissance Satellites Oriented the Insertion of the New Missions
祝江汉 1黄维 1李建军 1王迪2
作者信息
- 1. 国防科技大学信息系统与管理学院,长沙410073
- 2. 解放军75240部队,广东潮州521041
- 折叠
摘要
Abstract
This paper builds up dynamic Constraint Satisfied Problem (CSP) with two-level optimization objective, puts forward a dynamic insertion algorithm based on heuristic rules focusing on the arrival of the new missions with objective to maximize the sum of tasks planned and minimize the changes of the initial reconnaissance plans after the all or some of new mission insertion. At last, it gives an example of the electronic reconnaissance satellites to validate the model and algorithm. The result shows that the algorithm is able to satisfy the require that the variety of original scheme is as small as possible, after inserting new tasks, also validate the model and algorithm. It makes sense in continuing the research and solving the practical problems.关键词
任务规划/电子侦察卫星/动态插入/启发式搜索算法Key words
mission planning/electronic reconnaissance satellite/dynamic insertion/heuristic search algorithm分类
信息技术与安全科学引用本文复制引用
祝江汉,黄维,李建军,王迪..面向新任务插入的电子侦察卫星任务规划方法[J].火力与指挥控制,2011,36(7):174-177,4.
