连续时间非线性系统的全局自适应动态规划
Global Adaptive Dynamic Programming for Continuous-Time Nonlinear Systems
摘要:
提出了一种新的全局自适应动态规划(ADP)方法,用于非线性多项式系统的自适应最优控制。该策略将求解Hamilton-Jacobi-Bellman(HJB)方程的问题转化为一个最优化问题,并通过一种新的策略迭代法求解。所提出的方法区别于以前已知的非线性ADP方法的神经网络近似被避免,从而产生显着的计算改进。对于一般的非线性多项式系统,所得到的控制策略不是半全局或局部稳定的,而是全局稳定的。此外,在缺乏系统动力学的先验知识的情况下,通过推广当前的ADP理论,设计了一种在线学习方法来实现所提出的策略迭代技术。最后,通过三个算例验证了该方法的有效性.
英文摘要:
This paper presents a novel method of global adaptive dynamic programming (ADP) for the adaptive optimal control of nonlinear polynomial systems. The strategy consists of relaxing the problem of solving the Hamilton-Jacobi-Bellman (HJB) equation to an optimization problem, which is solved via a new policy iteration method. The proposed method distinguishes from previously known nonlinear ADP methods in that the neural network approximation is avoided, giving rise to significant computational improvement. Instead of semiglobally or locally stabilizing, the resultant control policy is globally stabilizing for a general class of nonlinear polynomial systems. Furthermore, in the absence of the a priori knowledge of the system dynamics, an online learning method is devised to implement the proposed policy iteration technique by generalizing the current ADP theory. Finally, three numerical examples are provided to validate the effectiveness of the proposed method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。