.png){kind=icon}
返回
Off-policy based adaptive dynamic programming method for nonzero-sum games on discrete-time system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2020.05.038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel model-free reinforcement learning method based on off-policy is introduced to solve nonzero-sum games of discrete-time linear systems. Compared with the traditional policy iteration (PI) method, which requires the knowledge of system dynamics, the proposed method can be trained by state data directly. Moreover, the traditional PI method is proved to be influenced by probing noises. In the analysis of the proposed method, the probing noises are specifically considered and proved to have no influence on the convergence. The solution of the optimal Nash equilibrium is deduced. It is also proved that the proposed algorithm can be applied in both online manner and offline manner. A simulation of the nonzero-sum games control problem on an F-16 aircraft discrete-time system is presented, and the results verify the effectiveness of the proposed algorithm. (c) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
H-INFINITY CONTROL
FAULT-TOLERANT CONTROL
NONLINEAR-SYSTEMS
LINEAR-SYSTEMS
CONTROLLER-DESIGN
LEARNING SOLUTION
ITERATION
ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
Optimal Constrained Self- learning Battery Sequential Management in Microgrid Via Adaptive Dynamic Programming基于自适应动态规划的微网中最优约束自学习电池时序管理
PREAI
分享收藏Iterative adaptive dynamic programming methods with neural network implementation for multi-player zero-sum games.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Multi-player non-zero-sum games: Online adaptive learning solution of coupled Hamilton-Jacobi equations多人非零和游戏: 耦合hamilton-jacobi方程的在线自适应学习解决方案AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容