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

约束线性系统的近似动态规划:一种分段二次近似方法

Approximate Dynamic Programming for Constrained Linear Systems: A Piecewise Quadratic Approximation Approach

Kanghui He, Shengling Shi, Ton van den Boom, Bart De Schutter

AI总结:

本文提出一种结合ADP与MPC的方法,利用新型凸分段二次神经网络近似CLQR问题的价值函数,并开发高效分解算法加速在线计算,在保证闭环稳定性的同时提升了计算效率与最优性。

摘要:

近似动态规划(ADP)在处理控制问题中的约束时面临挑战。相比之下,模型预测控制(MPC)以其对约束的包容性和稳定性保证而闻名,尽管其计算有时令人望而却步。本文引入一种结合这两种方法以克服各自局限性的方法。约束线性二次调节(CLQR)问题的预测控制律已被证明是分段仿射(PWA)的,而价值函数是分段二次的。我们利用MPC的这些形式化结果设计了一种用于CLQR问题的ADP方法。提出了一种具有局部-全局架构的新型凸分段二次神经网络,以提供对价值函数的准确近似,该价值函数被用作在线动态规划问题中的代价函数。开发了一种高效的分解算法以加速在线计算。在实现了对价值函数良好近似的条件下,对所提控制方案进行了闭环系统的严格稳定性分析。进行了对比仿真,以展示所提方法在在线计算和最优性方面的潜力。

英文摘要:

Approximate dynamic programming (ADP) faces challenges in dealing with constraints in control problems. Model predictive control (MPC) is, in comparison, well-known for its accommodation of constraints and stability guarantees, although its computation is sometimes prohibitive. This paper introduces an approach combining the two methodologies to overcome their individual limitations. The predictive control law for constrained linear quadratic regulation (CLQR) problems has been proven to be piecewise affine (PWA) while the value function is piecewise quadratic. We exploit these formal results from MPC to design an ADP method for CLQR problems. A novel convex and piecewise quadratic neural network with a local-global architecture is proposed to provide an accurate approximation of the value function, which is used as the cost-to-go function in the online dynamic programming problem. An efficient decomposition algorithm is developed to speed up the online computation. Rigorous stability analysis of the closed-loop system is conducted for the proposed control scheme under the condition that a good approximation of the value function is achieved. Comparative simulations are carried out to demonstrate the potential of the proposed method in terms of online computation and optimality.

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

↑