无静差的自适应极点配置算法及其收敛性  

Adaptive Pole Placement Algorithm Without Static Errorand Its Global Convergence

作　　者：高淑萍[1,2] 张纲[1,2] 

机构地区：[1]西安电子科技大学应用数学系 [2]西安统计学院基础部

出　　处：《工程数学学报》1998年第3期52-56,共5页Chinese Journal of Engineering Mathematics

摘　　要：提出了一个具有前馈的单变量自适应极点配置算法，解决了文［５］的遗留问题，即间接自适应极点配置算法无法跟踪期望输出的问题。该算法仿真结果表明其有效性。在没有持续激励的条件下证明其全局收敛性，同时解决了渐近配置闭环极点及实现期望跟踪问题。AbstractThis paper presents an adaptive pole placement algorithm with feedforward, resolves the problem which indirect adaptive pole placement algorithm cant follow the expected output, however, solves completly the problem left over by . The algorithm have following advantages: proves its global convergence without persistence exciting; resolves posisting closedloop poles asymptotically and the problem of expected output following.

关 键 词：渐近 全局收敛性 极点配置 期望 单变量 跟踪问题 算法 自适应 仿真结果 输出 

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