通过正则化和松弛连接直接和间接数据驱动的控制公式
Bridging direct & indirect data-driven control formulations via regularizations and relaxations
摘要:
我们讨论了线性定常系统的顺序系统辨识和控制之间的联系,通常称为间接数据驱动控制,以及当代直接数据驱动控制方法,寻求与汉克尔矩阵中组装的记录数据兼容的最佳决策,并通过适当的正则化鲁棒。我们制定这两个问题的语言行为系统理论和参数数学程序,我们通过一个多标准制定权衡系统辨识和控制目标的桥梁。我们说明了我们的结果与两种方法从子空间识别和控制:即,子空间预测控制和低秩近似约束轨迹是一致的非参数预测来自(分别列跨度)的数据汉克尔矩阵。在这两种情况下,我们得出结论,直接和正则化的数据驱动控制可以推导出作为凸松弛的间接方法,和正则化帐户的隐式识别步骤。我们的分析进一步揭示了一个新的正则化和一个合理的假设解释显着的经验性能的直接法对非线性系统。
英文摘要:
We discuss connections between sequential system identification and control for linear time-invariant systems, often termed indirect data-driven control, as well as a contemporary direct data-driven control approach seeking an optimal decision compatible with recorded data assembled in a Hankel matrix and robustified through suitable regularizations. We formulate these two problems in the language of behavioral systems theory and parametric mathematical programs, and we bridge them through a multi-criteria formulation trading off system identification and control objectives. We illustrate our results with two methods from subspace identification and control: namely, subspace predictive control and low-rank approximation which constrain trajectories to be consistent with a non-parametric predictor derived from (respectively, the column span of) a data Hankel matrix. In both cases we conclude that direct and regularized data-driven control can be derived as convex relaxation of the indirect approach, and the regularizations account for an implicit identification step. Our analysis further reveals a novel regularizer and a plausible hypothesis explaining the remarkable empirical performance of direct methods on nonlinear systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。