{"title":"动态事件触发机制下非光滑聚合博弈的自适应广义纳什均衡寻求算法","authors":"","doi":"10.1016/j.automatica.2024.111835","DOIUrl":null,"url":null,"abstract":"<div><p>This paper addresses a nonsmooth aggregative game to control multiple noncooperative players, each with a nonsmooth cost function that depends not only on its own decision but also on some aggregate effect among all the agents. In addition, the decision of each player is restricted by private and coupling constraints. To address these concerns, a distributed generalized Nash equilibrium (GNE) seeking algorithm is proposed. Two features distinguish our methods from the existing GNE seeking algorithms. Firstly, an adaptive penalty method is introduced to drive each player’s action to enter the set of private constraints. The adaptive term ensures automatic adjustment of penalty parameter based on the degree of constraint violation excluding any prior calculation. Secondly, a distributed dynamic event-triggered mechanism is designed for each player to lessen communication energy. In comparison to the static event-triggered mechanism, the proposed dynamic mechanism possesses larger inter-execution time intervals. As the discontinuity of the event-triggered mechanism can impact the existence of a solution to the closed-loop system in the classical sense, we adapt a nonsmooth analysis technique, including differential inclusion and Filippov solution. Through nonsmooth Lyapunov analysis, the convergence result and the avoidance of Zeno behavior are established. Finally, two engineering examples are provided to demonstrate the validity of the theoretical results.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive generalized Nash equilibrium seeking algorithm for nonsmooth aggregative game under dynamic event-triggered mechanism\",\"authors\":\"\",\"doi\":\"10.1016/j.automatica.2024.111835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper addresses a nonsmooth aggregative game to control multiple noncooperative players, each with a nonsmooth cost function that depends not only on its own decision but also on some aggregate effect among all the agents. In addition, the decision of each player is restricted by private and coupling constraints. To address these concerns, a distributed generalized Nash equilibrium (GNE) seeking algorithm is proposed. Two features distinguish our methods from the existing GNE seeking algorithms. Firstly, an adaptive penalty method is introduced to drive each player’s action to enter the set of private constraints. The adaptive term ensures automatic adjustment of penalty parameter based on the degree of constraint violation excluding any prior calculation. Secondly, a distributed dynamic event-triggered mechanism is designed for each player to lessen communication energy. In comparison to the static event-triggered mechanism, the proposed dynamic mechanism possesses larger inter-execution time intervals. As the discontinuity of the event-triggered mechanism can impact the existence of a solution to the closed-loop system in the classical sense, we adapt a nonsmooth analysis technique, including differential inclusion and Filippov solution. Through nonsmooth Lyapunov analysis, the convergence result and the avoidance of Zeno behavior are established. Finally, two engineering examples are provided to demonstrate the validity of the theoretical results.</p></div>\",\"PeriodicalId\":55413,\"journal\":{\"name\":\"Automatica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0005109824003297\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109824003297","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Adaptive generalized Nash equilibrium seeking algorithm for nonsmooth aggregative game under dynamic event-triggered mechanism
This paper addresses a nonsmooth aggregative game to control multiple noncooperative players, each with a nonsmooth cost function that depends not only on its own decision but also on some aggregate effect among all the agents. In addition, the decision of each player is restricted by private and coupling constraints. To address these concerns, a distributed generalized Nash equilibrium (GNE) seeking algorithm is proposed. Two features distinguish our methods from the existing GNE seeking algorithms. Firstly, an adaptive penalty method is introduced to drive each player’s action to enter the set of private constraints. The adaptive term ensures automatic adjustment of penalty parameter based on the degree of constraint violation excluding any prior calculation. Secondly, a distributed dynamic event-triggered mechanism is designed for each player to lessen communication energy. In comparison to the static event-triggered mechanism, the proposed dynamic mechanism possesses larger inter-execution time intervals. As the discontinuity of the event-triggered mechanism can impact the existence of a solution to the closed-loop system in the classical sense, we adapt a nonsmooth analysis technique, including differential inclusion and Filippov solution. Through nonsmooth Lyapunov analysis, the convergence result and the avoidance of Zeno behavior are established. Finally, two engineering examples are provided to demonstrate the validity of the theoretical results.
期刊介绍:
Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field.
After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience.
Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.