Loop transfer recovery (LTR) procedures.PPT

  1. 1、本文档共63页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Loop transfer recovery (LTR) procedures

Multivariable Control Systems Ali Karimpour Assistant Professor Ferdowsi University of Mashhad Chapter 8 Design example Loop transfer recovery (LTR) procedures Recovery at the plant output Closed-loop step responses to step responses to different inputs. Design example Loop transfer recovery (LTR) procedures Recovery at the plant output The closed-loop poles are located at 1.1 ###Control System Design### {{{Control, Design}}} Shaping the principal gains (singular values) Let Ff as the return difference of Kalman filter, and define Then we can show that Exercise I : Derive equation I . (Hint Maciejowski 1989 pp. 227-231) Modify the matrices W and V Suppose we choose V=I. Then from which it follows that Exercise II: Derive equation II . So we can reduce by increasing , etc. But the point is not merely to reduce all the singular values of , but to reduce the largest one, relative to smallest. One way is: Suppose we need adjustment at ω1 Now let So so the jth singular value has been changed by a factor (1+α), while all the other singular values have been left unchanged. Shaping the principal gains (singular values) Modify the matrices W and V Example: Let Shaping the principal gains (singular values) Modify the matrices W and V Singular value of GfW1/2 is: We want to change 7.6 to 3*7.6 so we change W1/2 by Now let So so the jth singular value has been changed by a factor (1+α), while all the other singular values have been left unchanged. The problem with this approach is that uj is usually a complex vector, whereas we wish to keep W1/2 real. Once again we are faced with the problem of approximating a complex matrix by a real matrix, and as before we can employ the align algorithm. In this case other algorithms may be more appropriate, however, since we really want to approximate uj rather than align it. In particular, Re{uj} is sometimes an adequate approximation. A further possibility is to appro

文档评论(0)

love87421 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档