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 non-cooperative 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.
| Original language | English |
|---|---|
| Title of host publication | 2017 Australian and New Zealand Control Conference, ANZCC 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 145-150 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781538621783 |
| DOIs | |
| State | Published - Jul 2 2017 |
| Event | 1st Australian and New Zealand Control Conference, ANZCC 2017 - Gold Coast, Australia Duration: Dec 17 2017 → Dec 20 2017 |
Publication series
| Name | 2017 Australian and New Zealand Control Conference, ANZCC 2017 |
|---|---|
| Volume | 2018-January |
Conference
| Conference | 1st Australian and New Zealand Control Conference, ANZCC 2017 |
|---|---|
| Country/Territory | Australia |
| City | Gold Coast |
| Period | 12/17/17 → 12/20/17 |
Funding
This work was supported by GIST Research Institute (GRI) and by the National Research Foundation (NRF) of Korea under the grant NRF-2017R1A2B3007034. VII. ACKNOWLEDGEMENT This work was supported by GIST Research Institute (GRI) and by the National Research Foundation (NRF) of Korea under the grant NRF-2017R1A2B3007034.