首页> 外文学位 >Robust system design: Pole assignment approaches.
【24h】

Robust system design: Pole assignment approaches.

机译:稳健的系统设计:极点分配方法。

获取原文
获取原文并翻译 | 示例

摘要

Robust control has been an important issue in the last two decades. Many efforts were put to develop methods which minimize some gains of the closed-loop system so that the closed-loop system attenuates the effect of some kind of noise signal. {dollar}Hsb{lcub}infty{rcub}, Hsb2,{dollar} and {dollar}lsp1{dollar} are therefore very popular research topics for many years. On the other hand, some traditional performance indices, like rise time, over-shoot, and settling time were not fully considered in the above mentioned design methods. Since performance and robustness are equally important, we address in this dissertation the robust pole assignment problem. One will see that this design considers both performance and robustness.; We first examine an existing algorithm, KNV algorithm, and relate it to an optimization problem. Next we propose several variations of KNV algorithm such that some of them are suitable for parallel machine, and some of them are suitable for sequential machine, moreover, all of them are able to assign complex eigenvalues (KNV algorithm cannot assign complex eigenvalues). We also show that the extended algorithms are globally convergent and more efficient than KNV algorithms. To verify these claims, we run thousands of examples and compare the results with the results obtained by other methods. This test shows the superiority of the proposed algorithms.; Trying to find better algorithms, we investigate some optimization techniques on Riemannian manifolds. The analysis on general problem is profitable. We propose improvement on some algorithms due to Smith, namely, we suggest using Armijo search instead of exact search scheme. We obtain the convergence and rate of convergence results for the generalized algorithms. Thereby, we obtain a unified theory for both unconstrained and constrained optimization. The new methods are particularly efficient for some special manifolds, including the manifold prescribed by pole assignment problem. We apply these techniques to pole assignment problem, and we expect that these techniques will be used for more control design problems in the future.
机译:在过去的二十年中,稳健的控制一直是重要的问题。为了开发使最小化闭环系统的增益最小化的方法,人们付出了很多努力,以使闭环系统衰减某种噪声信号的影响。因此,多年以来,{hsb {lcub} infty {rcub},hsb2,{dollar}和{dollar} lsp1 {dollar}都是非常受欢迎的研究主题。另一方面,在上述设计方法中并未完全考虑一些传统的性能指标,例如上升时间,过冲和稳定时间。由于性能和鲁棒性同等重要,因此我们在本文中讨论鲁棒极点分配问题。将会看到,这种设计同时考虑了性能和鲁棒性。我们首先检查现有算法KNV算法,并将其与优化问题联系起来。接下来,我们提出KNV算法的几种变体,以便其中一些适合并行机器,而某些则适合顺序机器,而且它们都能够分配复杂的特征值(KNV算法不能分配复杂的特征值)。我们还表明,扩展算法比KNV算法具有全局收敛性和更高的效率。为了验证这些主张,我们运行了数千个示例,并将结果与​​通过其他方法获得的结果进行比较。该测试表明了所提出算法的优越性。为了找到更好的算法,我们研究了黎曼流形上的一些优化技术。对一般问题的分析是有益的。由于Smith,我们建议对某些算法进行改进,即建议使用Armijo搜索而不是精确搜索方案。我们获得了广义算法的收敛性和收敛速度结果。因此,我们获得了无约束和约束优化的统一理论。对于某些特殊的歧管,包括极点分配问题规定的歧管,新方法特别有效。我们将这些技术应用于极点分配问题,并且我们期望这些技术将来将用于更多的控制设计问题。

著录项

  • 作者

    Yang, Yaguang.;

  • 作者单位

    University of Maryland College Park.;

  • 授予单位 University of Maryland College Park.;
  • 学科 Engineering Electronics and Electrical.; Engineering System Science.
  • 学位 Ph.D.
  • 年度 1996
  • 页码 158 p.
  • 总页数 158
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 无线电电子学、电信技术;系统科学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号