首页 | 本学科首页   官方微博 | 高级检索  
     

多星侦察移动目标:一种基于潜在区域的求解策略
引用本文:慈元卓,白保存,阮启明,贺仁杰.多星侦察移动目标:一种基于潜在区域的求解策略[J].传感技术学报,2008,21(6):1015-1019.
作者姓名:慈元卓  白保存  阮启明  贺仁杰
作者单位:国防科学技术大学信息系统与管理学院,长沙,410073
摘    要:针对面向移动目标侦察的多星联合调度,提出了一种新颖的求解策略:将移动目标问题转变为区域目标问题,即在多星联合侦察的框架内利用电子侦察引导信息构建移动目标的潜在区域,基于约束满足问题(CSP)描述方法以最大覆盖率为目标建立了面向潜在区域目标的多星联合调度模型,并提出了相应的禁忌搜索算法。通过基于潜在区域的求解策略,可以优化星载遥感器的侦察方案,指导移动目标侦察任务的执行。

关 键 词:多星联合调度  移动目标  潜在区域  约束满足问题  禁忌搜索
文章编号:1004-1699(2008)06-1015-05
修稿时间:2007年10月23

Moving Target Reconnaissance by Multi-Satellite: A strategy Based on Latent Area
Ci Yuanzhuo,Bai Baocun,Ruan Qiming,He Renjie.Moving Target Reconnaissance by Multi-Satellite: A strategy Based on Latent Area[J].Journal of Transduction Technology,2008,21(6):1015-1019.
Authors:Ci Yuanzhuo  Bai Baocun  Ruan Qiming  He Renjie
Affiliation:College of Information System and Management, NUDT, Changsha, Hunan 410073, China
Abstract:A novel solution strategy for the joint scheduling of moving target reconnaissance by multi-satellite is put forward which transforms the moving target problem into area target problem.With the help of directing information from electronic reconnaissance satellite,A latent area is established under the framework of joint reconnaissance by multi-satellite.Latent area oriented maximum coverage model of multi-satellite joint scheduling is described by the form of constraint satisfaction problem.And the corresponding Tabu search algorithm is also given.By the strategy of latent area,reconnaissance plan of remote sensors is optimized which will direct the operation of moving target reconnaissance.
Keywords:joint scheduling of multi-satellite  moving target  latent area  constraint satisfaction problem  tabu search
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《传感技术学报》浏览原始摘要信息
点击此处可从《传感技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号