The agile earth observation satellite scheduling with multiple resource constraints
With the development of space technology,the demand for optical remote sensing image is becoming increas-ingly widespread.However,due to the high cost of launching,the resources of satellites cannot meet the needs.Therefore,improving the efficiency of satellite utilization is of great value.This article focuses on the scheduling problem of agile ob-servation satellites,which involves developing scheduling plans within a given scheduling period under on-board resource constraints.The difficulty lies in the limited resources,such as fixed storage resources for image data,energy resources for data acquisition and satellite attitude switching,and time resources.Energy consumption and time consumption depend on the observation time,which is exclusive for agile satellites compared to non-agile satellites.Different scenarios have different demands for different types of resources,multiple resource constraints are coupled,and resource constraints are time-dependent.These challenges greatly increase the difficulty.This article constructs an integer programming model and proposes an iterative local search heuristic based on an adaptive selection factor.The factor considers target benefits,resource consumption,and resource constraints.The algorithm can adaptively determine the local search direction based on the usage of various types of resource data in the current instances,thus finding high-quality solutions.Experimental results demonstrate that the proposed algorithm outperforms the current best algorithm.Furthermore,the adaptive selection factor yield high solution quality because the factor consider the trade-off between target benefits and resource consumption,and accurately capture the urgency of resource demand.
satellite schedulingiterated local searchdynamic programmingtime-dependencydata verification
国家科技期刊平台
NSTL
万方数据
