l^1鲁棒辨识:一种递推插值方法  

l^1 robust identification:a recursive interpolatory algorithm

作　　者：李昇平[1] 

机构地区：[1]汕头大学机械电子工程系,广东汕头515063

出　　处：《控制理论与应用》2002年第6期932-936,共5页Control Theory & Applications

基　　金：广东省自然科学基金 (990 795 );国家计委工业自动化产业化子项目资助项目

摘　　要：针对l1鲁棒辨识不能有效利用试验数据和进行在线辨识的问题 ,提出了一种在线递推插值辨识方法 .用几何方法描述试验信息 ,利用系统可行集与新的试验信息所构成的半空间的包含关系判断数据信息 ,有效地利用了试验数据 ,提高了辨识精度 .同时提出了一种新的计算辨识误差紧界的方法 .仿真结果表明了算法的有效性和可行性 .This paper proposes an on-line recursive interpolatory algorithm for the l 1 robust identification problem. The new idea is to describe the experiment information and apirio information about system and noise by geometric appraoch. Then we can determine whether or not the new experiment data cantains innovations by the containing relation of model set determined by old data and the set formed from new data, meanwhile, the uncertainty of model set is reduced by effectively using the innovations contained in new data. Thus, the identification algorithm proposed can effectively use the experiment data and improves the identification precision. Finally analysis of the proposed recursive algorithm is carried out and a simulation example is presented to demonstrate the effectiveness of the algorithm.

关 键 词：l^1鲁棒辨识 递推插值方法 系统辨识 模型集 递推算法 

分 类 号：O231.3[理学—运筹学与控制论]