An Algorithm for Solving the Scope of Spacecraft's Launchable Area Under Energy and Time Constraints
A time-constrained and energy-constrained technology, applied in the field of spacecraft orbital dynamics, can solve problems such as difficulty in improving accuracy, large amount of calculation, and large amount of calculation, and achieve the effect of good promotion and application prospects, simple algorithm, and simple engineering implementation.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0116] (1) Considering that the target spacecraft will pass through the orbital plane of one’s own spacecraft many times in one day, the position of the target spacecraft at each crossing time is taken as the target point, and its radius is used as the radius of the target orbit to calculate the launchable area. The following is the initial value of the orbital elements of the own spacecraft and the target spacecraft:
[0117] Table 1 Statistical table of the initial value of the orbital elements of both sides in the calculation of the launchable area
[0118]
[0119] Such as Figure 12 As shown, the target spacecraft will pass through the orbital plane of its own spacecraft 19 times in one day, and thus the range of the launchable area for 19 times can be obtained. It takes about 0.1s to calculate the crossing time and position, and the corresponding launchable area. It can be seen that as the number of intersections changes, the radius of the target point will also chang...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


