Identification Methods for Ordinal Potential Differential Games
From MaRDI portal
Abstract: This paper introduces two new identification methods for the class of ordinal potential differential games (OPDGs). Potential games possess benefits such as the computability and existence of the Nash equilibrium. While the analysis of static ordinal potential games has been explored in previous literature, their applicability to various engineering applications is limited. Although the core idea of OPDGs has been previously introduced, the question of how to systematically identify a potential game for a given differential game remains unanswered. To address this issue, this paper proposes two identification methods that provide the potential cost function for the given differential game. Both identification methods are based on linear matrix inequalities. The first identification method aims to minimize the condition number of the potential cost function's parameters, providing a faster and more precise technique compared to earlier solutions. In addition, a feasibility analysis for system structure requirements is provided. The second identification method has a less strict formulation, allowing it to identify an OPDG in cases in which the first identification method fails to provide a solution. These two novel identification methods are verified through simulations. The results demonstrate their advantages and potential in designing and analyzing cooperative systems and controllers.
This page was built for publication: Identification Methods for Ordinal Potential Differential Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510703)
