Metraipolis › archive › dc_a02e83159182
Robust Game-theoretic Motion Planning over Extended Time Horizons — arXiv:2609.32098
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32098
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T20:53:52.994Z
- SHA-256 of the archived text
c2d522e96f417da8e3abad637f8d430fdf1b1e9a1cdb0b85b4baa925bc62e5ba- Stable URL of this page
https://metraipolis.com/documento/dc_a02e83159182
How to cite
Robust Game-theoretic Motion Planning over Extended Time Horizons — arXiv:2609.32098 — arXiv (en), https://arxiv.org/abs/2609.32098 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a02e83159182 (Metraipolis archive dc_a02e83159182, sha256 c2d522e96f417da8e3abad637f8d430fdf1b1e9a1cdb0b85b4baa925bc62e5ba)
BibTeX
@misc{dca02e83159182,
title = {Robust Game-theoretic Motion Planning over Extended Time Horizons — arXiv:2609.32098},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32098},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a02e83159182; sha256 c2d522e96f417da8e3abad637f8d430fdf1b1e9a1cdb0b85b4baa925bc62e5ba},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32098. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This work presents a solution to nonconvex, game-theoretic motion planning problems subject to disturbances over long time horizons. The problem is posed as a partially-decoupled generalized Nash equilibrium problem, in which each agent's dynamics depend only on its own state and control, admitting fast solution methods for competitive multi-agent motion planning. An algorithm, WOLF, is developed that applies receding-horizon model predictive control to an open-loop differential games solver based on sequential convexification. In contrast to robust formulations that fix the uncertainty description offline, the robustness tube here is itself a dynamic state, co-optimized with the trajectory, and its thickness directly sets the tightening of the shared coupling constraints. A sufficient condition is derived under which a nominal trajectory satisfying constraints tightened against all agents' error bounds remains feasible for every admissible disturbance realization. The method is demonstrated on two adversarial on-orbit games with coupled translational-attitude dynamics: a stealthy co-orbital jamming game under an active detection-probability bound, and a sun-blocking game in which an adversary disables an evader by decreasing solar power Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.MA). Categorie arXiv: Multiagent Systems (cs.MA) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.32098 — 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:24:41.609Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).