Show simple item record

Robustness and Tuning of On-Line Optimizing Control Algorithms.

dc.contributor.authorZafiriou, E.en_US
dc.date.accessioned2007-05-23T09:41:27Z
dc.date.available2007-05-23T09:41:27Z
dc.date.issued1988en_US
dc.identifier.urihttp://hdl.handle.net/1903/4778
dc.description.abstractA significant number of Model Based Process Control algorithms solve online an appropriate optimization problem and do so at every sampling point. The major attraction of such algorithms, like the Quadratic Dynamic Matrix Control (QDMC), lies in the fact that they can handle static nonlinearities in the form of hard constraints on the inputs (manipulated variables) of a process. The presence of such constraints as well as additional performance or safety induced hard constraints on certain outputs or states of the process, result in an on-line optimization problem that produces a nonlinear controller, even when the plant and model dynamics are assumed linear. This paper provides a theoretical framework within which the stability and performance properties of such algorithms can be studied.en_US
dc.format.extent569930 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-49en_US
dc.titleRobustness and Tuning of On-Line Optimizing Control Algorithms.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record