An Evolutionary Framework for Multi-Objective Trajectory Design and Robust Model Predictive Control in Long-Range Rendezvous Missions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This thesis presents an optimization architecture for on-orbit servicing mission design in the long-range rendezvous phase. We develop a methodology to generate Pareto Optimal trajectories for long-range rendezvous of a servicing satellite with a moving target. The methodology employs a multi-impulse shape-based trajectory planning algorithm for in-plane orbit transfer, based on the two-body problem. We first derive the necessary and sufficient conditions that determine the set of smooth impulsive trajectories connecting the servicing satellite to the orbiting target. The Pareto Optimal trajectories from this set are then obtained using a constrained multiobjective optimization algorithm developed based on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Transfer time and control effort are the two Pareto cost functions that are considered in the multi-objective optimization. To reduce the risk of collision in populated orbits and to remain in an orbital regime, we include restrictions on orbital elements as part of the constraints. Further, a maximum available impulse is considered as an upper-bound for velocity changes in an impulsive trajectory. The number of impulses along with the location of the first impulse in the parking orbit and the orbital parameters of the intermediate orbits form the set of design variables. We demonstrate the superiority of the developed trajectory planner by comparing its results with those obtained from another multi-objective evolutionary algorithm called the Multi-Objective Genetic Algorithm and an optimal Lambert approach. In an on-orbit servicing mission, a solution from the Pareto frontier set of optimal trajectories may be selected based on the mission requirements.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it