Metraipolis › archive › dc_7aecbd4a5757

Fast Fuel-Optimal Constrained Impulsive Control with Application to Distributed Spacecraft — arXiv:2611.02322

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02322
License (as archived)
CC0-1.0
Archived
2026-11-03T18:45:35.929Z
SHA-256 of the archived text
ed390d15749275137adaa94a9c3f39bc4dd87cfa10040ae5003191701ed5e8c1
Stable URL of this page
https://metraipolis.com/documento/dc_7aecbd4a5757

How to cite

Fast Fuel-Optimal Constrained Impulsive Control with Application to Distributed Spacecraft — arXiv:2611.02322 — arXiv (en), https://arxiv.org/abs/2611.02322 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7aecbd4a5757 (Metraipolis archive dc_7aecbd4a5757, sha256 ed390d15749275137adaa94a9c3f39bc4dd87cfa10040ae5003191701ed5e8c1)
BibTeX
@misc{dc7aecbd4a5757,
  title = {Fast Fuel-Optimal Constrained Impulsive Control with Application to Distributed Spacecraft — arXiv:2611.02322},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02322},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7aecbd4a5757; sha256 ed390d15749275137adaa94a9c3f39bc4dd87cfa10040ae5003191701ed5e8c1},
  year = {2026}
}

Archived text

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

This work extends a reachable set theory approach for fuel-optimal control to incorporate convex and non-convex state, time, and magnitude constraints. The solver is designed from a new set of optimality conditions, derived by reformulating a single reachable set into multiple time-ordered, step-wise reachable set waypoint sub-problems, where a waypoint is the state reached after a given maneuver. Non-convex constraints are satisfied at each waypoint, preserving convexity at each sub-problem without needing to convexify the full control problem, enabling the computationally efficient identification of constrained optimal maneuvers, and guaranteeing a user-defined bound on constrained cost. To produce an optimal maneuver plan, the solver rolls out constrained trajectories until the remaining unconstrained solution adheres to the problem constraints. The fuel-optimal control problem considered by this work is broadly applicable to many fields and particularly significant to Distributed Space Systems (DSS). Multi-agent guidance and propulsive control techniques, often for small spacecraft at close separations, require guarantees of collision avoidance, efficient maneuvering to preserve a restricted fuel payload, and numerically-simple algorithms functional under on-board computational processing limitations. The proposed solver offers both user-defined bounds on constrained maneuver optimality and enhanced computational efficiency to directly address these challenges, and these capabilities are demonstrated comparatively against baseline solvers from the literature through Monte Carlo analysis on a variety of relevant DSS scenarios. Overall, this work enables the benefits of reachable set theory, namely computational efficiency and provable optimality, to be extended to control problems of higher fidelity.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.02322 — 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-11-03T18:14:37.780Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).