arXiv (All)
open access
Robust Game-theoretic Motion Planning over Extended Time Horizons
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
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
- Game-Theoretic Control with Constrained Potential Surgery#1115857
- Mixed-integer flow formulations for motion planning and decision-making of networked multi-agent systems#1050648
- Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming#820863
- Markovian Dynamics Enforcer: Feasibility Preserving Correction on Learned Dynamics Manifolds#1145055
- Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning#798577
Record · ID 1116429
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