- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
nonlinear predictive control for fast constrained systems
Nonlinear Predictive Controlfor Fast Constrained Systems By Ahmed Youssef What’s MBPC Introduction Shortcomings of current industrial nonlinear MBPC Computing the MBPC control law demands significant on-line computation effort Inability to deal explicitly with the plant model uncertainty. Hamilton-Jacobi-Bellman The Coupled Algebraic Riccati Equations Case Studies CONCLUSIONS Properties of NLQGPC controller: High performance Less computational burden Dealing with input constraints Guaranteeing asymptotic stability to the closed-loop system. Possesses both performance robustness stability robustness * Introduction CV: controlled variable MV: manipulated variable Objective of research work Reducing the computational complexity of nonlinear MBPC adding the robustness property whilst preserving its good attributes to make it more effective practical tool for controlling systems of fast-constrained dynamics. Given the nonlinear dynamic model Reformulate into nonlinear state-dependent form This is not a linearisation Trivial example State Dependent State-Space Models The NLQGPC quadratic infinite horizon cost function: The optimal control vector in terms of the states of the system and reference model: NLQGPC Control Law Control Lyapunov Function A C1 function V(x): ?n ? ? is said to be a discrete CLF for the system: if V(x) is positive definite, unbounded, and if for all x ? 0 Dealing with Stability Issue Satisficing is based on a point-wise cost / benefit comparison of an action. The benefits are given by the “Selectability” function Ps(u,x), while the costs are given by the “Rejectability” function Pr(u,x). The “satisficing” set is those options for which selectability exceeds rejectability: Stability via Satisficing Satisficing generates the state dependent set of controls that render the closed-loop system stable with respect to
您可能关注的文档
- investing with a stock valuation model - yale university.ppt
- javari adding reference immutability to java.ppt
- introduction to geography - metropolitan community college.ppt
- java physics generator and analysis modules.ppt
- jet physics at cdf - phys.unm.edu.ppt
- justice lost! the failure of international human rights law to.ppt
- is a strategy for code smell assessment long overdue.ppt
- introduction to the principles of laboratory medicine.ppt
- k-anonymity a model for protecting privacy.ppt
- isolating curvature effects in computing wall-bounded.ppt
- objects first with java - chapter 12.ppt
- objects first with java - chapter 3 - wou homepage.ppt
- of mice and men - mounds view school websites.ppt
- on a network creation game - university of iowa.ppt
- on a network creation game - homepage.cs.uiowa.edu.ppt
- on experimental strongresearchstrong in sampling-based motion planning.ppt
- on static wcet analysis vs. run-time monitoring of execution.ppt
- next generation semantic web applications - people.ppt
- on individual and aggregate tcp performance.ppt
- on the autonomy of experiments in economics.ppt
文档评论(0)