Metraipolis › archive › dc_f073ab16d439
Decentralized Bi-Level Optimization for Cooperative Orbital Transportation of a Rigid Payload — arXiv:2610.31562
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.31562
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-25T08:30:50.732Z
- SHA-256 of the archived text
1e35664777f78e9ca83503a100bb142400dd7e9c4668a2777024fb158fe334a6- Stable URL of this page
https://metraipolis.com/documento/dc_f073ab16d439
How to cite
Decentralized Bi-Level Optimization for Cooperative Orbital Transportation of a Rigid Payload — arXiv:2610.31562 — arXiv (en), https://arxiv.org/abs/2610.31562 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f073ab16d439 (Metraipolis archive dc_f073ab16d439, sha256 1e35664777f78e9ca83503a100bb142400dd7e9c4668a2777024fb158fe334a6)
BibTeX
@misc{dcf073ab16d439,
title = {Decentralized Bi-Level Optimization for Cooperative Orbital Transportation of a Rigid Payload — arXiv:2610.31562},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.31562},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f073ab16d439; sha256 1e35664777f78e9ca83503a100bb142400dd7e9c4668a2777024fb158fe334a6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.31562. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The rapid growth of the space economy, alongside increasing orbital congestion and debris, is driving demand for reliable on-orbit transportation of large and non-cooperative objects. Performing such transportation with a swarm of small spacecraft distributes risk and removes the single point of failure inherent to monolithic architectures, but requires solving a non-convex trajectory optimization coupling every agent's cone-constrained thrust to the payload's rotational dynamics. Existing approaches span decentralized control laws with asymptotic guarantees but limited constraint enforcement, and centralized and partially centralized planners that reintroduce a single point of failure. In this work, we present a decentralized bi-level framework driven by exact gradients: the problem is split into an inner convex thrust allocation and an outer search over payload torque trajectories. This decomposition yields fuel-efficient solutions quickly, without requiring full NLP convergence, and at short timescales its performance scales with the number of agents. Theoretical convergence guarantees are established, and the method is validated through extensive Monte Carlo simulation, including closed-loop recovery from in-flight faults. These properties make the framework well suited to spacecraft swarm applications. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Multiagent Systems (cs.MA); Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.31562 — 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-25T08:30:42.677Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).