Metraipolis › archive › dc_7d345fbc357d

Convex Pursuit-Evasion Games for Spacecraft Proximity Operations on Circular and Elliptical Orbits — arXiv:2609.14337

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.14337
License (as archived): CC0-1.0
Archived: 2026-10-16T00:39:15.278Z
SHA-256 of the archived text: 1bbab639f546aaee3478d025de38c45c458c6a1350648aa2613cd8921562b2c2
Stable URL of this page: https://metraipolis.com/documento/dc_7d345fbc357d

How to cite

Convex Pursuit-Evasion Games for Spacecraft Proximity Operations on Circular and Elliptical Orbits — arXiv:2609.14337 — arXiv (en), https://arxiv.org/abs/2609.14337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d345fbc357d (Metraipolis archive dc_7d345fbc357d, sha256 1bbab639f546aaee3478d025de38c45c458c6a1350648aa2613cd8921562b2c2)

BibTeX

@misc{dc7d345fbc357d,
  title = {Convex Pursuit-Evasion Games for Spacecraft Proximity Operations on Circular and Elliptical Orbits — arXiv:2609.14337},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14337},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d345fbc357d; sha256 1bbab639f546aaee3478d025de38c45c458c6a1350648aa2613cd8921562b2c2},
  year = {2026}
}

Archived text

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

Inspecting or servicing a non-cooperative spacecraft is a two-player game: the target can thrust to defeat the inspector's plan. Hamilton-Jacobi-Isaacs reachability answers such games exactly but its cost grows exponentially with state dimension, while learning-based controllers scale yet certify nothing. Convex formulations are the usual escape, typically cast as convex-concave saddle-point problems. That framing fails in the terminal-distance orbital game: with effort regularization, the payoff is convex in both controls, so no pure open-loop saddle point need exist. In its place we derive two exact one-sided guarantees read from the players' terminal reachable sets via support functions: an escape certificate proving the target can hold a guaranteed standoff, and a security strategy bounding the miss distance the inspector can force. Together they bracket the engagement without assuming player rationality, and over two hundred perturbed trials the escape certificate separated capture from escape without error. A projected extragradient method supplies a strategy pair in about 25 ms, certified in place by best-response gaps. The construction carries unchanged to elliptical reference orbits via Yamanaka-Ankersen dynamics, where the orbital phase moves miss distance by nearly a factor of two, reproduced by nonlinear Keplerian propagation. Under receding-horizon play the inspector captures in half of ten representative engagements. Angles-only navigation error, keep-out zones, multiple pursuers, and closed-loop play are treated as extensions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Instrumentation and Methods for Astrophysics (astro-ph.IM); Systems and Control (eess.SY); Dynamical Systems (math.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.14337 — 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-16T00:16:48.821Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).