Bibliographic record
Abstract
Abstract This paper studies the libration-free cargo transfer control of a partial space elevator where the main satellite may change its orbital state in the transfer period. The orbital motion of the main satellite in the climber transfer period is first studied. Then, a reduced-order libration-free dynamics of the partial space elevator is derived. Accordingly, a novel libration-free switching control strategy is proposed to stabilize the cargo transportation with two alternating controllers. The Controller I controls the cargo speed in the libration-free mode by a shrinking horizon model predictive control based on the reduced-order libration-free dynamic mode of the partial space elevator. This leads to high computational efficiency in control. Once the libration is induced by the cargo transfer, the control turns off the Controller I and activates the Controller II to suppress the libration to zero within one time step of the Controller I by a novel prescribed-time control law based on the fixed-time control scheme. The stability of the control is proved in the Lyapunov framework. The validity and effectiveness of the proposed control strategy are demonstrated by computation simulation. Simulation results reveal that the proposed control strategy is effective in keeping stable cargo transportation while ensuring the equilibrium state at the end of transportation.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".