Prescribed-Time Distributed Nash Equilibrium Seeking for Multicoalition Games With Heterogeneous General Linear Players: Theory and Experiment

Le résumé fourni par la source

In this article, the prescribed-time distributed Nash equilibrium (NE) seeking problem for multicoalition games with heterogeneous general linear players is investigated. In such games, there exist multiple coalitions that consist of heterogeneous players. The players have to seek the NE of the entire coalition while being limited to access only their individual cost functions. The proposed algorithm involves a two-layer structure composed of the NE seeking part and the tracking control part. To address the challenge of global information dependency, the leader-following-based estimates are designed. The NE seeking part is designed based on the distributed estimates and concurrently performed over the weight-balanced digraphs. Subsequently, by introducing the time-varying parametric Lyapunov equation, the strategies of the players are driven to the NE solution within a manually prescribed settling time, and the prescribed-time convergence is proved. Finally, the proposed algorithm is executed on the heterogeneous coalitions made up of quadrotor unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) in a group formation scenario. Both the simulation and the experiment results are presented to show the effectiveness of the algorithm.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.