arXiv (All)
open access
Real-Time Solution-Seeking for Game-Theoretic Autonomous Driving via Time-Distributed Iterations
Computational complexity has been a major challenge in game-theoretic model predictive control (GT-MPC), as real-time solutions to a game (e.g., Nash equilibria (NEs)) have to be computed at each sampling instant of an MPC. This challenge is especially critical in autonomous driving, where interacti
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
- Learning-enabled Acceleration of Scenario-based Model Predictive Control#366257
- Learning-enabled Acceleration of Scenario-based Model Predictive Control#973271
- GNN-Accelerated Mixed-Integer Dual MPC for Interactive Driving#1012851
- Soft MPCritic: Value-Based Reinforcement Learning for Non-Differentiable Predictive Control#1341379
- Switch-Time-Aware Hybrid Model Predictive Control Using the Hybrid Minimum Principle#1388691
Record · ID 1402187
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