AI & ML
An {\alpha}-potential linear approximation for LQ differential games
arXiv cs.SY0 views
arXiv:2611.25149v1 Announce Type: new Abstract: Feedback Nash equilibria of infinite-horizon linear-quadratic (LQ) differential games are characterized by coupled algebraic Riccati equations (cAREs), whose numerical solution generally relies on iterative algorithms and can be highly sensitive to their initialization. Motivated by the $\alpha$-potential-game framework, this letter proposes an $\alpha$-potential linear approximation for constructing a systematic, game-dependent initialization. For an N-player LQ game, a reference potential game is constructed. Its equilibrium requires solving only one standard algebraic Riccati equation. The original cAREs are subsequently linearized around this reference solution, yielding a coupled linear system whose solution provides player-specific corrections and hence an approximate feedback Nash equilibrium. The resulting approximation is used to initialize three standard cARE solvers. Numerical experiments on $10^4$ randomly generated two-player games show that the proposed initialization reduces the mean number of iterations. Further experiments for $N=2,\ldots,13$ show that the reduction in iteration count persists as the number of players increases.
Source:https://arxiv.org/abs/2611.25149PreviousAsymmetric Transistor Aging Under Thermal GradientsNextReliability-based Sizing of Energy Storage for Large Load Integration
Related posts

So sicherst du einen MCP-Server mit codex sandbox ab
0dev.to

Perfiles de permisos de Codex: ejemplos de config.toml para ejecuciones seguras de agentes
0dev.to

GPTBot vs OAI-SearchBot: How to Configure robots.txt for AI Crawlers
0dev.to

ملفات تعريف أذونات Codex: أمثلة config.toml لتشغيل الوكلاء بأمان
0dev.to

Write a cover letter with AI and keep every fact yours: a nine-step loop
0dev.to
Reading project health off a download page — faster than star count
0dev.to