<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">IJIS</journal-id><journal-title-group><journal-title>International Journal of Intelligence Science</journal-title></journal-title-group><issn pub-type="epub">2163-0283</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ijis.2014.43009</article-id><article-id pub-id-type="publisher-id">IJIS-48263</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>COMPUTER SCIENCE &amp; COMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Adaptive Cascade Generalized Predictive Control</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Tao</surname><given-names>Geng</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jin</surname><given-names>Zhao</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Academy of Physics and Electroics, Henan University, Kaifeng, China</addr-line></aff><aff id="aff2"><addr-line>Academy of Control Science and Engineering, Huazhong University of Science and Technology (HUST), Wuhan, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>gengtao@henu.edu.cn(TG)</email>;<email>jinzhao617@mail.hust.edu.cn(JZ)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>04</day><month>07</month><year>2014</year></pub-date><volume>04</volume><issue>03</issue><fpage>70</fpage><lpage>79</lpage><history><date date-type="received"><day>25</day>	<month>May</month>	<year>2014</year></date><date date-type="rev-recd"><day>25</day>	<month>June</month>	<year>2014</year>	</date><date date-type="accepted"><day>2</day>	<month>July</month>	<year>2014</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
	Cascade control is
one of the most popular structures for process control as it is a special
architecture for dealing with disturbances. However, the drawbacks of cascade
control are obvious that primary controller and secondary controller should be
tuned together, which influences each other. In this paper, a new Adaptive
Cascade Generalized Predictive Controller (ACGPC) is introduced. ACGPC is a
method issued from GPC and the inner and outer controllers of a cascade system
are replaced by one cascade generalized predictive controller, where both loops
model are updated by Recursive Least Squares method. Compared with existing
methods, the new method is simpler and yet more effective. It can be directly
integrated into commercially available industrial auto-tuning systems. Some
examples are given to illustrate the effectiveness and robustness of the
proposed method.
</p></abstract><kwd-group><kwd>Adaptive Cascade Generalized Predictive Control</kwd><kwd> Model Identification</kwd><kwd> Cascade Control</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Cascade control is one of the most popular structures for process control as it is a special architecture for dealing with disturbances. It is widely used in practice, sometimes in a transparent way (embedded into the electronics of a servoactuator [<xref ref-type="bibr" rid="scirp.48263-ref1">1</xref>] , controlled power supply [<xref ref-type="bibr" rid="scirp.48263-ref2">2</xref>] , process control [<xref ref-type="bibr" rid="scirp.48263-ref3">3</xref>] etc.). The general block diagram of cascade control is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. Cascade control refers to the design of a control loop for one primary variable by means of multiple sensors and/or actuators and, in its basic configuration; it consists of two cooperative SISO control loops with different time constants. The time constants in inner loop and outer loop are always different. And this difference allows for separate design using conventional techniques.</p><fig id="fig1"><label>Figure 1</label><caption><p> General block diagram of cascade control</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\c6f13717-e818-4cf1-9e28-189e7171ac7c.png"/></fig><p>Previous researchers have proposed relay-based auto-tuning techniques to facilitate the design of cascade control systems. The methods proposed by Hang et al. [<xref ref-type="bibr" rid="scirp.48263-ref4">4</xref>] and Vivek and Chidambaram [<xref ref-type="bibr" rid="scirp.48263-ref5">5</xref>] need sequential ap- plication of the conventional relay-based auto-tuning approach, and are therefore still time consuming. The sequential tuning procedure has been improved so that only single relay experiment is required for auto-tuning [<xref ref-type="bibr" rid="scirp.48263-ref6">6</xref>] - [<xref ref-type="bibr" rid="scirp.48263-ref9">9</xref>] . However, an off-line or ad hoc experiment must be performed in these methods. For example, Leva and Donida [<xref ref-type="bibr" rid="scirp.48263-ref6">6</xref>] performed test with relay cascaded to an integrator, and Mehta and Majhi [<xref ref-type="bibr" rid="scirp.48263-ref8">8</xref>] restricted the secondary controller to controller during the relay test. Besides the relay-based method, Visioli and Piazzi [<xref ref-type="bibr" rid="scirp.48263-ref10">10</xref>] proposed an automatic tuning method consisting of an open-loop test for cascade control system. Veronesi and Visioli [<xref ref-type="bibr" rid="scirp.48263-ref11">11</xref>] recently proposed simultaneous closed-loop automatic tuning method for cascade controllers. Their method evaluates the set-point step response of cascade control system.</p><p>Whatever, based on the PID there are always two controllers needed to be configured. And obviously, the drawbacks of cascade control are obvious that primary controller and secondary controller should be tuned together, which influences each other. If there is not a substantial difference in time constants, although this strategy can still be pursued, the loop design cannot be made independently and based on SISO techniques. So tuning is not intuitive: centralized configurations might be preferable. CGPC [<xref ref-type="bibr" rid="scirp.48263-ref12">12</xref>] [<xref ref-type="bibr" rid="scirp.48263-ref13">13</xref>] is a method issued from GPC and the inner and outer controllers of a cascade system are replaced by one cascade generalized predictive controller. In this control paradigm, there is only one controller configured. If the models of inner process and out process were known, the controller can be auto-configured. This paper proposed an adaptive CGPC cascade controller shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. The both loops model are SISO. And the model can be identified by the classical method, respectively.</p></sec><sec id="s2"><title>2. GPC with Constraints</title><p>GPC adapts the model so-called Controlled auto regressive integrated moving average (CARIMA) model [<xref ref-type="bibr" rid="scirp.48263-ref14">14</xref>] [<xref ref-type="bibr" rid="scirp.48263-ref15">15</xref>] .</p><disp-formula id="scirp.48263-formula1"><label>(1)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\4418a19e-d9bf-4dac-a398-eda72a937e2d.png"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\52855f23-6229-41e8-b837-db772387007f.png" xlink:type="simple"/></inline-formula>is the model of noise, but it is commonplace to treat <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\2e2c6cb0-c9d2-4ff9-bcac-5a797a5012e1.png" xlink:type="simple"/></inline-formula> as a design parameter. Because it has direct effects on loop sensitivity and so better closed-loop performance will be got with a<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\fbba4839-d183-4f29-9d1d-f50ad9f0c6a8.png" xlink:type="simple"/></inline-formula>.</p><p>Then, a general form of future predictions is</p><disp-formula id="scirp.48263-formula2"><label>(2)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\7f8fd1fd-d4dc-4321-b912-3979a9232a0e.png"/></disp-formula><p>And the followed can be derived</p><disp-formula id="scirp.48263-formula3"><label>(3)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e282579d-fc2a-4955-813b-05cc761e29d6.png"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e9563e14-6279-4b74-ab7f-d99d3fca6296.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.48263-formula4"><label>(4)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\680c2076-8fde-438c-b74a-7e3d63e0742c.png"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\7bb74f59-1f6b-47d3-9a54-ef7a8c58ff60.png" xlink:type="simple"/></inline-formula>is the toeplitz matrix of <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\43190691-cdd8-4b3c-9fc9-ca1a4c1daf4a.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\029a9f56-a335-405c-89f2-8ada4618acde.png" xlink:type="simple"/></inline-formula> is the hankel matrix of <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\87ed8093-1054-4340-a526-eee85547ea36.png" xlink:type="simple"/></inline-formula> [<xref ref-type="bibr" rid="scirp.48263-ref16">16</xref>] . Constraints on process inputs and outputs make the controller and consequently the entire closed-loop, nonlinear.</p><p>Use the cost function and optimization</p><disp-formula id="scirp.48263-formula5"><label>(5)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\fe95ce28-11dc-424d-bb93-81aef5523948.png"/></disp-formula><fig id="fig2"><label>Figure 2</label><caption><p> Proposed control paradigm of adaptive cascade control</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\db2cc837-8223-4338-8639-88dc28b919df.png"/></fig><p>where, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\772f0cbb-7c74-4221-a917-f4a8f15e6120.png" xlink:type="simple"/></inline-formula>is j step ahead reference. <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\4357d683-51fd-4250-8fb1-ab74b14e8bd3.png" xlink:type="simple"/></inline-formula>is receding horizon and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\36e7aa6b-2cef-406d-b906-9b8ebc7030e9.png" xlink:type="simple"/></inline-formula> is control step.<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\31420690-9eb3-414e-af10-e437137a1fe1.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\40ea06a6-be0c-4ccf-b3fe-fde13680163e.png" xlink:type="simple"/></inline-formula>is the output and input weight factor. Described in matrix form, the GPC with constraints is converted to be the optimization problem which is</p><disp-formula id="scirp.48263-formula6"><label>(6)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f9786a6e-2db2-42a9-afea-d86474eba18a.png"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\0dc6fb75-977a-486b-a411-f2078efd7ea3.png" xlink:type="simple"/></inline-formula>is subject of the following constraints. Where <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\c9c4cc23-1615-40a5-bf47-658e8c7f1f3b.png" xlink:type="simple"/></inline-formula> is positive definite and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\ca7d5fc9-2c58-4e53-9187-d694d6df8273.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\80fe8fb3-6949-447a-a607-825110281bb9.png" xlink:type="simple"/></inline-formula>are time varying (dependent on the current state).</p><disp-formula id="scirp.48263-formula7"><label>(7)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5c3d60ec-b64a-4ce0-b638-5bc0124eaafa.png"/></disp-formula><p>The (6) is a standard quadratic programming with constraints. The constraints in GPC will be described as the following.</p><p> The Control Law without Constrains</p><p>Solve the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\1d5eb431-76cb-44b8-9561-94038246ddf5.png" xlink:type="simple"/></inline-formula></p><p>The control law without constrains is derived as</p><disp-formula id="scirp.48263-formula8"><label>(8)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f47db46f-ce17-4df3-8ff2-f32d5ca9bf47.png"/></disp-formula><p> Input move constraints</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\ca2afe82-9ccc-4728-84ad-e43dacccf72d.png" xlink:type="simple"/></inline-formula>is the lower bounds of input move constraints, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\ec1e564d-699d-4ec7-bf79-a6b70bc20c9e.png" xlink:type="simple"/></inline-formula> is the upper bounds of input move constraints.</p><disp-formula id="scirp.48263-formula9"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\0ee13848-5294-406c-a5d5-c57fd347fcd3.png"/></disp-formula><p>Which can be described in vector form as (9).</p><disp-formula id="scirp.48263-formula10"><label>(9)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\4ce06d1a-a22d-4553-90da-efb5d54a45bc.png"/></disp-formula><p>And satisfy the matrix inequality (10)</p><disp-formula id="scirp.48263-formula11"><label>(10)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f2a0b0f8-4b9c-4133-a95d-a4a83976499a.png"/></disp-formula><p> Input constraints</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\25b9fb08-524b-45ee-bdd7-602318b86550.png" xlink:type="simple"/></inline-formula>is the lower bounds of input constraints, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e4636fa1-35fc-4903-8ee2-542b39e202b3.png" xlink:type="simple"/></inline-formula> is the upper bounds of input constraints.</p><disp-formula id="scirp.48263-formula12"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\dc07afeb-42ff-46a1-835d-60f720726d26.png"/></disp-formula><p>where,<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f7cefd90-1a7a-4463-825d-8ae40e0cd973.png" xlink:type="simple"/></inline-formula>.</p><disp-formula id="scirp.48263-formula13"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\6cd287c5-33be-4d75-993d-8d8f652afd81.png"/></disp-formula><disp-formula id="scirp.48263-formula14"><label>(11)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\64c44071-879c-440f-8546-e3c66a899f05.png"/></disp-formula><p>The corresponding linear inequalities are</p><p> <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\2f8a397f-4605-48ad-93d3-95dd907ca9e5.png" xlink:type="simple"/></inline-formula></p><p> Output constrains</p><p>The output of plants always needs to be constrained in the bounds, as demand of process requirements. And they always are treated as soft constraints. <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\17806b0f-fbc1-4388-b14d-9e88c34cb7e5.png" xlink:type="simple"/></inline-formula>is the lower bounds of output constraints, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\4450d2dc-395f-4480-9026-282f128a7e3c.png" xlink:type="simple"/></inline-formula> is the upper bounds of output constraints.</p><disp-formula id="scirp.48263-formula15"><label>(12)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\ab1d77bb-f55a-4940-b2f0-aebc8af1ae91.png"/></disp-formula><p>If all constraints are satisfied, the (6) can be described as</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\767cdbbf-51a6-41c2-a2f7-14ae4d92bcf9.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\40abfbfd-33cc-40e9-8324-7701f39cb988.png" xlink:type="simple"/></inline-formula> (13)</p><p>qpOASES (quadratic program Online Active SEt Strategy) is an open-source implementation of the recently proposed online active set strategy, which was inspired by important observations from the field of parametric quadratic programming [<xref ref-type="bibr" rid="scirp.48263-ref16">16</xref>] [<xref ref-type="bibr" rid="scirp.48263-ref17">17</xref>] . The standard form is</p><disp-formula id="scirp.48263-formula16"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\00a21c11-c279-481a-a691-8594c819192d.png"/></disp-formula><p>The (6) can be converted to be in the qpOASES form. And the followed can be derived from (9), (11), (12)</p><disp-formula id="scirp.48263-formula17"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\819b31eb-7d9e-4610-8079-c719c98c3c52.png"/></disp-formula><disp-formula id="scirp.48263-formula18"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\819b31eb-7d9e-4610-8079-c719c98c3c52.png"/></disp-formula><disp-formula id="scirp.48263-formula19"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\819b31eb-7d9e-4610-8079-c719c98c3c52.png"/></disp-formula><p>And we can get</p><disp-formula id="scirp.48263-formula20"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\02d3e8c9-8789-48be-92fe-b3dde3015c0c.png"/></disp-formula><p>Algorithm 1-GPC with constraints</p><p>1) Firstly, we can identify the plant<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5cb8c0bb-d276-425c-aff5-5d21e76b7c5c.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\328fc947-7199-4029-9058-334e4a214031.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f2574cc6-1f9d-46d1-8dd1-a516f014cc4e.png" xlink:type="simple"/></inline-formula> can be calculated from (3), (4), Specify the factor<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\62f2edc5-b8f4-416b-8b0e-38a1b05e9ca6.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5cc52b88-9797-4773-9f09-e1dc5fda6aa6.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\a591e550-89ff-4bdf-a15b-48166998a082.png" xlink:type="simple"/></inline-formula>, receding horizon<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\87cf09b5-38b0-4aff-a6a5-d7d4233cfcdf.png" xlink:type="simple"/></inline-formula>, control step<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f5da4217-cfce-4738-bc9e-7bb203b92e78.png" xlink:type="simple"/></inline-formula>, bound of input<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5c5de663-a755-4686-94af-5f51ad2a3ad1.png" xlink:type="simple"/></inline-formula>, bound of</p><p>input rate<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\9057badf-0c84-4ac4-8151-510b55d15a06.png" xlink:type="simple"/></inline-formula>, bound of output<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\bd1e0285-ac5b-455f-b6a4-b27e73d77a38.png" xlink:type="simple"/></inline-formula>, calculate the<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\2fd4edab-5599-4b2b-a51c-137403ff0da6.png" xlink:type="simple"/></inline-formula>, initialize QProblem object (qpOASES).</p><p>2) sample the output, update<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\50554edf-90da-4b62-a568-803be7ee6fb2.png" xlink:type="simple"/></inline-formula>.</p><p>3) update <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\68e67c8d-454e-40a2-b0ed-f275335bdf64.png" xlink:type="simple"/></inline-formula> and QProblem object, return the optimization value<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\f210cf73-dbe1-4c96-a47d-cd36953a1d3a.png" xlink:type="simple"/></inline-formula>.</p><p>4) update<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\d5d91653-fef8-4e7a-b3d3-af240357acb1.png" xlink:type="simple"/></inline-formula>, output<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e1f1d96d-e2e3-4b8c-85aa-df9899e8b9a0.png" xlink:type="simple"/></inline-formula>.</p><p>5) go to (2).</p></sec><sec id="s3"><title>3. Cascaded Generalized Predictive Control</title><p>As shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>, Inner process model is described as</p><disp-formula id="scirp.48263-formula21"><label>(14)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\b2ef827f-5fd5-405a-ba52-3806fde502fd.png"/></disp-formula><p>And outer process model is described as</p><disp-formula id="scirp.48263-formula22"><label>(15)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\2b447ff2-3292-4c83-9394-7d2982b81fa3.png"/></disp-formula><p>Similar to Formula (1) and (2), future predictions for Formula (14) is</p><disp-formula id="scirp.48263-formula23"><label>(16)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\bd1d008e-f434-450b-a47b-7745fbdeb3f4.png"/></disp-formula><p><img src="htmlimages\2-1680133x\07124c41-01b7-4b78-bc24-a55cec8864a3.png" width="20" height="28.75" />means filter by <img src="htmlimages\2-1680133x\336fbc32-e003-422c-8e32-eaf74b563cfd.png" width="26.25" height="37.5" /></p><disp-formula id="scirp.48263-formula24"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\db777fd0-4f72-412e-9d55-7df53862b2df.png"/></disp-formula><disp-formula id="scirp.48263-formula25"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\db777fd0-4f72-412e-9d55-7df53862b2df.png"/></disp-formula><p>And the future predictions for Formula (15) is</p><disp-formula id="scirp.48263-formula26"><label>(17)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\7976a3cb-7ddd-4cd6-9c94-382e29ef52e2.png"/></disp-formula><p><img src="htmlimages\2-1680133x\a8040629-ba56-4e14-a21e-438411f70c0b.png" width="20" height="36.25" />means filter by <img src="htmlimages\2-1680133x\5b407d0a-16c1-4305-9115-2e943a0699cd.png" width="28.75" height="37.5" /></p><disp-formula id="scirp.48263-formula27"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5a5d9958-8e05-42f4-95ee-4decee88b7a9.png"/></disp-formula><disp-formula id="scirp.48263-formula28"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5a5d9958-8e05-42f4-95ee-4decee88b7a9.png"/></disp-formula><p>By substitution of Formula (16) into Formula (17)</p><disp-formula id="scirp.48263-formula29"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\ee827b7e-4230-4b01-a0f5-7a835aa6b7ee.png"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\86813b9f-adff-410f-9a75-86ed697f83bd.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e10ba894-311b-4a73-a5e5-82f4295bb627.png" xlink:type="simple"/></inline-formula></p><p>The control law without constrains corresponds with (8).</p><p>The control law with constrains for intermediate output</p><disp-formula id="scirp.48263-formula30"><label>(18)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\d1d1f8aa-ed44-45ac-af21-43343a8389d9.png"/></disp-formula><p><img src="htmlimages\2-1680133x\178150d3-4eb7-414a-a140-1e886547d732.png" width="20" height="28.75" />means filter by <img src="htmlimages\2-1680133x\d79db8b6-982b-4c22-875e-cceae67804b0.png" width="26.25" height="37.5" /></p><disp-formula id="scirp.48263-formula31"><label>(19)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\bc30469a-d741-4c70-8ef1-5ffcd92d4cf9.png"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\2e0efef6-bf0b-4e06-a150-bc4a382e4781.png" xlink:type="simple"/></inline-formula>is the lower bounds of intermediate output v constraints, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\53f9e884-d9d5-489e-8047-26ddd2328734.png" xlink:type="simple"/></inline-formula> is the upper bounds. By substitution of Formula (18) into Formula (19)</p><disp-formula id="scirp.48263-formula32"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\fbea48c3-607b-4df5-b23f-3260c609abe0.png"/></disp-formula><p>The corresponding linear inequalities are:</p><disp-formula id="scirp.48263-formula33"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\6aa3a894-301c-402f-a49b-d6f14119544c.png"/></disp-formula><disp-formula id="scirp.48263-formula34"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\6aa3a894-301c-402f-a49b-d6f14119544c.png"/></disp-formula><p>where,</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\186821c9-7c53-4704-a5bd-fed40dce9317.png" xlink:type="simple"/></inline-formula>，<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\4e02eb53-f9e9-49a7-adee-f117e2705b42.png" xlink:type="simple"/></inline-formula></p><p>The control law with constrains is converted to be standard quadratic programming with constraints problem and can be solved by Algorithm 1.</p></sec><sec id="s4"><title>4. Classical RLS Method</title><p>The SISO system can be identified by classical RLS method, which is described as followed.</p><disp-formula id="scirp.48263-formula35"><label>(20)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\8b9b88a9-5dff-4ee1-a92c-3401a809d7ca.png"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\16eaad9e-6e51-4b1b-8f4e-225b75577003.png" xlink:type="simple"/></inline-formula>means filter by <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\23fbde3e-6d81-4446-a199-677781552510.png" xlink:type="simple"/></inline-formula> in Equation (1). where <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\66b9ff99-9884-447c-b262-e7acdbd84339.png" xlink:type="simple"/></inline-formula> is a vector of adjustable model parameters and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\b0e6e93f-e200-49fa-9157-2cfa80c67358.png" xlink:type="simple"/></inline-formula> is the corresponding error at time<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\1b379c8c-3d15-4b7f-b3ce-27cc71619b71.png" xlink:type="simple"/></inline-formula>. The aim is to select <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\fe241af7-6362-4c23-a467-8fb2ded9f507.png" xlink:type="simple"/></inline-formula> so that overall modeling error is minimized. The classical recursive least square algorithm is</p><disp-formula id="scirp.48263-formula36"><label>(21)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\b653a43b-f4de-4d56-86a7-ab100fce678c.png"/></disp-formula><p>In the RLS algorithm, the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\6ad318d8-2301-4e9f-9f42-12b9dc30d229.png" xlink:type="simple"/></inline-formula> update equation Equation (21) is very sensitive to the truncation errors and there is no guarantee that <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\29391174-b464-4da1-b829-b589415f031e.png" xlink:type="simple"/></inline-formula> will always be positive and symmetric defined. The parameter identified by RLS will have biases from the true parameters, the stability and robustness of the algorithm is very poor. And then <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\cb0b3dbf-a4d2-4ddb-b376-c61d8474341f.png" xlink:type="simple"/></inline-formula> is revised as</p><disp-formula id="scirp.48263-formula37"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\e4e76fc3-7547-441b-97a6-83ca0ffaae75.png"/></disp-formula></sec><sec id="s5"><title>5. Verification on Proposed Scheme</title><p>Two examples are presented here to illustrate the effectiveness of the proposed tuning method for cascade control systems shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. The parameters of the ACGPC are in the <xref ref-type="table" rid="table1">Table 1</xref>.</p><p>In simulation, there is an identification process at first 100 s. Both inner and an outer model are identified by the classical RLS, respectively. The final value of model identified by the RLS is shown in the <xref ref-type="table" rid="table2">Table 2</xref> and <xref ref-type="table" rid="table3">Table 3</xref>, respectively. And the Figures 3-6 show model parameters estimated by RLS. There is rarely fluctuation in convergence of parameter estimated. Based on the model, the CGPC is applied to control the cascade system. The outer process outputs (primary outputs) of the control loops are presented in Figures 5-8. The figure clearly shows the CGPC have excellent transient performance. This implies that all the good properties of the cascade control are kept in the ACGPC. This behavior is specific to the cascade structures. And the ACGPC can auto- tune the CGPC.</p><table-wrap id="table1"  position="float"><object-id pub-id-type="pii">Table 1</object-id><label>Table 1</label><caption><p>. Numerical simulation parameters setting</p></caption><table><thead><tr><th align="center" valign="middle" >parameters</th><th align="center" valign="middle" >Symbol</th><th align="center" valign="middle" >Value</th></tr></thead><tbody><tr><td align="center" valign="middle"  rowspan="11"  >GPC</td><td align="center" valign="middle" ></td><td align="center" valign="middle" >1 s</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.4</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >20</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >3</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >−1</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >2.5</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >−2.5</td></tr><tr><td align="center" valign="middle"  rowspan="2"  >RLS</td><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.95</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.1 * 1<sub>3&#215;1</sub></td></tr></tbody></table></table-wrap><table-wrap id="table2"  position="float"><object-id pub-id-type="pii">Table 2</object-id><label>Table 2</label><caption><p>. Identification result of RLS for the real model</p></caption><table><thead><tr><th align="center" valign="middle" >Symbol</th><th align="center" valign="middle" >Value</th></tr></thead><tbody><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr></tbody></table></table-wrap><table-wrap id="table3"  position="float"><object-id pub-id-type="pii">Table 3</object-id><label>Table 3</label><caption><p>. Identification result of RLS for the real model</p></caption><table><thead><tr><th align="center" valign="middle" >Symbol</th><th align="center" valign="middle" >Value</th></tr></thead><tbody><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr></tbody></table></table-wrap><fig id="fig3"><label>Figure 3</label><caption><p> Identification result of RLS for the real model <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\6d84c93a-bfd4-4edd-aed0-fe9df45deef8.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\fec3d145-dfd1-475b-8995-49373e764d85.png" xlink:type="simple"/></inline-formula></p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\af204036-acee-4dad-9f18-9449ec6a27f6.png"/></fig><fig id="fig4"><label>Figure 4</label><caption><p> The control signals with and with control input constraints</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\5d59794d-bdf8-4914-bcbe-7cd837653af7.png"/></fig><fig id="fig5"><label>Figure 5</label><caption><p> The tracking and regulation performance of the CGPC</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\a9a1d42b-6bfd-43f8-86db-0e7b2aca4097.png"/></fig><fig id="fig6"><label>Figure 6</label><caption><p> Regulation performance of the CGPC under inner disturbance disturbance which zoomed in Figure 5</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\75b159c1-2d53-483c-99e5-0e4df32105e6.png"/></fig><fig id="fig7"><label>Figure 7</label><caption><p> The control signals with and with control input constraints</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\9754b256-b173-4a6f-bb16-4c075c9eddeb.png"/></fig><fig id="fig8"><label>Figure 8</label><caption><p> The control signals with and with control input constraints</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\04e76e33-0e70-4d51-9cd8-0b0b4f5f0aa8.png"/></fig><p>Example 1</p><p>The inner process is:</p><disp-formula id="scirp.48263-formula38"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\47389ff8-9cf7-45f5-b6b1-c6a62d7f3b3b.png"/></disp-formula><p>The outer process is:</p><p>• <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\392c3a6f-4c9e-4082-a701-590684af367d.png" xlink:type="simple"/></inline-formula></p><p>Example 2</p><p>The inner process is:</p><disp-formula id="scirp.48263-formula39"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\d222ecd7-5870-4c5c-98e1-a272769c8f19.png"/></disp-formula><p>The outer process is:</p><disp-formula id="scirp.48263-formula40"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\2-1680133x\afa98577-b71b-4a6a-b0a6-0b7a156a85e6.png"/></disp-formula></sec><sec id="s6"><title>6. Conclusion</title><p>This paper developed an ACGPC method for the cascade control system, which gives the possibility to identify and control some different variables together. Both inner loop and outer loop process model, parameters can be identified using classical RLS method. Consequently, well-identified model based on CGPC can be applied to cascade control system. Finally, two examples were given to show the effectiveness of the proposed method. The method is very straightforward and has been integrated into an existing auto-tuning system. It is now being tested in an electrical drives system and the field results will be reported soon.</p></sec><sec id="s7"><title>Acknowledgements</title><p>This work was supported by Henan University Science Foundation 2013YBZR013 and National Natural Sci- ence Foundation of China with grant number 61273174.</p></sec></body><back><ref-list><title>References</title><ref id="scirp.48263-ref1"><label>1</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>PISANO</surname><given-names> A.</given-names></name>,<name name-style="western"><surname> DAVILA</surname><given-names> A.</given-names></name>,<name name-style="western"><surname> FRIDMAN</surname><given-names> L.</given-names></name>,<name name-style="western"><surname> ET AL. </surname><given-names>  </given-names></name>,<etal>et al</etal>. (<year>2008</year>)<article-title>CASCADE CONTROL OF PM DC DRIVES VIA SECOND-ORDER SLIDING-MODE TECHNIQUE</article-title><source> IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS</source><volume> 55</volume>,<fpage> 3846</fpage>-<lpage>3854</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1109/TIE.2008.2002715</pub-id></mixed-citation></ref><ref id="scirp.48263-ref2"><label>2</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>TSANG</surname><given-names> K.M. </given-names></name>,<name name-style="western"><surname> CHAN</surname><given-names> W.L. </given-names></name>,<etal>et al</etal>. (<year>2008</year>)<article-title>NON-LINEAR CASCADE CONTROL OF DC/DC BUCK CONVERTER</article-title><source> ELECTRIC POWER COMPONENTS AND SYSTEMS</source><volume> 36</volume>,<fpage> 977</fpage>-<lpage>989</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1080/15325000801960937</pub-id></mixed-citation></ref><ref id="scirp.48263-ref3"><label>3</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>WOLFF ERIK</surname><given-names> A. </given-names></name>,<name name-style="western"><surname> SKOGESTAD</surname><given-names> S. </given-names></name>,<etal>et al</etal>. (<year>1996</year>)<article-title>WOLFF ERIK, A. AND SKOGESTAD, S.  TEMPERATURE CASCADE CONTROL OF DISTILLATION COLUMNS</article-title><source> INDUSTRIAL &amp; ENGINEERING CHEMISTRY RESEARCH</source><volume> 35</volume>,<fpage> 475</fpage>-<lpage>484</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.48263-ref4"><label>4</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>HANG</surname><given-names> C.C.</given-names></name>,<name name-style="western"><surname> LOH</surname><given-names> A.P. </given-names></name>,<name name-style="western"><surname> VASNANI</surname><given-names> V.U. </given-names></name>,<etal>et al</etal>. (<year>1994</year>)<article-title>RELAY FEEDBACK AUTO-TUNING OF CASCADE CONTROLLERS</article-title><source> IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY</source><volume> 2</volume>,<fpage> 42</fpage>-<lpage>45</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1109/87.273109</pub-id></mixed-citation></ref><ref id="scirp.48263-ref5"><label>5</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>VIVEK</surname><given-names> S. </given-names></name>,<name name-style="western"><surname> CHIDAMBARAM</surname><given-names> M. </given-names></name>,<etal>et al</etal>. (<year>2004</year>)<article-title>VIVEK, S. AND CHIDAMBARAM, M.  CASCADE CONTROLLER TUNING BY RELAY AUTO TUNE METHOD</article-title><source> JOURNAL OF THE INDIAN INSTITUTE OF SCIENCE</source><volume> 84</volume>,<fpage> 89</fpage>-<lpage>97</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.48263-ref6"><label>6</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>LEVA</surname><given-names> A. </given-names></name>,<name name-style="western"><surname> DONIDA</surname><given-names> F.F. </given-names></name>,<etal>et al</etal>. (<year>2009</year>)<article-title>AUTOTUNING IN CASCADED SYSTEMS BASED ON A SINGLE RELAY EXPERIMENT</article-title><source> JOURNAL OF PROCESS CONTROL</source><volume> 19</volume>,<fpage> 896</fpage>-<lpage>905</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/J.JPROCONT.2008.11.013</pub-id></mixed-citation></ref><ref id="scirp.48263-ref7"><label>7</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>SONG</surname><given-names> S.</given-names></name>,<name name-style="western"><surname> CAI</surname><given-names> W. </given-names></name>,<name name-style="western"><surname> WANG</surname><given-names> Y.G. </given-names></name>,<etal>et al</etal>. (<year>2003</year>)<article-title>AUTO-TUNING OF CASCADE CONTROL SYSTEMS</article-title><source> ISA TRANSACTIONS</source><volume> 42</volume>,<fpage> 62</fpage>-<lpage>72</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/S0019-0578(07)60114-1</pub-id></mixed-citation></ref><ref id="scirp.48263-ref8"><label>8</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>TAN</surname><given-names> K.K.</given-names></name>,<name name-style="western"><surname> LEE</surname><given-names> T.H. </given-names></name>,<name name-style="western"><surname> FERDOUS</surname><given-names> R. </given-names></name>,<etal>et al</etal>. (<year>2000</year>)<article-title>SIMULTANEOUS ONLINE AUTOMATIC TUNING OF CASCADE CONTROL FOR OPEN LOOP STABLE PROCESSES</article-title><source> ISA TRANSACTIONS</source><volume> 39</volume>,<fpage> 233</fpage>-<lpage>242</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/S0019-0578(00)00006-9</pub-id></mixed-citation></ref><ref id="scirp.48263-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">VISIOLI, A. AND PIAZZI, A. (2006) AN AUTOMATIC TUNING METHOD FOR CASCADE CONTROL SYSTEMS. PROCEEDINGS OF THE IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS, MUNICH, JULY 2006, 2968-2973.</mixed-citation></ref><ref id="scirp.48263-ref10"><label>10</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>VERONESI</surname><given-names> M. </given-names></name>,<name name-style="western"><surname> VISIOLI</surname><given-names> A. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>VERONESI, M. AND VISIOLI, A.  SIMULTANEOUS CLOSED-LOOP AUTOMATIC TUNING METHOD FOR CASCADE CONTROLLERS</article-title><source> CONTROL THEORY AND APPLICATIONS</source><volume> 5</volume>,<fpage> 263</fpage>-<lpage>270</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.48263-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">BENYÓ, I. (2006) CASCADE GENERALIZED PREDICTIVE CONTROL—APPLICATIONS IN POWER PLANT CONTROL. UNIVERSITY OF OULU, OULU.</mixed-citation></ref><ref id="scirp.48263-ref12"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>BENYÓ</surname><given-names> I. </given-names></name>,<etal>et al</etal>. (<year>2007</year>)<article-title>CASCADE GENERALIZED PREDICTIVE CONTROLLER: TWO IN ONE</article-title><source> INTERNATIONAL JOURNAL OF CONTROL</source><volume> 79</volume>,<fpage> 866</fpage>-<lpage>876</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.48263-ref13"><label>13</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>CLARKE</surname><given-names> D.W.</given-names></name>,<name name-style="western"><surname> MOHTADI</surname><given-names> C. </given-names></name>,<name name-style="western"><surname> TUFFS</surname><given-names> P.S. </given-names></name>,<etal>et al</etal>. (<year>1987</year>)<article-title>GENERALIZED PREDICTIVE CONTROL—PART II. EXTENSIONS AND INTERPRETATIONS</article-title><source> AUTOMATICA</source><volume> 23</volume>,<fpage> 149</fpage>-<lpage>160</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/0005-1098(87)90088-4</pub-id></mixed-citation></ref><ref id="scirp.48263-ref14"><label>14</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>CLARKE</surname><given-names> D.W.</given-names></name>,<name name-style="western"><surname> MOHTADI</surname><given-names> C. </given-names></name>,<name name-style="western"><surname> TUFFS</surname><given-names> P.S. </given-names></name>,<etal>et al</etal>. (<year>1987</year>)<article-title>GENERALIZED PREDICTIVE CONTROL—PART I. THE BASIC ALGORITHM</article-title><source> AUTOMATICA</source><volume> 23</volume>,<fpage> 137</fpage>-<lpage>148</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/0005-1098(87)90087-2</pub-id></mixed-citation></ref><ref id="scirp.48263-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">ROSSITER, J.A. (2003) MODEL-BASED PREDICTIVE CONTROL-A PRACTICAL APPROACH. CRC PRESS, WASHINGTON DC, 54-58.</mixed-citation></ref><ref id="scirp.48263-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">FERREAU, H.J. (2009) QPOASES (QUADRATIC PROGRAM ONLINE ACTIVE SET STRATEGY) VERSION 2.0. HTTP://WWW.QPOASES.ORG/</mixed-citation></ref><ref id="scirp.48263-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">FERREAU, H.J., BOCK, H.G. AND DIEHL, M. (2006) AN ONLINE ACTIVE SET STRATEGY FOR FAST PARAMETRIC QUADRATIC PROGRAMMING IN MPC APPLICATIONS. PROCEEDINGS OF THE IFAC WORKSHOP ON NONLINEAR MODEL PREDICTIVE CONTROL FOR FAST SYSTEMS, GRENOBLE, 2006, 21-30.</mixed-citation></ref></ref-list></back></article>