连续时间系统的简约识别:一种块坐标下降方法
Parsimonious Identification of Continuous-Time Systems: A Block-Coordinate Descent Approach
AI总结:
针对连续时间系统识别中非因式分解传递函数缺乏简约描述的问题,提出一种块坐标下降算法,通过顺序估计传递函数的加性分解来构建简约模型,数值仿真验证了其有效性。
摘要:
利用数据对电气、机械和生物系统进行识别,能从物理建模提取的先验知识中获益良多。参数化连续时间识别方法能自然地融入这些知识,从而产生可解释且简约的模型。然而,某些应用所导致的模型结构,在使用非因式分解传递函数时缺乏简约描述,而该函数常用于连续时间系统识别的标准直接方法中。本文刻画了这一简约性问题,并开发了一种块坐标下降算法,通过顺序估计目标传递函数的加性分解来提供简约模型。数值仿真证明了所提方法的有效性。
英文摘要:
The identification of electrical, mechanical, and biological systems using data can benefit greatly from prior knowledge extracted from physical modeling. Parametric continuous-time identification methods can naturally incorporate this knowledge, which leads to interpretable and parsimonious models. However, some applications lead to model structures that lack parsimonious descriptions using unfactored transfer functions, which are commonly used in standard direct approaches for continuous-time system identification. In this paper we characterize this parsimony problem, and develop a block-coordinate descent algorithm that delivers parsimonious models by sequentially estimating an additive decomposition of the transfer function of interest. Numerical simulations show the efficacy of the proposed approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。