Data-Driven Direct Adaptive Risk-Sensitive Control of Stochastic Systems  

作　　者：QIAO Nan LI Tao 

机构地区：[1]School of Mathematical Sciences,East China Normal University,Shanghai 200241,China [2]Shanghai Key Laboratory of Pure Mathematics and Mathematical Practice,School of Mathematical Sciences,East China Normal University,Shanghai 200241,China

出　　处：《Journal of Systems Science & Complexity》2024年第4期1446-1469,共24页系统科学与复杂性学报（英文版）

基　　金：supported in part by the National Natural Science Foundation of China under Grant No.62261136550;in part by the Basic Research Project of Shanghai Science and Technology Commission under Grant No.20JC1414000。

摘　　要：The authors propose a data-driven direct adaptive control law based on the adaptive dynamic programming(ADP) algorithm for continuous-time stochastic linear systems with partially unknown system dynamics and infinite horizon quadratic risk-sensitive indices.The authors use online data of the system to iteratively solve the generalized algebraic Riccati equation(GARE) and to learn the optimal control law directly.For the case with measurable system noises,the authors show that the adaptive control law approximates the optimal control law as time goes on.For the case with unmeasurable system noises,the authors use the least-square solution calculated only from the measurable data instead of the real solution of the regression equation to iteratively solve the GARE.The authors also study the influences of the intensity of the system noises,the intensity of the exploration noises,the initial iterative matrix,and the sampling period on the convergence of the ADP algorithm.Finally,the authors present two numerical simulation examples to demonstrate the effectiveness of the proposed algorithms.

关 键 词：Adaptive dynamic programming direct adaptive control generalized algebraic Riccati equation risk-sensitive control 

分 类 号：O231[理学—运筹学与控制论]