48 results about "Satellite scheduling" patented technology

A method includes: a) producing initial scheduling plans based on requests related to tasks to be performed within a time period by a remote sensing satellite; wherein each initial scheduling plan schedules respective tasks, which do not conflict with each other in time and in using satellite resources; and each task is scheduled in at least one of the initial scheduling plans; b) applying a genetic-algorithm-based processing to the initial scheduling plans to produce a genetic-algorithm-based scheduling plan which is for mission objectives, and complies with constraints related to the satellite resources, to the tasks, and to the time period; and c) applying a simulated-annealing-based processing to the genetic-algorithm-based scheduling plan to produce a simulated-annealing-based scheduling plan that fits the mission objectives, complies with the constraints, and in which a larger number of tasks is scheduled than in the genetic-algorithm-based scheduling plan.

The invention relates to an algorithm for solving the imaging satellite-oriented time-dependent scheduling problem. The imaging satellite-oriented time-dependent scheduling problem is the extension of the traditional satellite scheduling problem. According to the invention, modeling is performed for the problem for the time-dependent relationship between the task earnings and the imaging time, and a heuristic algorithm for solving the problem is provided. According to the invention, the time dependence is taken into account in the traditional satellite scheduling problem, so the imaging quality can be improved, the possibility for generating useless products can be reduced, and the solving effect of the provided heuristic algorithm is superior to the constrained programming algorithm engine ILOG CP Optimizer of the IBM company.

The invention provides a multi-satellite scheduling method for large-area target observation. Firstly, according to the user's demand, the observation task is determined, that is to say, the target area T (i.e., the position and area of the known target area) to be observed is determined. A set of available satellites S and satellite parameter information for all available satellites in the set ofavailable satellites S are determined. Then the target region is discretized and the target region is decomposed into stripes. The method converts the multi-satellite scheduling problem oriented to large-area target observation into a set covering problem with a plurality of constraints, and establishes a mathematical model. Finally, the mathematical model established in S4 is solved by genetic algorithm, and the output is the observation plan obtained from the solution. The method solves the problem that the satellite image acquisition method related to the current environmental protection activities consumes long time and has the phenomenon of coverage omission, and the method of the invention can obtain a feasible observation scheme with higher target coverage rate for a specific observation area.

The invention discloses a satellite scheduling method based on an active observation task. At least an execution area and execution time of an imaging task are obtained based on real-time task demanddata; Classifying the imaging tasks based on parameters, execution areas and execution time of the remote sensing satellites to establish an imaging task set needing at least two remote sensing satellites to cooperatively complete; Screening out at least two remote sensing satellites respectively involved in each imaging task based on the execution starting time and the execution ending time of the execution time; dividing the overlapped imaging time windows of the remote sensing satellites into a plurality of sub-imaging time windows, wherein the remote sensing satellites establish an initialto-be-observed task list based on the sub-imaging time windows according to a mode of alternately executing an imaging task and an imaging data download task. The remote sensing satellites are set toexecute the imaging task and the data downloading task in an alternating mode, and dramatic increase of the storage capacity of the remote sensing satellites can be effectively reduced in the mode ofincreasing the data turnover speed.

The invention belongs to the satellite scheduling field and relates to a relay satellite single-address antenna scheduling random search method based on conflict resolution. The method comprises the following steps: (S1) matching the relay satellite resources for the task according to the alternative service time window information submitted by the task; 12) generating an initial solution of a relay satellite single-access antenna scheduling random search accord to a task resource matching result; (3) evaluating the fitness of the current solution, finding out the key task causing the conflict, and generating a perturbation -deletion pool of the task; (4) randomly perturbing or deleting tasks in the perturbation-deletion pool, and gradually iteratively resolving task conflicts; (S5) updating resource and task sets: deleting the resource and task without conflict and updating the resource and task set. The method of the invention has high speed, is suitable for large-scale relay satellite dispatching scene, adopts double iterative structure, and generates a dispatching scheme with high quality.

The invention discloses a multi-agile earth observation satellite task allocation method based on a large neighborhood search algorithm. Self-adaptive large neighborhood search of a single satellite scheduling problem is expanded to a multi-satellite scheduling problem. By defining four allocation operations, an adaptive task allocation mechanism is introduced into a large neighborhood search framework. In large neighborhood search based on adaptive task allocation, a removal operation removes a task from a current solution, an insertion operation inserts the task into the removed solution, and an allocation operation reallocates the task to different satellites if the solution is still not improved after multiple iterations. According to the method, the task allocation problem of the agile earth observation satellite group of the dynamic tasks is optimized, so that the dynamic tasks can be processed at any time in the operation process of satellites.

The invention provides a satellite task scheduling method and system based on time window segmentation, and relates to the field of satellite scheduling. The method comprises the following steps: obtaining a visible time window of a satellite task; discretizing the visible time window to obtain an observation time window; performing real number encoding on the satellite task based on the observation time window to obtain a satellite task sequence; acquiring a satellite task population based on the satellite task sequence; performing crossover operation on the satellite task population based ona preset two-generation competitive optimization algorithm; and performing mutation operation on the satellite task population after the crossover operation based on a double-gene mutation method toobtain a satellite task scheduling scheme. According to the invention, the efficiency of satellite observation tasks is improved.

The invention discloses an agile satellite scheduling method considering time-dependent conversion time. The agile satellite scheduling method comprises the steps of obtaining a to-be-observed targetsequence and preprocessing the to-be-observed target sequence; constructing an agile satellite scheduling model of time-dependent conversion time; inputting the preprocessed to-be-observed target sequence into an agile satellite scheduling model, and solving the agile satellite scheduling model; and outputting a solving result in the step 3 to obtain a scheduling scheme of the agile satellite. Dueto the fact that the time dependence of the attitude conversion time between the continuous observation tasks is considered, the constructed agile satellite scheduling model can better meet the scheduling requirement, and the scheduling efficiency of the solved scheduling scheme is higher. In the solving process, the earliest and latest unreachable time of each time window and the earliest starting time and latest starting time between any pair of observation windows in the same circle are pre-calculated, so that repeated calculation is reduced when insertion operation is tried, the calculation time is shortened, and the scheduling efficiency is improved.

The invention provides a multi-satellite multi-station data downloading scheduling method and system, and relates to the technical field of satellite scheduling. According to the imaging request deadline requirement required by a user, the latest task downloading end time is calculated, the task imaging weight is defined, clustering is carried out according to a satellite downloading time window, and an available ground station is selected for data downloading. Different from data downloading scheduling based on greedy rules and the like in previous research, a downloading scheduling strategy based on task deadline is provided, so that the downloading time sensitivity of a currently planned task is relatively low, and the solving efficiency and effect are improved.

The invention provides a satellite task planning method and system based on a greedy adaptive annealing contract net algorithm, a storage medium and electronic equipment, and relates to the field of satellite scheduling. According to a preset slave satellite mathematical model, each slave satellite generates a corresponding current bidding scheme for a task sequence which is not arranged currently by adopting a greedy-based adaptive annealing contract net algorithm; according to a preset main satellite mathematical model, the main satellite performs bid evaluation by adopting a total observation income maximization bid evaluation strategy, and a bid winning scheme is selected from the bidding schemes; and finally, outputting a global optimal satellite task planning scheme. By establishing a double-layer decision mathematical model, the problem of inconsistency of a main target and a sub-target existing in distributed satellite task allocation and scheduling problems which are not considered by a traditional contract network is solved; and a scheme with higher quality is obtained through multiple rounds of bidding and bidding processes.

The invention provides a relay satellite mission scheduling method and system, and relates to the technical field of relay satellites. The method comprises the following steps: setting scheduling initial information, and acquiring at least two pieces of mission information; respectively calculating greedy function values of the at least two pieces of mission information; sequencing the greedy function values to obtain a mission sequence corresponding to the greedy function values, and establishing a mission constraint candidate list according to the sequence; updating antenna pointing path information according to the mission constraint candidate list; and acquiring a feasible solution for relay satellite mission scheduling based on a constraint condition of the antenna pointing path information. According to the relay satellite mission scheduling method provided by the invention, the technical problems of unreasonable preparation time distribution, waste of antenna time resources andinfluence on the relay service quality which are caused by the reason that the relay satellite scheduling system reserves the longest and same mission preparation time for all users are solved, and atechnical effect of optimizing the relay satellite mission scheduling is achieved.

The invention belongs to the satellite scheduling field and relates to a relay satellite single-address antenna dynamic scheduling method for temporary task arrival. The method comprises the followingsteps: (1) according to the temporary task application information to be processed, matching the visible time window and the antenna available time window; if there are available time period resources, scheduling the temporary task; otherwise, proceeding to the next step; (2) analyzing the scheduled tasks that conflict with the temporary task requirements, and generating t set of tasks to be adjusted at the current layer; (3) trying to adjust the tasks to be adjusted, and if the scheduling is successful, putting an end to the scheduling process; otherwise proceeding to the next step; 4) deleting the resources occupied by the tasks to be adjusted in the current layer, and after scheduling the original temporary tasks, treating the tasks to be adjusted in the current layer as new temporarytasks respectively, so as to realize the expansion operation of the adjustment tree; if the conflicts are resolved within the set adjustment times, determining that the original temporary tasks are scheduled successfully, and outputting the adjusted scheduling scheme; otherwise, outputting the initial scheduling scheme.

The invention discloses a relay satellite single-address antenna scheduling method suitable for breakpoint resumption. The method comprises the steps of obtaining a to-be-distributed task set; establishing a planning model of antenna scheduling, and defining an objective function and constraint conditions; allocating the tasks by adopting a two-stage scheduling algorithm, wherein the two-stage scheduling algorithm comprises a complete task distribution stage and a breakpoint resume task distribution stage, and the algorithm comprises the task resource matching, task available resource set generation, available time period conflict degree calculation, task insertion and operator updating by a task available resource set. The method of the invention aims to solve the problems of low task completion rate and low resource utilization rate caused by the difference of task requirements during the relay service process, considers the actual situation and the user requirements of the relay service at the same time and improves a traditional relay satellite application model, the algorithm can obtain a high-quality scheduling scheme within the shorter time, and is suitable for a relay satellite scheduling scene with higher requirements for scheduling time and has gains at the aspects of task completion rate, resource utilization rate and the like.

The invention provides a satellite screening method and system based on task invitation, and relates to the field of satellite scheduling. The method comprises the following steps: acquiring historical task data, wherein the historical task data comprise historical tasks and satellites corresponding to the historical tasks; acquiring a historical task demand vector based on the historical task; obtaining a to-be-observed task demand vector based on the to-be-observed task; obtaining the similarity between the historical task and the to-be-observed task based on the two demand vectors; obtaining a target historical task based on the similarity, and extracting a target satellite corresponding to the target historical task; inviting the target satellite based on the to-be-observed task; if the target satellite meets the energy constraint, the storage capacity constraint and the task time window constraint at the same time, enabling the target satellite to accept the invitation to obtain an invited satellite; if the number of the invited satellites is one, enabling the invited satellite to execute the task to be observed; and if the number of the inviting satellites is more than one, executing the task to be observed by the inviting satellite with the maximum income when the task to be observed is executed. The method and system are high in satellite screening efficiency.

The invention provides a multi-satellite multi-station integrated scheduling method and system, and relates to the technical field of satellite scheduling. According to the embodiment of the invention, a diversified neighborhood structure is introduced according to an initial multi-satellite multi-station integrated scheduling scheme to obtain an optimal scheduling scheme, a local optimal solution is obtained quickly, and the solving quality is improved; whether the optimal scheduling scheme is caught in local optimum or not is judged, if yes, a disturbance mechanism is started to remove a part of observation tasks from the optimal scheduling scheme, the removed tasks are kept in an inactive table, and when one of the tasks is triggered, proposed three removal operators are called so as to improve the solving quality; the optimal scheduling scheme for removing part of observation tasks is traversed, the data transmission process is optimized, observation data downloading is arranged, unnecessary data downloading activities are canceled, unnecessary energy consumption is reduced, the satellite resource utilization rate is increased, meanwhile, time is saved, and more opportunities are provided for observation activities.

The invention provides a task allocation method in a virtual constellation dynamic environment, and relates to the technical field of satellite scheduling. The method comprises the steps that when a virtual constellation management and control system receives a to-be-processed task, a meta-task set corresponding to the to-be-processed task is formed; the satellite platform searches an executable task set of each satellite in the management domain of the satellite platform and sends the executable task set of each satellite in the management domain of the satellite platform to the virtual constellation management and control system; a candidate meta-task subset formed by the executable meta-tasks of each satellite is determined in the management domain of the satellite platform; and the meta-task with the maximum expected revenue of each satellite in the candidate meta-task subset is used as the meta-task expected to bid by the satellite in the candidate meta-task subset; aiming at eachmeta-task in the meta-task set, the virtual constellation management and control system forms a candidate satellite set corresponding to the meta-task set; and an ordered satellite sequence corresponding to the meta-task is determined. According to the present invention, the task allocation efficiency can be improved.