Method for scheduling target roll angle in constellation area based on greedy algorithm
A technology of regional target and greedy algorithm, which is applied in the field of satellite mission planning and scheduling, can solve the problems of increasing the time and workload of regional data information acquisition, leaving gaps in the coverage strip, coverage problems, etc., to solve the problem of ineffective coverage, The effect of shortening the elapsed time
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0057] Based on the Walker Constellation:
[0058] see Figure 1-2 , the present invention provides a technical solution: a greedy algorithm-based method for scheduling target roll angles in constellation areas, comprising the following steps:
[0059] S1. Determine the constellation configuration;
[0060] S2, establishing a simplified satellite orbit extrapolation model;
[0061] S3, calculating the position of the sub-satellite point;
[0062] S4. Calculating satellite coverage strips;
[0063] S5, setting the target area and performing grid processing;
[0064] S6, adding constraints;
[0065] S7. Using a greedy algorithm to calculate the side swing angle of the load;
[0066] S8. Outputting a simulation result.
[0067] Specifically, the specific operation method in step S1 is:
[0068] Based on 8 orbital planes, each orbital plane has 8 satellites in the Walker constellation, the orbital height is 600km, the orbital inclination is 97.65°, the ascending node right...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


