Metraipolis › archive › dc_332fdd81bc1f
Data-Driven Spiking Control for Distributed $\varepsilon$-Nash Equilibrium Seeking — arXiv:2609.13663
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13663
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:55:49.237Z
- SHA-256 of the archived text
80342dd2b6f2de0e56fae3c2e7bf1520d669a6af4a27ea5f3eaa0a52af082e68- Stable URL of this page
https://metraipolis.com/documento/dc_332fdd81bc1f
How to cite
Data-Driven Spiking Control for Distributed $\varepsilon$-Nash Equilibrium Seeking — arXiv:2609.13663 — arXiv (en), https://arxiv.org/abs/2609.13663 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_332fdd81bc1f (Metraipolis archive dc_332fdd81bc1f, sha256 80342dd2b6f2de0e56fae3c2e7bf1520d669a6af4a27ea5f3eaa0a52af082e68)
BibTeX
@misc{dc332fdd81bc1f,
title = {Data-Driven Spiking Control for Distributed $varepsilon$-Nash Equilibrium Seeking — arXiv:2609.13663},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13663},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_332fdd81bc1f; sha256 80342dd2b6f2de0e56fae3c2e7bf1520d669a6af4a27ea5f3eaa0a52af082e68},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13663. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper studies how a feedback law synthesized directly from data can be realized by spiking control while retaining a game-theoretic performance guarantee. We consider distributed $\varepsilon$-Nash equilibrium (NE) seeking in network games played by linear dynamical agents with unknown models and exogenous disturbances. The pseudo-gradient of the game is treated as a regulated error, and local internal models account for signals generated by known exosystems. Robust linear matrix inequalities are then used to compute stabilizing analogue feedback gains directly from noisy local input-state data, without identifying the agent dynamics. To implement these gains using only fixed-weight spikes, we develop two spiking realizations. The first realization uses non-interacting leaky integrate-and-fire units, while the second permits reset coupling among the neuronal units. In both cases, a continuous auxiliary coordinate exposes the impulsive closed loop as the stable analogue system driven by a bounded implementation error. This representation yields forward completeness, Zeno-freeness, and an ultimate bound on the pseudo-gradient, subject to explicit event-processing conditions for the connected architecture. The bound implies that, after a finite transient, the agents' outputs constitute an $\varepsilon$-NE for every $\varepsilon$ above a finite threshold. A spacecraft formation reconfiguration example illustrates the data-driven synthesis, the two spiking realizations, and their practical equilibrium behavior. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in eess.SY). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.13663 — 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-16T02:45:08.518Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).