Distributed Nash Equilibrium Computation With Uncertain Dynamics and Disturbances

被引:10
|
作者
Li, Danhu [1 ]
Ye, Maojiao [1 ]
Ding, Lei [2 ]
Xu, Shengyuan [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Automat, Nanjing 210094, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Inst Adv Technol, Nanjing 210023, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2022年 / 9卷 / 03期
基金
中国国家自然科学基金;
关键词
Nash equilibrium; Heuristic algorithms; Games; Vehicle dynamics; Symmetric matrices; Estimation; Optimization; Estimator; uncertain dynamics; disturbances; low-pass filters; CONSENSUS; STRATEGY; SEEKING;
D O I
10.1109/TNSE.2022.3142523
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Nash equilibrium computation problems under distributed communication scenarios are addressed in this paper. In particular, the players, including first- and second-order ones, are considered to be affected by unknown disturbances and dynamics. To accommodate this problem, the followings need to be simultaneously achieved: (1) Distributed estimation of unknown information needed for optimizing the players' objective functions; (2) The optimization of the players' objective functions; and (3) Dynamics stabilization for the players, especially for the accommodation of unknown disturbances and dynamics. Based on first-order low-pass filters, an unknown dynamics estimator is established (for the estimation of unknown dynamics and disturbances), by which distributed computing methods are constructed by further employing gradient-like optimization components (for optimizing the players' objective functions) and consensus components (for distributed action estimation). The presented analytical investigation shows that the players' actions and velocities (for second-order players) can converge into a small ball around the Nash equilibrium and zero respectively by choosing the control parameters properly according to the given rules. Moreover, the proposed algorithm is adapted to address connectivity control of mobile sensors. Numerical verification is provided by utilizing KUKA YouBot vehicles in V-REP.
引用
收藏
页码:1376 / 1385
页数:10
相关论文
共 50 条
  • [21] Distributed Nash Equilibrium Seeking Design in Network of Uncertain Linear Multi-agent Systems
    Liu, Xinyu
    Zhang, Yawei
    Wang, Xinghu
    Ji, Haibo
    2020 IEEE 16TH INTERNATIONAL CONFERENCE ON CONTROL & AUTOMATION (ICCA), 2020, : 147 - 152
  • [22] Commentary: Nash equilibrium and dynamics
    Hart, Sergiu
    GAMES AND ECONOMIC BEHAVIOR, 2011, 71 (01) : 6 - 8
  • [23] Neural-Network-Based Distributed Generalized Nash Equilibrium Seeking for Uncertain Nonlinear Multiagent Systems
    Huo, Wei
    Huang, Lingying
    Dey, Subhrakanti
    Shi, Ling
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2024, 11 (03): : 1323 - 1334
  • [24] On the convergence to Nash equilibrium in problems of distributed computing
    Boulogne, T
    Altman, E
    Pourtallier, O
    ANNALS OF OPERATIONS RESEARCH, 2002, 109 (1-4) : 279 - 291
  • [25] On the Convergence to Nash Equilibrium in Problems of Distributed Computing
    T. Boulogne
    E. Altman
    O. Pourtallier
    Annals of Operations Research, 2002, 109 : 279 - 291
  • [26] Distributed Nash Equilibrium Seeking with Communication Delays
    Liu, Lupeng
    Lu, Maobin
    Deng, Fang
    Dou, Lihua
    Chen, Jie
    2024 IEEE 18TH INTERNATIONAL CONFERENCE ON CONTROL & AUTOMATION, ICCA 2024, 2024, : 6 - 11
  • [27] Distributed Nash equilibrium seeking resilient to adversaries
    Gadjov, Dian
    Pavel, Lacra
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 191 - 196
  • [28] Distributed Nash equilibrium seeking for constrained games
    Yue, Dandan
    Meng, Ziyang
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 9660 - 9665
  • [29] COMPUTATION OF NASH EQUILIBRIUM PAIRS OF A STOCHASTIC DIFFERENTIAL GAME
    YAVIN, Y
    REUTER, G
    OPTIMAL CONTROL APPLICATIONS & METHODS, 1981, 2 (03): : 225 - 238
  • [30] Stochastic uncoupled dynamics and Nash equilibrium
    Hart, Sergiu
    Mas-Colell, Andreu
    GAMES AND ECONOMIC BEHAVIOR, 2006, 57 (02) : 286 - 303