Paired-Outcome Learning for Selective Spacecraft Attitude Capture under Torque Limits
Organizations: School of Astronautics, Beihang University, Beijing 100191, China · Astroup(Beijing) Technology Co., Ltd.
Abstract
Torque-limited spacecraft attitude capture requires adapting the maneuver speed to uncertain braking authority. Faster settings can reduce average tracking error while worsening individual maneuvers, making selective modification of an existing controller a baseline-relative learning problem. A paired-outcome method combines three mechanisms: physically interpretable continuation policies with different speed envelopes, separate prediction of task failure and successful-pair tracking gains, and context-dependent rejection that executes the unchanged baseline. Complete paired simulations provide labels under common plant parameters and measurement seeds; training, validation, and calibration are separated by context. Basilisk experiments use 108 development contexts, 324 labeling rollouts, and 624 evaluation episodes across 48 test contexts, including disclosed post-freeze diagnostics. The selective controller reduces aggregate integrated attitude error by 4.67% relative to the branch baseline, with 17 improvements, 31 exact ties, and no observed regressions. Always using the fast alternative achieves a 4.81% reduction but worsens 11 cases. Gains occur in principal-axis, near-axis, braking-boundary, and selected noise/drift maneuvers; general coupled cases retain the baseline. Ablations show no additional aggregate benefit from branch commitment, active querying, or score subtraction. The evidence supports a restricted empirical trade-off between average improvement and individual regression, without establishing a closed-loop safety guarantee.
Figures & tables
| Action | Capture target update | ||||
|---|---|---|---|---|---|
| 0: baseline | 1.6 | 0.65 | 8 | 15 | inherited replanning |
| 1: balanced | 1.6 | 0.80 | 4 | 10 | retain chosen target |
| 2: fast | 1.8 | 0.85 | 3 | 8 | retain chosen target |
| Stage | Contexts | Full rollouts | Purpose |
| Base training | 48 | 144 | preliminary fitting |
| Training-only queries | 12 | 36 | training augmentation |
| Validation | 24 | 72 | rule / fixed-policy selection |
| Calibration | 24 | 72 | score subtraction |
| Development total | 108 | 324 | excludes inherited branch data |
| Initial frozen test | 48 | 384 | eight configurations per case |
| Configuration | Tasks | Mean IAE | Settling | Effort | Regressions |
|---|---|---|---|---|---|
| Native PD † | 0/48 | 63,340.6 | — | 98.44 | 47 |
| Branch baseline | 48/48 | 26,060.4 | 400.92 | 81.72 | 0 |
| Prior gated speed | 48/48 | 26,059.7 | 397.21 | 81.93 | 2 |
| Validation-fixed (= baseline) | 48/48 | 26,060.4 | 400.92 | 81.72 | 0 |
| Fixed balanced † | 48/48 | 25,118.4 | 393.12 | 82.47 | 10 |
| Fixed fast † | 48/48 | 24,806.0 | 393.55 | 82.85 | 11 |
| Comparison | Reduction (%) | Win/tie/loss | 95% interval |
|---|---|---|---|
| Branch baseline | 4.67 | 17/31/0 | |
| Prior gated speed | 4.67 | 11/32/5 | |
| Geometric lookup | 1.53 | 8/31/9 | |
| No active queries | -0.05 | 2/43/3 | |
| No score subtraction | -0.12 | 0/45/3 | |
| Greedy gain | -1.23 | 4/24/20 |
| Family | Baseline IAE | Selective IAE | Reduction (%) | Adoptions |
|---|---|---|---|---|
| Ordinary | 5,642.0 | 5,642.0 | 0.00 | 0/8 |
| Principal axis | 31,279.5 | 28,853.9 | 7.75 | 6/8 |
| Near axis | 32,777.6 | 30,564.3 | 6.75 | 5/8 |
| Coupled | 15,047.9 | 15,047.9 | 0.00 | 0/8 |
| Braking boundary | 45,037.7 | 43,048.9 | 4.42 | 4/8 |
| Noise and drift | 26,577.6 | 25,897.6 | 2.56 | 2/8 |
Policy Learning
Policy learning develops decision rules that choose actions or interventions to maximize outcomes from data, feedback, or interaction.
See all 484 papers