On the Upper Bound of Near Potential Differential Games
Balint Varga
TL;DR
The paper addresses how close a Linear Quadratic Near Potential Differential Game (LQ NPDG) is to an exact potential differential game (EPDG) by introducing a differential distance measure $\sigma^{(i)}_d(t)$ and an upper bound $\Delta$. It derives a linear relationship between this distance and the resulting trajectory error, yielding a bound $\|\boldsymbol{x}^{(p)}(t)-\boldsymbol{x}^*(t)\|_2 \le C_{\mathrm{NPDG}}(t) \Delta$ with an explicit expression for $C_{\mathrm{NPDG}}(t)$. The core contributions include a sufficient condition ensuring the NPDG property via a bound on the Riccati solution differences and a closed-form bound on closed-loop dynamics. This work broadens the applicability of potential-game concepts to practical engineering scenarios, such as human-machine interactions, by providing a tractable way to quantify and bound deviations from NE.
Abstract
This letter presents an extended analysis and a novel upper bound of the subclass of Linear Quadratic Near Potential Differential Games (LQ NPDG). LQ NPDGs are a subclass of potential differential games, for which a distance between an LQ exact potential differential game and the LQ NPDG. LQ NPDGs exhibit a unique characteristic: the smaller the distance from an LQ exact potential differential game, the closer their dynamic trajectories. This letter introduces a novel upper bound for this distance. Moreover, a linear relation between this distance and the resulting trajectory errors is established, opening the possibility for further application of LQ NPDGs.
