arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.11649eess.SYcs.SY
收藏

非合作博弈中的规定时间完全分布Nash均衡搜索

Prescribed-Time Fully Distributed Nash Equilibrium Seeking in Noncooperative Games

Zhi Feng, Guoqiang Hu

摘要:

本文研究了连续时间非合作对策的指定时间全分布纳什均衡(NE)求解问题。通过利用伪梯度播放和共识为基础的计划,各种分布式NE寻求算法,无论是固定或切换通信拓扑结构,使收敛到NE在规定的时间内达到。特别是,一个规定的时间分布式NE寻找算法首先开发下一个固定的图找到NE在一个预先给定的和用户定义的时间,提供了一个静态控制器增益可以选择基于某些全局信息,如代数连通性的通信图和Lipschitz和单调常数的伪梯度与球员的目标函数。其次,提出了一种规定时间和完全分布式的NE搜索算法,通过设计异构动态增益来在线改变通信拓扑的权重,从而去除全局信息。此外,我们扩展此算法,以适应联合开关拓扑结构。理论上证明了基于时间函数变换的算法在给定的时间内严格保证了算法的全局收敛性。最后,通过数值仿真验证了设计的有效性。

英文摘要:

In this paper, we investigate a prescribed-time and fully distributed Nash Equilibrium (NE) seeking problem for continuous-time noncooperative games. By exploiting pseudo-gradient play and consensus-based schemes, various distributed NE seeking algorithms are presented over either fixed or switching communication topologies so that the convergence to the NE is reached in a prescribed time. In particular, a prescribed-time distributed NE seeking algorithm is firstly developed under a fixed graph to find the NE in a prior-given and user-defined time, provided that a static controller gain can be selected based on certain global information such as the algebraic connectivity of the communication graph and both the Lipschitz and monotone constants of the pseudo-gradient associated with players' objective functions. Secondly, a prescribed-time and fully distributed NE seeking algorithm is proposed to remove global information by designing heterogeneous dynamic gains that turn on-line the weights of the communication topology. Further, we extend this algorithm to accommodate jointly switching topologies. It is theoretically proved that the global convergence of those proposed algorithms to the NE is rigorously guaranteed in a prescribed time based on a time function transformation approach. In the last, numerical simulation results are presented to verify the effectiveness of the designs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑