Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYe, Maojiaoen_US
dc.contributor.authorHu, Guoqiangen_US
dc.contributor.authorXu, Shengyuanen_US
dc.identifier.citationYe, M., Hu, G. & Xu, S. (2020). An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games. Automatica, 114, 108815-.
dc.description.abstractThis paper considers Nash equilibrium seeking for N-cluster noncooperative games in which the explicit expressions of the agents’ local objective functions are not available to the agents. As an alternative, the output values of the agents’ local objective functions are supposed to be measurable. An extremum seeker is designed to achieve the Nash equilibrium seeking for the N-cluster noncooperative games. The design of the extremum seeker is based on a dynamic average consensus protocol and the modulation of the sinusoidal dither signals. Through Lyapunov stability analysis, the convergence results are analytically studied. Local and nonlocal convergence results are derived under local and global characterizations of the Nash equilibrium for the N-cluster noncooperative games, respectively. Compared with our previous works on Nash equilibrium seeking for the N-cluster noncooperative games, the main advantages and characteristics of the proposed method are threefold. Firstly, the proposed method broadens the applicability of the existing Nash equilibrium seeking strategies to circumstances in which the agents cannot access the explicit expressions of their local objective functions. Moreover, the proposed seeking strategy performs as a unified strategy that solves the noncooperative games and the social cost minimization problems without utilizing explicit model information. Secondly, the proposed seeking strategy requires each agent to update fewer auxiliary variables compared with the existing methods and hence reduces the communication and computation costs. Thirdly, different from most of the existing works that adopt singular perturbation to analyze the stability of extremum seekers, this paper establishes the convergence results via Lyapunov stability analysis, which is novel and provides some new insights on the analysis of extremum seekers. A numerical example is provided to verify the effectiveness of the proposed method.en_US
dc.description.sponsorshipEconomic Development Board (EDB)en_US
dc.relationS14-1172-NRF EIRP-IHLen_US
dc.rights© 2020 Elsevier Ltd. All rights reserved.en_US
dc.subjectEngineering::Electrical and electronic engineeringen_US
dc.titleAn extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative gamesen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.subject.keywordsNash Equilibrium Seekingen_US
dc.subject.keywordsExtremum Seeking Controlen_US
dc.description.acknowledgementThis work was supported by Singapore Economic Development Board under EIRP grant S14-1172-NRF EIRP-IHL, the National Natural Science Foundation of China (NSFC), No. 61803202, 61673215, the Natural Science Foundation of Jiangsu Province, China, No. BK20180455, the 333 Project, China (BRA2017380) and the Fundamental Research Funds for the Central Universities, China , No. 30918011332.en_US
item.fulltextNo Fulltext-
Appears in Collections:EEE Journal Articles

Citations 10

Updated on Jan 28, 2023

Web of ScienceTM
Citations 10

Updated on Jan 22, 2023

Page view(s)

Updated on Jan 29, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.