Sort:
Open Access Just Accepted
Three-stage based Hybrid Metaheuristic Algorithm for Agile Satellites Joint Imaging and Data Transmission Scheduling
Tsinghua Science and Technology
Available online: 08 February 2025
Abstract PDF (1.3 MB) Collect
Downloads:5

As the observation data generated by Earth observation satellites (EOSs) increases, the joint scheduling of satellite imaging and data transmission has become a bottleneck in EOS resource applications. This study has proposed a three-stage-based hybrid meta-heuristic scheduling algorithm for the agile satellite joint imaging and data transmission scheduling (ASJIDTS) problem. The original complex problem is decomposed into three distinct phases: joint task allocation for imaging and data transmission, scheduling of imaging tasks, and scheduling data transmission tasks. During the initial phase of joint task allocation, both imaging and data transmission resources are preemptively allocated using a greedy-based strategy, which considers data transmission opportunities, the conflict degree, and the spatial distribution of different resources. Subsequently, the imaging task scheduling phase generates an optimized sequence for imaging tasks. Based on this sequence, a rule-based multi-insertion strategy for the data transmission scheduling phase has been designed, which ensures rapid responsiveness to data transmission tasks. Extensive experiments have been conducted to verify the proposed algorithm. For the scheduling scenarios with 200 tasks, The hybrid metaheuristic algorithm based on multi-stage(HMA-MS )showed at least a 14.11% increase in scheduling profit compared to several excellent algorithms. The experimental results validated the superior capability of the proposed algorithm in handling large-scale scheduling problems.

Issue
A rapid satellite-ground coverage analysis method based on elevation view element model
Acta Aeronautica et Astronautica Sinica 2024, 45(23): 330372
Published: 15 December 2024
Abstract PDF (1.6 MB) Collect
Downloads:0

The technology of satellite-ground coverage analysis plays an important role in the tasks such as satellite communication, navigation, and Earth observation. Considering the demand for ground coverage by satellite payloads, this paper proposes a fast coverage analysis method with the constraints of the ground elevation angle. The view element equation of the ground elevation angle is established, and the analytical solution expression for the equation is derived. The trajectory intersection method is used to quickly solve for the visible window of the ground elevation field of view to the satellite, namely, the time interval during which the satellite satisfies the ground elevation constraints. Subsequently, an adaptive search method is designed to rapidly determine the visible window. Through simulation experiments, it can be found that the calculation error of the visible window with the proposed method is on the order of 0.01 s and the computational efficiency is improved by 89.7% as compared to traditional numerical methods, verifying the effectiveness and efficiency of the proposed model and method.

Open Access Issue
Hierarchical Disturbance Propagation Mechanism and Improved Contract Net Protocol for Satellite TT&C Resource Dynamic Scheduling
Complex System Modeling and Simulation 2024, 4(2): 166-183
Published: 30 June 2024
Abstract PDF (3.4 MB) Collect
Downloads:17

The practical engineering of satellite tracking telemetry and command (TT&C) is often disturbed by unpredictable external factors, including the temporary rise in a significant quantity of satellite TT&C tasks, temporary failures and failures of some TT&C resources, and so on. To improve the adaptability and robustness of satellite TT&C systems when faced with uncertain dynamic disturbances, a hierarchical disturbance propagation mechanism and an improved contract network dynamic scheduling method for satellite TT&C resources were designed to address the dynamic scheduling problem of satellite TT&C resources. Firstly, the characteristics of the dynamic scheduling problem of satellite TT&C resources are analyzed, and a mathematical model is established with the weighted optimization objectives of maximizing the revenue from task completion and minimizing the degree of plan disturbance. Then, a bottom-up distributed dynamic collaborative scheduling framework for satellite TT&C resources is proposed, which includes a task layer, a resource layer, a central internal collaboration layer, and a central external collaboration layer. Dynamic disturbances are propagated layer by layer from the task layer to the central external collaboration layer in a bottom-up manner, using efficient heuristic strategies in the task layer and the resource layer, respectively. We use improved contract network algorithms in the center internal collaboration layer and the center external collaboration layer, the original scheduling plan is quickly adjusted to minimize the impact of disturbances while effectively completing dynamic task requirements. Finally, a large number of simulation experiments were carried out and compared with various comparative algorithms. The results show that the proposed algorithm can effectively improve the solution effect of satellite TT&C resource dynamic scheduling problems, and has good application prospects.

Issue
Multi-objective dynamic scheduling optimization method for relay satellites based on rolling horizon strategy
Acta Aeronautica et Astronautica Sinica 2024, 45(16): 329706
Published: 15 January 2024
Abstract PDF (2.2 MB) Collect
Downloads:2

To improve the ability of responding to emergencies in the scheduling of relay satellite system, a dynamic scheduling model is proposed based on the rolling horizon strategy in this paper, which decomposes the complex dynamic scheduling process into several static scheduling subproblems. A multi-objective optimization algorithm is designed to solve the subproblems according to the demand for dynamic scheduling of the relay satellite. Firstly, a dynamic scheduling model for the relay satellite is constructed to obtain the maximum task completion rate and the minimum adjustment range of scheduling scheme. Then, based on dynamic scheduling characteristics, a dynamic task scheduling method is proposed. The method adopts a hybrid rescheduling mechanism based on cycle and event-driven, divides the scheduling process into scheduling intervals, and uses a multi-objective evolutionary algorithm based on adaptive neighborhood search to schedule the window tasks in each interval. To verify the effectiveness of the proposed dynamic scheduling model and algorithm, a large number of simulation experiments are carried out. The experimental results prove the superiority of the proposed method in solving the dynamic scheduling problem of relay satellite. Compared with the cutting-edge multi-objective optimization methods of NSGA-Ⅱ, MDSA-NSGA-Ⅱ, and MODJA, the algorithm designed in this paper can generate higher quality solutions.

Open Access Issue
Variable Reduction Strategy Integrated Variable Neighborhood Search and NSGA-II Hybrid Algorithm for Emergency Material Scheduling
Complex System Modeling and Simulation 2023, 3(2): 83-101
Published: 20 June 2023
Abstract PDF (1.4 MB) Collect
Downloads:168

Developing a reasonable and efficient emergency material scheduling plan is of great significance to decreasing casualties and property losses. Real-world emergency material scheduling (EMS) problems are typically large-scale and possess complex constraints. An evolutionary algorithm (EA) is one of the effective methods for solving EMS problems. However, the existing EAs still face great challenges when dealing with large-scale EMS problems or EMS problems with equality constraints. To handle the above challenges, we apply the idea of a variable reduction strategy (VRS) to an EMS problem, which can accelerate the optimization process of the used EAs and obtain better solutions by simplifying the corresponding EMS problems. Firstly, we define an emergency material allocation and route scheduling model, and a variable neighborhood search and NSGA-II hybrid algorithm (VNS-NSGAII) is designed to solve the model. Secondly, we utilize VRS to simplify the proposed EMS model to enable a lower dimension and fewer equality constraints. Furthermore, we integrate VRS with VNS-NSGAII to solve the reduced EMS model. To prove the effectiveness of VRS on VNS-NSAGII, we construct two test cases, where one case is based on a multi-depot vehicle routing problem and the other case is combined with the initial 5∙12 Wenchuan earthquake emergency material support situation. Experimental results show that VRS can improve the performance of the standard VNS-NSGAII, enabling better optimization efficiency and a higher-quality solution.

Total 5