arXiv (All)
open access
Game-Theoretic Control with Constrained Potential Surgery
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 contr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robust Game-theoretic Motion Planning over Extended Time Horizons#1116429
- Increasing Resilience of Continuum Robots via Motion Planning Algorithms#927353
- Solving partially observable stochastic shortest-path games#308484
- Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming#820863
- Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces#997259
Record · ID 1115857
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive