Distributed adaptive generalized Nash equilibrium seeking algorithm with event‐triggered communication

Abstract

A class of aggregative games with coupled constraints is considered in this paper. The problem of seeking generalized Nash equilibrium (GNE) for the game with double‐integrator multi‐agent systems on weight‐balanced directed graphs is studied. To remove the convergence conditions related to the Laplacian matrix of the communication graph, adaptive parameters are introduced in the designed seeking algorithm. Moreover,an event‐triggered broadcasting scheme is designed to reduce communication loads when agents execute the seeking algorithm. It is shown that the designed algorithm can globally asymptotically converge to the GNE of the game and the proposed event‐triggered scheme is free of the Zeno behavior. A numerical example is illustrated to validate the proposed methods.

Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach

“…To deal with such situations, a distributed event trigger is introduced to reduce communication overhead. 31 Subsequently, the result is extended to general NE seeking strategies. 32 With incomplete information and random disturbances, each player uses a stochastic event-triggered method to search the NE.…”

“…As the number of participants grows, so does the communication resource for each player in the game. To deal with such situations, a distributed event trigger is introduced to reduce communication overhead 31 . Subsequently, the result is extended to general NE seeking strategies 32 .…”