arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.06810eess.SYcs.GTcs.LGcs.SY
收藏

非线性鲁棒控制的三值策略迭代算法

Ternary Policy Iteration Algorithm for Nonlinear Robust Control

Jie Li, Shengbo Eben Li, Yang Guan, Jingliang Duan, Wenyu Li, Yuming Yin

摘要:

对象动态的不确定性是非线性控制问题的一个挑战。提出了一种求解具有有界不确定性的非线性鲁棒控制问题的三元策略迭代(TPI)算法。将控制器和系统的不确定性视为博弈者,将鲁棒控制问题转化为两人零和微分对策。为了求解微分对策,相应的Hamilton-Jacobi-Isaacs(HJI)方程,然后推导。设计了三个损失函数和三个更新阶段,分别与HJI方程的恒等式、最小化和最大化相匹配。这些损失函数由生成的状态集中的近似哈密顿量的期望来定义,以防止同时操作整个状态集中的所有状态。通过梯度下降法对设计的损失函数进行递减,直接更新价值函数和策略的参数。此外,零初始化可以应用于控制策略的参数。所提出的TPI算法的有效性证明了通过两个仿真研究。仿真结果表明,TPI算法对线性对象能收敛到最优解,对非线性对象具有较强的抗干扰能力。

英文摘要:

The uncertainties in plant dynamics remain a challenge for nonlinear control problems. This paper develops a ternary policy iteration (TPI) algorithm for solving nonlinear robust control problems with bounded uncertainties. The controller and uncertainty of the system are considered as game players, and the robust control problem is formulated as a two-player zero-sum differential game. In order to solve the differential game, the corresponding Hamilton-Jacobi-Isaacs (HJI) equation is then derived. Three loss functions and three update phases are designed to match the identity equation, minimization and maximization of the HJI equation, respectively. These loss functions are defined by the expectation of the approximate Hamiltonian in a generated state set to prevent operating all the states in the entire state set concurrently. The parameters of value function and policies are directly updated by diminishing the designed loss functions using the gradient descent method. Moreover, zero-initialization can be applied to the parameters of the control policy. The effectiveness of the proposed TPI algorithm is demonstrated through two simulation studies. The simulation results show that the TPI algorithm can converge to the optimal solution for the linear plant, and has high resistance to disturbances for the nonlinear plant.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑