Nguyen, Chuong Van (GIST), Hoang, Phuong Huu (GIST), Trinh, Minh Hoang (Gwangju Institute of Science and Technology), Lee, Byung-Hun (Gwangju Institute of Science and Technology (GIST)), Ahn, Hyo-Sung (Gwangju Institute of Sci & Tech)

Distributed Nash Equilibrium Seeking of an Aggregative Game by a Singular Perturbed Algorithm

Scheduled for presentation during the Regular Session "Distributed System Analysis and Design" (TuCOr), Tuesday, December 19, 2017, 13:45−14:00, Room 7

2017 Australian and New Zealand Control Conference, December 17-20, 2017, Gold Coast Convention Centre, Australia

This information is tentative and subject to change. Compiled on May 1, 2024

Abstract

This paper proposes a distributed singular perturbed algorithm for finding a Nash Equilibrium (NE) of an aggregative game, which is known as one class of a noncooperative Nash game. A motivation model for this game is formulated in a distributed energy network consisting of players equipped with generators. We deal with the problem of operating each agent’s generator at an optimal set value to minimize its objective function selfishly. The algorithm is designed in such a manner that each player estimates the sum of players’ actions in an interconnected network based on information exchanged with its local neighbors in order to determine the optimal decision. The effectiveness of the proposed algorithm is demonstrated via a simulation.