计算机控制理论第十一章.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Chapter 11 Optimal Design Methods: A State-Space Approach 11.1 Problem Formulation The Process The Criterion Admissible Control Laws Full state information is assumed. 11.2 Linear Quadratic Control (LQ Control) The Deterministic Case Theorem 11.1 LQ-control of a deterministic system Dynamic programming, Richard E. Bellman 1957 An optimal trajectory on the time interval [T1, T3] must be optimal also on the subintervals [T1, T2] and [T2, T3]. Dynamic programming in linear quadratic control Let S(k) be defined by Dynamic programming with T1= k ? 1, T2 =k, T3=N gives The completion of squares calculation then gives Jocopo Francesco Riccati, 1676–1754 Solution via the Riccati equation Define S(k) by the Riccati equation Then the control law u(k)=?L(k)x(k) minimizes the cost.The minimum is · Time-varying controller · Often or special LQ – First order system: x(k +1)= x(k)+u(k) Loss function defined by q1, q2, q0, and N Riccati equation Controller The stochastic LQ control problem Minimize subject to where v is white noise with Time-varying stochastic LQ control Minimize subject to where Dynamic programming again Define S(k) by the Riccati equation and Mean value of quadratic form Assume E x = 0 and cov x = R Solution to stationary problem Minimize subject to where v is white noise with How to solve the LQ problem in Matlab Use Matlab! [L,S,E] = DLQR(A,B,Q,R,N) Linear quadratic regulator design for discrete-time systems. u[n] = -Lx[n] minimizes the cost function J = Sum {xQx + uRu + 2*xNu} subject to the constraint equation: x[n+1] = Ax[n] + Bu[n] E = EIG(A-B*L) lqrd solves LQ starting with continuous-time loss function. Theorem: Stability of closed-loop system Assume that is positive definite and that there exists a positive-definite steady-state solution S to the algebraic Riccati equation. Then u(k)=?Lx(k) gives an asymptotically stable closed- loop system Sampling a loss function If u(t) is constant over the

文档评论(0)

xx88606 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档