Hierarchical Predefined-Time NE Seeking for Uncertain Multiplayer Noncooperative Games

IEEE Transactions on Circuits and Systems II: Express Briefs(2024)

引用 0|浏览2
暂无评分
摘要
In this paper, we investigate the predefined-time Nash equilibrium (NE) seeking problem for the uncertain noncooperative games with second-order nonlinear dynamics. The cost function of each player is affected by the uncertain factors. In order to reduce the computational cost and achieve rapid convergence, we propose a novel time base generator (TBG) and a hierarchical predefined-time NE seeking (HPNES) algorithm by using the observer, the gradient method and the sliding mode control method. Based on the theories of symbolic-graphic combination, convex optimization and Lyapunov criteria, the sufficient conditions of the control gains are presented to guarantee the seeking of the NE. Finally, the effectiveness of the proposed algorithms is verified through the simulations.
更多
查看译文
关键词
Nash equilibrium seeking,uncertain noncooperative games,predefined-time convergence,nonlinear system
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要