摘要
针对面向移动目标侦察的多星联合调度,提出了一种新颖的求解策略:将移动目标问题转变为区域目标问题,即在多星联合侦察的框架内利用电子侦察引导信息构建移动目标的潜在区域,基于约束满足问题(CSP)描述方法以最大覆盖率为目标建立了面向潜在区域目标的多星联合调度模型,并提出了相应的禁忌搜索算法。通过基于潜在区域的求解策略,可以优化星载遥感器的侦察方案,指导移动目标侦察任务的执行。
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.
出处
《传感技术学报》
CAS
CSCD
北大核心
2008年第6期1015-1019,共5页
Chinese Journal of Sensors and Actuators
基金
国家自然科学基金资助项目(70601035)
关键词
多星联合调度
移动目标
潜在区域
约束满足问题
禁忌搜索
joint scheduling of multi-satellite
moving target
latent area
constraint satisfaction problem
tabu search
