Metraipolis › archive › dc_bee890d0e7e2

Optimal Search for Finding Satellites Post-Launch — arXiv:2610.07300

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07300
License (as archived)
CC0-1.0
Archived
2026-10-07T21:07:03.614Z
SHA-256 of the archived text
2d02cad03a5b1136fda34e08fa2aa90062b6cbfadeb904abe89ded264beb70fa
Stable URL of this page
https://metraipolis.com/documento/dc_bee890d0e7e2

How to cite

Optimal Search for Finding Satellites Post-Launch — arXiv:2610.07300 — arXiv (en), https://arxiv.org/abs/2610.07300 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bee890d0e7e2 (Metraipolis archive dc_bee890d0e7e2, sha256 2d02cad03a5b1136fda34e08fa2aa90062b6cbfadeb904abe89ded264beb70fa)
BibTeX
@misc{dcbee890d0e7e2,
  title = {Optimal Search for Finding Satellites Post-Launch — arXiv:2610.07300},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07300},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bee890d0e7e2; sha256 2d02cad03a5b1136fda34e08fa2aa90062b6cbfadeb904abe89ded264beb70fa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07300. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper introduces Bayesian Continuation Model Predictive Control (BC-MPC), an adaptive method that replans near-term antenna pointings while continuing a feasible baseline sweep, for finding and establishing contact with spacecraft immediately after launch when their true positions are most uncertain. After separation, launch and deployment errors can leave the spacecraft sufficiently far from its predicted position that operators must actively search for it during ground contacts to establish communications. Each missed detection provides information about which orbital hypotheses remain plausible, but searching one part of the uncertainty region can consume the time needed to reach another. BC-MPC updates a particle-based orbital belief after missed detections and replans antenna pointing guidance while retaining feasibility. Its continuation helps preserve future search coverage that greedy and short-horizon methods can sacrifice for immediate acquisition gains. We compare BC-MPC against the operationally prevalent along-track sweep and additional search algorithms under common search-time budgets, initial uncertainty, and antenna constraints. Across 96 simulated deployments with matched uncertainty, BC-MPC improves acquisition probability over the along-track sweep and reduces restricted mean acquisition time. We additionally evaluate the method using pre-launch, post-launch, and initial acquisition ephemerides for 83 spacecraft from the Transporter-16 rideshare launch. Using either pre-deployment or post-deployment two-line element sets (TLEs) for planning, BC-MPC improves modeled acquisition probability over the along-track sweep by approximately 12 percentage points under the commonly assumed uncertainty model.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.07300 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T20:38:49.021Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).