A method for generating lunar flyby trajectories
By dividing the lunar leaper trajectory into six stages and using convex optimization methods, the problem that the existing technology cannot effectively complete the flight detection task is solved, and a simpler and more reliable trajectory design method is realized to meet the actual task requirements and constraints.
CN114995125BActive Publication Date: 2025-03-21BEIJING INST OF CONTROL ENG
2 Cites 0 Cited by
Patent Information
- Application Number
- CN202210494769.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-05-07
- Publication Date
- 2025-03-21
- Estimated Expiration
- 2042-05-07
AI Technical Summary
Technical Problem
The existing technology cannot effectively complete flight detection tasks, especially in the design of lunar leap trajectory, and it is difficult to meet actual mission requirements and constraints.
Method used
A method for generating lunar leap trajectory is proposed. By setting a two-degree of freedom motion model, the leap trajectory is divided into six stages, and the convex optimization method is used to generate the optimal trajectory to meet task requirements and constraints.
Benefits of technology
It realizes a simpler and more reliable trajectory design method, which can be used online or offline, providing a general trajectory design method for celestial surface flight detection tasks, consuming less propellant, wider versatility and stronger practicality.
✦ Generated by Eureka AI based on patent content.
Abstract
The invention relates to a method for generating a lunar flyby trajectory, and belongs to the field of trajectory design of a celestial body surface flying probe. A two-degree-of-freedom motion model is established in a flyby trajectory plane. The flyby trajectory is divided into six stages. Parameters of the five stages except a convex optimization stage in the two-degree-of-freedom motion model are set. The variable segment conditions of the five stages are set. The flight time range of the convex optimization stage is set. The convex optimization variable form, objective function, and constraint conditions are set. The initial conditions of the convex optimization stage are set. The end conditions of the convex optimization stage are set. The trajectory of the convex optimization stage is generated. The attitude deviation of the convex optimization stage at the connection with the first and second turning stages, and the mass deviation at the connection with the second turning stage are calculated. If the deviations are all less than the set values, the current trajectory is the final generated trajectory. Otherwise, the next step is turned to. According to the deviations, the flight time of the two turning stages and the initial mass of the approaching stage are respectively corrected. The invention is simple and reliable, and is suitable for offline or online calculation.
Need to check novelty before this filing date? Find Prior Art