Finite Horizon Stochastic Optimal Control of Nonlinear Two-Player Zero-Sum Games under Communication Constraint

被引:0
|
作者
Xu, Hao [1 ]
Jagannathan, S. [1 ]
机构
[1] Missouri Univ Sci & Technol, Dept Elect & Comp Engn, Rolla, MO 65409 USA
关键词
SYSTEMS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, the finite horizon stochastic optimal control of nonlinear two-player zero-sum games, referred to as Nonlinear Networked Control Systems (NNCS) two-player zero-sum game, between control and disturbance input players in the presence of unknown system dynamics and a communication network with delays and packet losses is addressed by using neuro dynamic programming (NDP). The overall objective being to find the optimal control input while maximizing the disturbance attenuation. First, a novel online neural network (NN) identifier is introduced to estimate the unknown control and disturbance coefficient matrices which are needed in the generation of optimal control input. Then, the critic and two actor NNs have been introduced to learn the time-varying solution to the Hamilton-Jacobi-Isaacs (HJI) equation and determine the stochastic optimal control and disturbance policies in a forward-in-time manner. Eventually, with the proposed novel NN weight update laws, Lyapunov theory is utilized to demonstrate that all closed-loop signals and NN weights are uniformly ultimately bounded (UUB) during the finite horizon with ultimate bounds being a function of initial conditions and final time. Further, the approximated control input and disturbance signals tend close to the saddle-point equilibrium within finite-time. Simulation results are included.
引用
收藏
页码:239 / 244
页数:6
相关论文
共 50 条
  • [41] Upper bounds and Cost Evaluation in Dynamic Two-player Zero-sum Games
    Leudo, Santiago J.
    Ferrante, Francesco
    Sanfelice, Ricardo G.
    2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 424 - 429
  • [42] Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games
    Zeng, Sihan
    Doan, Thinh
    Romberg, Justin
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [43] Corruption-Robust Offline Two-Player Zero-Sum Markov Games
    Nika, Andi
    Mandal, Debmalya
    Singla, Adish
    Radanovic, Goran
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, 2024, 238
  • [44] Structure in the Value Function of Two-Player Zero-Sum Games of Incomplete Information
    Wiggers, Auke J.
    Oliehoek, Frans A.
    Roijers, Diederik M.
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1628 - 1629
  • [45] Constant Payoff Property in Zero-Sum Stochastic Games with a Finite Horizon
    Ragel, Thomas
    Ziliotto, Bruno
    DYNAMIC GAMES AND APPLICATIONS, 2025,
  • [46] Sufficient Conditions for Optimality and Asymptotic Stability in Two-Player Zero-Sum Hybrid Games
    Leudo, Santiago J.
    Sanfelice, Ricardo G.
    HSCC 2022: PROCEEDINGS OF THE 25TH ACM INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (PART OF CPS-IOT WEEK 2022), 2022,
  • [47] Online Minimax Q Network Learning for Two-Player Zero-Sum Markov Games
    Zhu, Yuanheng
    Zhao, Dongbin
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (03) : 1228 - 1241
  • [48] Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback
    Cai, Yang
    Luo, Haipeng
    Wei, Chen-Yu
    Zheng, Weiqiang
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [49] Online solution of two-player zero-sum games for linear systems with unknown dynamics
    Fu, Yue
    Chai, Tian-You
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2015, 32 (02): : 196 - 201
  • [50] Solutions for zero-sum two-player games with noncompact decision sets and unbounded payoffs
    Feinberg, Eugene A.
    Kasyanov, Pavlo O.
    Zgurovsky, Michael Z.
    NAVAL RESEARCH LOGISTICS, 2023, 70 (05) : 493 - 506