| 引用本文: | 李俊民，邢科义，万百五.递推自适应极点配置算法[J].控制理论与应用,1996,13(1):115~120.[点击复制] |
| LI Junmin，XING Keyi，WAN Baiwu.Recursive Adaptive Pole Placement Algorithm[J].Control Theory and Technology,1996,13(1):115~120.[点击复制] |
|
| 递推自适应极点配置算法 |
| Recursive Adaptive Pole Placement Algorithm |
| 摘要点击 960 全文点击 368 投稿时间：1994-08-16 修订日期：1995-03-06 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 1996,13(1):115-120 |
| 中文关键词 递推算法 极点配置 稳定性 收敛性 |
| 英文关键词 recursive algorithm pole placement stability convergence |
| 基金项目 |
|
| 中文摘要 |
| 本文提出了一种递推自适应极点配置算法，证明了它的稳定性和收敛性．该算法特点是在控制器参数的计算中利用一次迭代公式，使在线计算量大幅度减少；前馈环节保证它的渐近跟踪特性．最后，仿真例子说明该算法的正确性． |
| 英文摘要 |
| A recursive adaptive pole placement algorithm is presented in this paper. The stability and the convergence of the algorithm are respectively established. Since
one-step iterative formulation in computing controller's parameters is used，the on-line
computation cost is greatly reduced. The algorithm with the feed forward can follow an arbitrarily bounded output. Simulation examples show the efficiency of the algorithm. |