Metraipolis › archive › dc_4623dfe46f77

Game-Theoretic Control with Constrained Potential Surgery — arXiv:2609.31901

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31901
License (as archived)
CC0-1.0
Archived
2026-10-08T00:16:49.402Z
SHA-256 of the archived text
0294281df3c40e41b18d0c6ece685faf8978dc8d0a4d2179e1d19f22989993bc
Stable URL of this page
https://metraipolis.com/documento/dc_4623dfe46f77

How to cite

Game-Theoretic Control with Constrained Potential Surgery — arXiv:2609.31901 — arXiv (en), https://arxiv.org/abs/2609.31901 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4623dfe46f77 (Metraipolis archive dc_4623dfe46f77, sha256 0294281df3c40e41b18d0c6ece685faf8978dc8d0a4d2179e1d19f22989993bc)
BibTeX
@misc{dc4623dfe46f77,
  title = {Game-Theoretic Control with Constrained Potential Surgery — arXiv:2609.31901},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31901},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4623dfe46f77; sha256 0294281df3c40e41b18d0c6ece685faf8978dc8d0a4d2179e1d19f22989993bc},
  year = {2026}
}

Archived text

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

Constrained general-sum dynamic games are a popular formulation for highly interactive multi-agent planning problems. In recent years, Generalized Nash Equilibrium (GNE) solvers have achieved real-time performance for small dynamic games. However, solution speed still remains a bottleneck, and controlling even a small number of agents (e.g., more than four) in a dynamic task remains elusive. In addition, Newton solvers that focus on the first-order conditions are vulnerable to non-Nash saddle points, limiting the usefulness of the provided solution. In this work, we propose a fast and versatile interior point solver for constrained dynamic games, along with a computationally efficient second-order correction that increases the probability of converging to a local GNE solution in constrained dynamic games. The performance of the proposed method is evaluated on numerical benchmarks and a physical experiment involving scaled race cars.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-29 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.31901 — 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-07T23:52:16.386Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).