This is a self-archive to the following paper.
|
|
- Daniel Kelly
- 5 years ago
- Views:
Transcription
1 This is a self-archive to the following paper. S. Hanba, Robust Nonlinear Model Predictive Control With Variable Bloc Length, IEEE Transactions on Automatic Control, Vol. 54, No. 7, pp , 2009 doi: 0.09/TAC To use this material, see the Copyright Notice below. Copyright Notice 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective wors for resale or redistribution to servers or lists, or to reuse any copyrighted component of this wor in other wors must be obtained from the IEEE. The published version may be found in
2 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED Robust nonlinear model predictive control with variable bloc length Shigeru Hanba, Member, IEEE Abstract Robust model predictive controllers for discretetime nonlinear systems are proposed in this paper. The algorithms first search for an open-loop controller with some bloc length, and then try to improve it in a closed-loop fashion by solving minimax problems on-line. It is proved that the controllers are capable of maing a subsequence of the state converge into a target set in the presence of bounded disturbances. I. INTRODUCTION AND PROBLEM STATEMENT The importance of constructing a robust model predictive controller for a nonlinear system is widely recognized [7], and extensive researches have been carried out [2] [4], [6], [8] [0]. However, there is a common drawbac in existing methods that many restrictive conditions on the stage cost, terminal constraints, and feasibility are required. This impairs the benefit of model predictive control (MPC) of being readily applicable to a variety of systems. The objective of this paper is to remedy this situation and construct robust model predictive controllers under relatively mild conditions. Consider a discrete-time nonlinear system of the form x + = f(x, u, w ), x R n, u R n u, w R n w, () where x is the state, u is the control input, and w is the disturbance at the time instant. We assume that f is C. The design objective is to drive the state of the system into a neighborhood of a target point x target. We intend to employ dual-mode MPC, and we assume that once the state is inside the neighborhood, the model predictive controller is turned off and some other controller (not discussed in this paper) is used. Typical applications the author has in mind are i) stabilization and ii) reaching control to a (controlled) attractors. For the former, x target is generally an equilibrium, whereas for the latter, x target is in a neighborhood of the attractor and not always an equilibrium; however, for the simplicity of notation, we let x target = 0. In what follows, u [i,j] denotes the sequence (u i,..., u j ). We identify u [i,i] with u i, and u [i,j] with the empty sequence if j < i. The sequence obtained by joining (u i,..., u j ) and (u j+,..., u l ) is denoted by u [i,j] : u [j+,l]. Similar notation is used for w i. The solution of () at time N with inputs u [0,N ] and disturbances w [0,N ] initialized at x 0 is denoted by φ(n, u [0,N ], w [0,N ], x 0 ); if the disturbances are identically zero, the solution is denoted by φ(n, u [0,N ], 0, x 0 ). For a vector, denotes any norm; for a matrix, it denotes S. Hanba is with the Department of Electrical and Electronics Engineering, University of the Ryuyus,, Senbaru, Nishihara, Naagamu-gun, Oinawa, , Japan ( sh@gargoyle.eee.u-ryuyu.ac.jp) the induced norm. The symbols B(x, σ x ) and B(x, σ x ) denote the open and closed balls centered at x with radius σ x. For a sequence u [i,j], B (u [i,j], σ u ) denotes the set {v [i,j] : {i,..., j}, v B(u, σ u )}. The symbol 0 either denotes the scalar zero, or a zero vector of any dimension. We assume that the disturbances are bounded, that is, for some σ w > 0 and for all, w σ w. II. VARIABLE BLOCK-LENGTH CONTROLLERS We assume a particular ind of controllability to the target point (the origin) as follows. Assumption For any x, there exist a N N and a sequence u [0,N ] that satisfy: i) φ(n, u [0,N ], 0, x) = 0, and ii) ran ( φ/ u [0,N ] ) = n at (u [0,N ], 0, x), where φ/ u [0,N ] denotes (( φ/ u 0 ) T,..., ( φ/ u N ) T ) T. The first condition of Assumption is the reachability and the second condition implies that the reachable set contains a non-empty open set. Assumption does not say anything about the bound of N or the norm of u [0,N ] ; however, the following lemma asserts that they are in fact bounded if the initial condition is on a compact set. Lemma 2 For any compact set Ω, there exist a N N and a continuous function ρ u on Ω that have the following properties: ( x Ω)( N N)( u [0,N ] B (0, ρ u (x)))(φ(n, u [0,N ], 0, x) = 0). Proof. For a x 0 Ω, choose some N x0 and u 0 [0,N x0 ] that satisfy Assumption. Let p be a vector consisting of elements of u [0,Nx0 ] that satisfy ran ( φ/ p)(n x0, u 0 [0,N x0 ], 0, x 0) = n, and q be the vector consisting of remaining elements. The vectors corresponding to u 0 [0,N x0 ] are denoted by p 0 and q 0. By omitting unnecessary arguments, we rewrite φ(n x0, u [0,Nx0 ], 0, x) = ψ(x, q, p). Choose some ε v > 0 and ε p > 0. Define Ψ(v, p) = (v T, (ψ(x 0 + v, q 0, p)) T ) T, where v R n. Because f is C and the Jacobian of Ψ is nonsingular at (0, p 0 ), for sufficiently small ε v and ε p, Ψ is a homeomorphism on B(0, ε v ) B(p 0, ε p ). Because ψ(x 0, q 0, p 0 ) = 0, for sufficiently small ε v ε v, the set {(v T, x T ) T : v ε v, x = 0} is contained in the image of Ψ. This implies that ( x B(x 0, ε v))( p x
3 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED 2 B(p 0, ε p ))(ψ(x, q 0, p x ) = 0). Let the sequence corresponding to p x and q 0 be u x [0,N x0 ], κ 0 = max j {0,...,Nx0 } u 0 j, and κ x0 = κ 0 + ε p. Our conclusion at this stage is as follows: ( x B(x 0, ε v))( u x [0,N x0 ] B (0, κ x0 )) (φ(n x0, u x [0,N x0 ], 0, x) = 0). Choose an open set V that contains B(x 0, ε v). By Urysohn s lemma, there is a continuous function ζ x0 : R n [0, κ x0 +ε p ] that is identically κ x0 + ε p on B(x 0, ε v) and identically zero on the complement of V. Consider the set of triples {(N x, ζ x, B(x, ε x )) : x Ω}, where N x, ζ x, and B(x, ε x ) are constructed for each x by the procedure described above. Because {B(x, ε x ) : x Ω} covers Ω and Ω is compact, there is a finite subcollection {B(x j, ε xj ) : x j Ω, j {,..., M}} for some M that also covers Ω. Let N = max j {,...,M} N xj and ρ u (x) = sup j {,...,M} ζ xj (x). They satisfy the desired property. Remar 3 The bound ρ u (x) obtained in Lemma 2 is of theoretical nature. It is difficult to evaluate it effectively, and there is no assurance that it is compatible to the physical limitations of engineering systems. Generally, solving the nonlinear equation φ(n, u [0,N ], 0, x) = 0 numerically requires infinitely many iterations. Thus, we replace it with the problem of finding u [0,N ] (an open-loop control sequence) which maes φ(n, u [0,N ], 0, x) α x for some 0 < α < and N N, whose existence is assured by Lemma 2. Because our objective is to construct a robust controller, we analyze the effect of w [0,N ] to φ(n, u [0,N ], 0, x). Temporally, let us denote U = (u T 0,..., u T N )T, W = (w0 T,..., wn T )T, W = ( N =0 w i 2 ) /2, and F N (U, W, x) = φ(n, u [0,N ], w [0,N ], x). Note that F N is C. Let θ n [0, ] R n, and define ( F Jw N N / W )(U, θ W, x) (U, W, θ, x) =.... (2) ( Fn N / W )(U, θ n W, x) Then, from the intermediate function theorem, for some θ, F N (U, W, x) F N (U, 0, x) = J N w (U, W, θ, x)w. (3) Choose a σ x > 0. Because the set Ω of Lemma 2 is arbitrary, one may assume that B(0, σ x ) Ω. Let σ u = max x B(0,σx ) ρ u(x), σ Jw (N) = max x B(0,σ x ), U B (0,σ u ), W B (0,σ w ), θ Qn [0,] J N w (U, W, θ, x), and σ Jw = max {j=,...,n} σ Jw (N). Then, by (3), for all x B(0, σ x ), F N (U, W, x) F N (U, 0, x) σ Jw Nσ w. (4) By using above results, we construct a piecewise openloop controller, which is similar to the bloc MPC of Sun et al. [4]. It consists of open-loop blocs with length N j. Choose some α (0, ). For x 0 B(0, σ x ), let u 0 [0,N 0 ] be a sequence of inputs that satisfy φ(n 0, u 0 [0,N ], 0, x 0) α x 0 with N 0 N. Let U 0 be the vector corresponding to u 0 [0,N 0 ]. Then, from (4), we obtain x N0 α x 0 + σ Jw Nσ w. (5) Let M j = j i=0 N i (the empty sum implies zero). Inductively, assume that x Mj B(0, σ x ). Then, it is possible to find N j N and U j that satisfy F Nj (U j, 0, x Mj ) α x Mj. Therefore, for all j, x Mj α j x 0 + (( α j )/( α))σ Jw Nσ w, provided that they are well defined. Therefore, in order for all x Mj to be in B(0, σ x ), it is sufficient that x 0 + σ J w Nσw σ x, (6) α and the above discussion shows that, if (6) is satisfied, the subsequence (x Mj ) j N converge into the set B(0, σ Jw Nσ w /( α)). (7) Remar 4 It should be noted that (6) imposes a restriction on not only the initial condition but also the disturbances, that is, σ w ( α)σ x /( Nσ Jw ) (8) If (8) is not satisfied, no initial condition is permissible. For linear systems, this is not restrictive because σ Jw is a constant and σ x may be arbitrarily large. For nonlinear systems, σ Jw depends on σ x ; hence, the restriction (8) may become more conservative by maing σ x larger. However, the convergence is semi-global in some sense, in that, an arbitrarily large initial condition is permitted by maing σ x larger at the expense of smaller permissible disturbances. Our new model predictive controllers are the closed-loop counterparts of aforementioned piecewise open loop controller. The endpoint of each bloc is fixed and the open-loop control sequence inside the bloc is improved by solving minimax problems on-line. We first consider the terminal condition only. Algorithm ) Choose a constant α satisfying 0 < α <, and let j = 0 and M j = 0. 2) The control terminates if x Mj is inside the target set. Otherwise, find N j ( N j N) and u 0 [0,N j ] B (0, σ u ) that give φ(n j, u 0 [0,N j ], 0, x M j ) α x Mj. (9) Let = 0 and proceed to step 3. 3) The control terminates if x Mj+ is inside the target set. If = N j, let M j+ = M j + N j, We define the target set to be a neighborhood of the target point x target specified by the designer. The controller is supposed to switch to the auxiliary control law after the state reaches into the target set according to the dualmode policy, but the auxiliary control law itself is not dealt with in this paper.
4 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED 3 j = j +, and return to step 2. Otherwise, solve min u [,N j ] B (0,σ u) max w [,N j ] B (0,σ w) φ(n j, u [,N j ], w [,N j ], x M j +). Let the solution be u [,N j ] and w[,n j ]. Apply u to () to obtain x Mj ++; let = +, and return to the beginning of this step. In order to analyze Algorithm, we require a simple technical lemma. Lemma 5 For a scalar function h(x, x 2, y, y 2 ), let (x b, x b 2, y b, y b 2) be a solution of min max h(x, x 2, y, y 2 ). x,x 2 y,y 2 For x b 2 and some y c 2, let (x a, y a ) be a solution of min max h(x, x b x y 2, y, y2). c Then, h(x a, x b 2, y a, y c 2) h(x b, x b 2, y b, y b 2). Proof. ( y )( y 2 )(h(x b, x b 2, y, y 2 ) h(x b, x b 2, y, b y2)) b and h(x a, x b 2, y, a y2) c h(x b, x b 2, y, a y2). c Proposition 6 Assume that (6) is satisfied. Then, by using Algorithm, the subsequence (x Mj ) j N converges into the set (7). Proof. From the construction of step 2 of Algorithm and (4), φ(n 0, u 0 [0,N 0 ], w0 [0,N 0 ], x 0) φ(n 0, u 0 [0,N 0 ], w0 [0,N 0 ], x 0) α x 0 + σ Jw Nσw. By Lemma 5, for all, φ(n 0, u + [+,N 0 ], w+ [+,N 0 ], x +) = φ(n 0, u act φ(n 0, u [,N 0 ], w,[n 0 ], x ), : u + [+,N 0 ], wact : w + [+,N 0 ], x ) where u act and w act are the actual control input and disturbance applied to the plant at the time instant (note that u act = u ). Moreover, x N 0 φ(, u N 0 N, 0 wn 0 N, x 0 N 0 ) because w N 0 N 0 is the worst disturbance. Therefore, x M = x N0 satisfies (5). Inductively, assume that x Mj α j x 0 +( j i=0 αi )σ Jw Nσw. Then, x Mj B(0, σ x ), and arguments similar to the above give x Mj+ α j+ x 0 + ( j i=0 αi )σ Jw Nσw, hence x Mj+ B(0, σ x ). Therefore, Algorithm is executable for all j and the subsequence (x Mj ) j N converges into the set B(0, σ Jw Nσw /( α)). If the target set contains the set (7) and is open, Algorithm terminates after finitely many iterations. Remar 7 The difficult step of Algorithm is to find a N j and a u [0,Nj ]. Computationally, this step is performed by minimizing φ(n j, u 0 [0,N j ], 0, x M j ) with increasing N j until φ(n j, u 0 [0,N j ], 0, x M j ) α x Mj is satisfied (true minimum is unnecessary). The solution can be found relatively easily if one chooses α. Next, we construct a variant of Algorithm that taes the stage cost into account. In the j-th bloc with length N j, consider the cost functions J j = N j i=0 l(i, φ(i +, u act [0, ] : u [,i], w act [0, ] : w [,i], x M j ), u i ), (0) for {0,..., N j }, in which u act [0, ] and wact [0, ] denote the sequences of control inputs and disturbances, respectively, that have already been applied to the system at the time instant M j +. In the summation of (0), if i <, u act [0, ] and w[0, ] act are interpreted as u act [0,i] and w[0,i] act, respectively; u i is interpreted as an element of u act [0, ] for i < and an element of u [,...,N j ] for i. It should be noted that, for evaluating (0), w[0,i ] act (i ) are in fact unnecessary, because x Mj +i = φ(i, u act [0,i ], wact [0,i ], x M j ) is nown. Algorithm 2 ) Choose a constant α satisfying 0 < α <, and let j = 0 and M j = 0. 2) The control terminates if x Mj is inside the target set. Otherwise, find a N j N and a u 0 [0,N j ] B (0, σ u ) that satisfy (9). Let = 0, J j = max φ(n j, u 0 [0,N w 0 j ], [0,N j ] B (0,σ w ) w 0 [0,N j ], x M j ), () and proceed to step 3. 3) The control terminates if x Mj + is inside the target set. If = N j, let M j+ = M j + N j, j = j +, and return to step 2. Otherwise, solve min u [,N j ] B (0,σ u ) max w [,N j ] B (0,σ w ) J j subject to max φ(n j, u [,N, j ] w [,N j ] B (0,σ w) w [,N j ], x M j +) J j. (2) Let the solution be (u [,N j ], w [,N j ] ). Apply u to () to obtain x Mj++, let = +, and return to the beginning of this step. Because of (2), Algorithm 2 is executable for all j, and the same convergence property as Proposition 6 is obtained. Let the optimal value of Jj be Jj. Then, by Lemma 5 (with a slight modification), it follows that Jj 0 Jj. Remar 8 Our stage cost has nothing to do with the convergence and may be designed rather freely. Time-varying or even discontinuous stage costs are permitted. A barrier-lie function may be used in order to mildly constrain the state inside a set. Exactly constraining the state in a specified set would require an extended function that taes the value + outside the set, but we do not consider such a function here, because introducing such a function causes a problem on feasibility. If it is desirable, instead of (0), a standard receding horizon type stage cost may be used together with the constraint (2).
5 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED 4 In this case, the constraint is not terminal, but the analysis of the convergence is still unaffected. Thus far, we have fixed the bloc length N j after determining N j and u [0,Nj ] that satisfy (9). However, a shorter bloc length is sometimes preferable. A variant of Algorithm that reduces the bloc length is as follows. Algorithm 3 ) Choose a constant α satisfying 0 < α <, and let j = 0 and M j = 0. 2) The control terminates if x Mj is inside the target set. Otherwise, find a N j N and a u 0 [0,N j ] B (0, σ u ) that satisfy (9). Let = 0, obtain J j by (), let Jj = J j, and proceed to step 3. 3) The control terminates if x Mj + is inside the target set. If = N j, let M j+ = M j + N j, j = j +, and return to step 2. Otherwise, for m = 0,..., N j, solve min max u [,+m] B (0,σ u ) w [,+m] B (0,σ w ) φ(m +, u [,+m], w [,+m], x M j +). Let the solution be (u,m [,+m], w,m [,+m]), and the corresponding cost be J,m. If J,m J j for some m, let Jj = J,m, N j = + m +, apply u,m to () to obtain x Mj++, let = +, and return to the beginning of this step. For m = N j, J,N J j j is always satisfied. Hence, Algorithm 3 is executable. Its convergence property is the same as that of Algorithm. Remar 9 Our algorithms, which we have been describing as a robust counterparts of the bloc MPC [4] thus far, may also be interpreted as a non-linear analogue of the tube MPC [8], [2], [3] with more freedom on the selection of the horizon. Our decrease condition (9) may be interpreted as a variant of the constraint tightening which is frequently used in existing MPC algorithms; however, our framewor has the important feature that, under Assumption, the feasibility is automatically assured by Lemma 2. III. NUMERICAL EXAMPLES In this section, we apply our algorithms to a slightly modified version of the system with zero-robustness given by Grimm et al [2] and a chained system []. Example Consider the two-dimensional system ( ) ( x ()( u x + = ) + w x u ), (3) where u [0, ] is the control input and w [0, ] is the disturbance. The symbol x (i) denotes the i-th component of x. For this system, we assume x = x() + x(2). In fact, the function f(x) = (x ()( u ), x u ) T is not C under this norm; nevertheless, our algorithms function effectively. We apply all our algorithms to (3). For Algorithm 2, we use the cost function l(i, φ(i+, ), u i ) = φ(i+, ) + u i (the symbol denotes an omission of arguments). Let x 0 = (a, b) T with a > 0, b > 0, and consider the first bloc. Because u 0 = and u = 0 gives x 2 = 0 if w 0 = w = 0, we begin with N 0 = 2 together with the reference controller (u 0 0, u 0 ) = (, 0). Let = 0 in the minor loop of each algorithm. Note that φ(, u 0, w 0, x 0 ) = (a( u 0 ) + w 0, (a + b)u 0 + w 0 ) T and ( ) (a( u0 ) + w φ(2, u [0,], w [0,], x 0 ) = 0 )( u ) + w. (a + bu 0 + 2w 0 )u + w (4) For Algorithm, let and h 2 (u [0,], w [0,] ) = φ(2, u [0,], w [0,], x 0 ) h 2 (u 0, u ) = max w [0,] h 2 (u [0,], w [0,] ). Then, h 2 taes the maximum at w 0 = w = ; therefore, h 2 (u 0, u ) = 3 + a au 0 + u + (a + b)u 0 u. (5) The minimum of (5) is on the border of [0, ] [0, ] because h/ u = + (a + b)u 0 = 0 implies u 0 < 0. By evaluating h on the border, the minimum of 3 is obtained at u 0 = and u = 0. Hence, u 0 [0,] = (, 0) and u 0 0 = is applied to (3). For Algorithm 2, J0 = 3 gives the constraint on the inputs, that is, a au 0 + u + (a + b)u 0 u 0, which has the unique solution u 0 [0,] = (, 0). Therefore, u0 0 = is applied to (3). Algorithm 3 is slightly different. For all u 0, φ(, u 0, w 0, x 0 ) taes the maximum h (u 0 ) = a + bu at w 0 =, which in turn taes the minimum a + 2 at u 0 = 0. Hence, if a, u 0 0 = 0 is applied to (3) and the first bloc terminates; otherwise, the behavior is the same as Algorithm. Next, let = (this step does not exist for Algorithm with a ). For Algorithm, we must solve min u max w x ()+ x (2)u +2w, whose solution is u = 0 and w =. Thus, u = 0 is applied to (3) and the first bloc terminates. For Algorithm 2, the constraint becomes w 0 + (a + b + w 0 )u. (6) By performing some calculations and omitting constant terms, we obtain the problem min u max w 2w +(+a+b+w 0 )u subject to (6), which has the solution u = 0 and w =. Thus, u = 0 is applied to (3) and the first bloc terminates. For Algorithm 3 with a, the result is the same as that of Algorithm. The analyses of succeeding blocs are the same. For all j, N j = 2, and except for Algorithm 3, a two-length control sequence (u Mj, u Mj +) = (, 0) is obtained. For Algorithm 3, a one-length control sequence (u Mj ) = (0) may obtained when x j (). The results of applying each algorithm to (3) with the initial condition (a, b) = (0, 0) are shown in Fig., in which the horizontal axis is the time and the vertical axis is the norm of the state at each time instant. For all algorithms, an identical randomly generated disturbance sequence whose components are uniformly distributed in the interval [0, ] is applied. From Fig., it can be observed that all algorithms successfully made the state bounded without causing any instability.
6 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED 5 x Algorithm and Algorithm 2 Algorithm time Fig.. Results of applying each algorithm to the system with zerorobustness. Example 2 Consider the following four-dimensional chained system []: x t () u t () d x t (2) dt x t (3) = u t (2) x t (2)u t (), (7) x t (4) x t (3)u t () where x t = (x t (), x t (2), x t (3), x t (4)) T is the state and u t = (u t (), u t (2)) T is the input at the time instant t. By assuming that u t is constant during the sampling period T and integrating, we obtain the following discrete-time system: x + () x () x + (2) x + (3) = x (2) x (3) x + (4) x (4) + T u () T u (2) T u ()x (2) + T 2 2 u ()u (2) T u ()x (3) + T 2 2 u2 ()x (2) + T 3 6 u2 ()u (2). (8) In the following, we give the results of applying Algorithm 2, a minimax MPC [9], [0], bloc MPC [4], and a conventional MPC [7] to (8) with T =. To see the robustness, randomly generated disturbance vectors were added to the state at each time instant. For all algorithms, the cost functions of the form (0) were used, with l(i, φ(i+, ), u i ) = φ(i+, ) 2 + u i 2, i = 0,..., N j. (9) Note that the bloc MPC and the conventional MPC assumes zero disturbance in the prediction, whereas Algorithm 2 and the minimax MPC assumes the worst-case disturbances. For Algorithm 2, N j was initialized with 4, whereas for other algorithms, N j was fixed at 4. No terminal constraints were used for the minimax MPC, the bloc MPC and the conventional MPC. The solutions to the minimax problems were obtained approximately by solving the maximization and minimization problems alternatively. Constrained problems were converted to unconstrained ones by the penalty function method. To solve the optimization problems, Powell s NEWUOA [] pacage (Scilab version by Guilbert [5]) was used. All parameters of NEWUOA were tuned so that the slowest algorithm is executable within one second (rhobeg = 0; maxfun 200 and rhoend=0 for the maximization; maxfun= 400 and rhoend=0 2 for the minimization; see the documentation of [5] for the meanings of these parameters). For Algorithm 2, different values of α were used for blocs of different lengths: for blocs with length, 2, and 3, α = 0 4, whereas for those with length greater than 3, α = 0. The reason of this possibly unnatural selection is that it is difficult to obtain a good minimizer in limited CPU time for higher dimensional blocs. The experiments were executed on an IBM-compatible PC (Core2 Quad CPU of 2.40GHz and 2GB of memory) with FreeBSD-7.0-STABLE, Scilab-4..2, and Atlas The CPU time was measured by Scilab s timer() function. The state was initialized with (0, 0, 0, 0) T, and each algorithm was applied over,000 steps of time. The results are shown in Table I, where E[ ] denotes the expectation (excluding the initial condition of the state) and τ denotes the CPU time required in calculating the control input. In (a), the range of the disturbances was [, ] (uniform distribution), whereas in (b), the range was [0, ], and the corresponding minimax problems were solved within this range. In this example, all algorithms successfully stabilized the system. As far as E[ x ] is considered, for (a), the conventional MPC outperformed other algorithms, and Algorithm 2 was next to it, whereas for (b), the minimax MPC outperformed other algorithms, and Algorithm 2 was next to it. Bloc MPC required the least average CPU time (about 0% of the minimax MPC), but the robustness was relatively poor against disturbances with non-zero expectations. Overall, the behavior of Algorithm 2 and the minimax MPC was similar, but the average CPU time of Algorithm 2 was about 50% 60% of that of the minimax MPC. Algorithm 2 and the minimax MPC required larger inputs (about 50% 290%) of other types. The distribution of the bloc lengths of Algorithm 2 is shown in (c). For both (a) and (b), the most frequently used bloc length was 3. Blocs with length greater than five were never used. TABLE I COMPARISON OF SEVERAL MPC ALGORITHMS FOR THE CHAINED SYSTEM. (a) Disturbance with range [, ]. E[τ ] E[ x ] E[ u ] Algorithm Minimax Bloc Conventional (b) Disturbance with range [0, ]. E[τ ] E[ x ] E[ u ] Algorithm Minimax Bloc Conventional (c) The distribution of the bloc lengths of Algorithm 2. Bloc length Case (a) Case (b)
7 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED 6 The performance degradation the conventional and bloc MPC in Table I (b) is due to the bias of the disturbance, and good performance may be recovered by using a disturbance observer. IV. CONCLUSION In this paper, we have constructed robust bloc model predictive controllers under relatively mild conditions on controllability to the target point. The strategy of these methods is to improve the open-loop controller in a closed-loop fashion by solving minimax problems on-line. If the target point is an equilibrium and the linear approximation of the system is controllable at the point, a dual-mode scheme that combines one of the proposed methods with linear state feedbac around the equilibrium provides a semi-global practical stabilizing controller. To the best of the author s nowledge, this is a rare example of a nonlinear closed-loop stabilizing controller being obtained in a constructive manner merely from the conditions on controllability. ACKNOWLEDGMENTS The author would lie to express his gratitude toward the anonymous referees for their careful reading and helpful and constructive comments. REFERENCES [] A. M. Bloch, Nonholonomic Mechanics and Control, Springer, [2] G. Grimm, M. J. Messina, S. E. Tuna and A. R. Teel, Examples when nonlinear model predictive control is nonrobust, Automatica, Volume 40, Issue 0, pp , [3] G. Grimm, M. J. Messina, S. E. Tuna and A. R. Teel, Model predictive control: for want of a local control Lyapunov function, all is not lost, IEEE Transactions on Automatic Control, Volume 50, Issue 5, pp , [4] G. Grimm, M. J. Messina, S. E. Tuna and A. R. Teel, Nominally robust model predictive control with state constraints, IEEE Transactions on Automatic Control, Volume 52, Issue 0, pp , [5] M. Guilbert, SCILAB-NEWUOA Interface, Available online at: accessed 8 July [6] L. Magni, D. M. Raimondo and R. Scattolini, Regional input-to-state stability for nonlinear model predictive control, IEEE Transactions on Automatic Control, Volume 5, Issue 9, pp , [7] D. Q. Mayne, J. B. Rawlings, C. V. Rao and P. O. M. Scoaert, Constrained model predictive control: stability and optimality, Automatica, Volume 36, Issue 6, pp , [8] W. Langson, I. Chryssochoos, S. V. Raovi and D. Q. Mayne, Robust model predictive control using tubes, Automatica, Volume 40, Issue, pp , [9] M. Lazar, D. M. de la Peña, W. P. M. H. Heemels and T. Alamo, On input-to-state stability of min-max nonlinear model predictive control, Systems & Control Letters, Volume 57, Issue, pp , [0] D. Limon, T. Alamo, F. Salas and E. F. Camacho, Input to state stability of min-max MPC controllers for nonlinear systems with bounded uncertainties, Automatica, Volume 42, Issue 5, pp , [] M. J. D. Powell, The NEWUOA software for unconstrained optimization without derivatives. 40th Worshop on Large Scale Nonlinear Optimization, Erice, Italy, [2] S. V. Raovic, E. C. Kerrigan, K. I. Kouramas and D. Q. Mayne, Invariant approximations of the minimal robust positively Invariant set, IEEE Transactions on Automatic Control, Volume 50, Issue 3, pp , [3] S. V. Raovic, E. C. Kerrigan, D. Q. Mayne and J. Lygeros, Reachability analysis of discrete-time systems with disturbances, IEEE Transactions on Automatic Control, Volume 5, Issue 4, pp , [4] J. Sun, I. V. Kolmanovsy, R. Ghaemi and S Chen, A stable bloc model predictive control with variable implementation horizon, Automatica, Volume 43, Issue, pp , 2007.
On the Inherent Robustness of Suboptimal Model Predictive Control
On the Inherent Robustness of Suboptimal Model Predictive Control James B. Rawlings, Gabriele Pannocchia, Stephen J. Wright, and Cuyler N. Bates Department of Chemical & Biological Engineering Computer
More informationOn the Inherent Robustness of Suboptimal Model Predictive Control
On the Inherent Robustness of Suboptimal Model Predictive Control James B. Rawlings, Gabriele Pannocchia, Stephen J. Wright, and Cuyler N. Bates Department of Chemical and Biological Engineering and Computer
More informationPredictive control of hybrid systems: Input-to-state stability results for sub-optimal solutions
Predictive control of hybrid systems: Input-to-state stability results for sub-optimal solutions M. Lazar, W.P.M.H. Heemels a a Eindhoven Univ. of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
More informationAdaptive Nonlinear Model Predictive Control with Suboptimality and Stability Guarantees
Adaptive Nonlinear Model Predictive Control with Suboptimality and Stability Guarantees Pontus Giselsson Department of Automatic Control LTH Lund University Box 118, SE-221 00 Lund, Sweden pontusg@control.lth.se
More informationOn robustness of suboptimal min-max model predictive control *
Manuscript received June 5, 007; revised Sep., 007 On robustness of suboptimal min-max model predictive control * DE-FENG HE, HAI-BO JI, TAO ZHENG Department of Automation University of Science and Technology
More informationFINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez
FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton
More informationIMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS
IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS D. Limon, J.M. Gomes da Silva Jr., T. Alamo and E.F. Camacho Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla Camino de los Descubrimientos
More informationESTIMATES ON THE PREDICTION HORIZON LENGTH IN MODEL PREDICTIVE CONTROL
ESTIMATES ON THE PREDICTION HORIZON LENGTH IN MODEL PREDICTIVE CONTROL K. WORTHMANN Abstract. We are concerned with model predictive control without stabilizing terminal constraints or costs. Here, our
More informationPostface to Model Predictive Control: Theory and Design
Postface to Model Predictive Control: Theory and Design J. B. Rawlings and D. Q. Mayne August 19, 2012 The goal of this postface is to point out and comment upon recent MPC papers and issues pertaining
More informationA Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1
A Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1 Ali Jadbabaie, Claudio De Persis, and Tae-Woong Yoon 2 Department of Electrical Engineering
More informationStabilizing Output Feedback Nonlinear Model Predictive Control: An Extended Observer Approach
Proceedings of the 17th International Symposium on Mathematical Theory of Networs and Systems, Kyoto, Japan, July 24-28, 2006 TuA102 Stabilizing Output Feedbac Nonlinear Model Predictive Control: An Extended
More informationA Stable Block Model Predictive Control with Variable Implementation Horizon
American Control Conference June 8-,. Portland, OR, USA WeB9. A Stable Block Model Predictive Control with Variable Implementation Horizon Jing Sun, Shuhao Chen, Ilya Kolmanovsky Abstract In this paper,
More informationRegional Input-to-State Stability for Nonlinear Model Predictive Control
1548 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 51, NO. 9, SEPTEMBER 2006 Regional Input-to-State Stability for Nonlinear Model Predictive Control L. Magni, D. M. Raimondo, and R. Scattolini Abstract
More informationPrediction-based adaptive control of a class of discrete-time nonlinear systems with nonlinear growth rate
www.scichina.com info.scichina.com www.springerlin.com Prediction-based adaptive control of a class of discrete-time nonlinear systems with nonlinear growth rate WEI Chen & CHEN ZongJi School of Automation
More informationA Generalization of Barbalat s Lemma with Applications to Robust Model Predictive Control
A Generalization of Barbalat s Lemma with Applications to Robust Model Predictive Control Fernando A. C. C. Fontes 1 and Lalo Magni 2 1 Officina Mathematica, Departamento de Matemática para a Ciência e
More informationOn the stability of receding horizon control with a general terminal cost
On the stability of receding horizon control with a general terminal cost Ali Jadbabaie and John Hauser Abstract We study the stability and region of attraction properties of a family of receding horizon
More informationNonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions
Nonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions Tingshu Hu Abstract This paper presents a nonlinear control design method for robust stabilization
More informationStochastic Tube MPC with State Estimation
Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems MTNS 2010 5 9 July, 2010 Budapest, Hungary Stochastic Tube MPC with State Estimation Mark Cannon, Qifeng Cheng,
More informationGLOBAL STABILIZATION OF THE INVERTED PENDULUM USING MODEL PREDICTIVE CONTROL. L. Magni, R. Scattolini Λ;1 K. J. Åström ΛΛ
Copyright 22 IFAC 15th Triennial World Congress, Barcelona, Spain GLOBAL STABILIZATION OF THE INVERTED PENDULUM USING MODEL PREDICTIVE CONTROL L. Magni, R. Scattolini Λ;1 K. J. Åström ΛΛ Λ Dipartimento
More informationFurther results on Robust MPC using Linear Matrix Inequalities
Further results on Robust MPC using Linear Matrix Inequalities M. Lazar, W.P.M.H. Heemels, D. Muñoz de la Peña, T. Alamo Eindhoven Univ. of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands,
More informationOptimized Robust Control Invariant Tubes. & Robust Model Predictive Control
Optimized Robust Control Invariant Tubes & Robust Model Predictive Control S. V. Raković (sasa.rakovic@imperial.ac.uk) Imperial College, London Imperial College, 17. November 2004 Imperial College ICM
More informationNonlinear Model Predictive Control for Periodic Systems using LMIs
Marcus Reble Christoph Böhm Fran Allgöwer Nonlinear Model Predictive Control for Periodic Systems using LMIs Stuttgart, June 29 Institute for Systems Theory and Automatic Control (IST), University of Stuttgart,
More informationStability analysis of constrained MPC with CLF applied to discrete-time nonlinear system
. RESEARCH PAPER. SCIENCE CHINA Information Sciences November 214, Vol. 57 11221:1 11221:9 doi: 1.17/s11432-14-5111-y Stability analysis of constrained MPC with CLF applied to discrete-time nonlinear system
More informationEnlarged terminal sets guaranteeing stability of receding horizon control
Enlarged terminal sets guaranteeing stability of receding horizon control J.A. De Doná a, M.M. Seron a D.Q. Mayne b G.C. Goodwin a a School of Electrical Engineering and Computer Science, The University
More informationTube Model Predictive Control Using Homothety & Invariance
Tube Model Predictive Control Using Homothety & Invariance Saša V. Raković rakovic@control.ee.ethz.ch http://control.ee.ethz.ch/~srakovic Collaboration in parts with Mr. Mirko Fiacchini Automatic Control
More informationDecentralized and distributed control
Decentralized and distributed control Centralized control for constrained discrete-time systems M. Farina 1 G. Ferrari Trecate 2 1 Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB) Politecnico
More informationRobust Adaptive MPC for Systems with Exogeneous Disturbances
Robust Adaptive MPC for Systems with Exogeneous Disturbances V. Adetola M. Guay Department of Chemical Engineering, Queen s University, Kingston, Ontario, Canada (e-mail: martin.guay@chee.queensu.ca) Abstract:
More informationMOST control systems are designed under the assumption
2076 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 53, NO. 9, OCTOBER 2008 Lyapunov-Based Model Predictive Control of Nonlinear Systems Subject to Data Losses David Muñoz de la Peña and Panagiotis D. Christofides
More informationMPC: implications of a growth condition on exponentially controllable systems
MPC: implications of a growth condition on exponentially controllable systems Lars Grüne, Jürgen Pannek, Marcus von Lossow, Karl Worthmann Mathematical Department, University of Bayreuth, Bayreuth, Germany
More informationECE7850 Lecture 8. Nonlinear Model Predictive Control: Theoretical Aspects
ECE7850 Lecture 8 Nonlinear Model Predictive Control: Theoretical Aspects Model Predictive control (MPC) is a powerful control design method for constrained dynamical systems. The basic principles and
More informationThe Rationale for Second Level Adaptation
The Rationale for Second Level Adaptation Kumpati S. Narendra, Yu Wang and Wei Chen Center for Systems Science, Yale University arxiv:1510.04989v1 [cs.sy] 16 Oct 2015 Abstract Recently, a new approach
More informationA SIMPLE TUBE CONTROLLER FOR EFFICIENT ROBUST MODEL PREDICTIVE CONTROL OF CONSTRAINED LINEAR DISCRETE TIME SYSTEMS SUBJECT TO BOUNDED DISTURBANCES
A SIMPLE TUBE CONTROLLER FOR EFFICIENT ROBUST MODEL PREDICTIVE CONTROL OF CONSTRAINED LINEAR DISCRETE TIME SYSTEMS SUBJECT TO BOUNDED DISTURBANCES S. V. Raković,1 D. Q. Mayne Imperial College London, London
More informationNonlinear Reference Tracking with Model Predictive Control: An Intuitive Approach
onlinear Reference Tracking with Model Predictive Control: An Intuitive Approach Johannes Köhler, Matthias Müller, Frank Allgöwer Abstract In this paper, we study the system theoretic properties of a reference
More informationLearning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System
Learning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System Ugo Rosolia Francesco Borrelli University of California at Berkeley, Berkeley, CA 94701, USA
More informationDistributed Receding Horizon Control of Cost Coupled Systems
Distributed Receding Horizon Control of Cost Coupled Systems William B. Dunbar Abstract This paper considers the problem of distributed control of dynamically decoupled systems that are subject to decoupled
More informationDeakin Research Online
Deakin Research Online This is the published version: Phat, V. N. and Trinh, H. 1, Exponential stabilization of neural networks with various activation functions and mixed time-varying delays, IEEE transactions
More informationSet Robust Control Invariance for Linear Discrete Time Systems
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 12-15, 2005 MoB09.5 Set Robust Control Invariance for Linear Discrete
More informationSuboptimality of minmax MPC. Seungho Lee. ẋ(t) = f(x(t), u(t)), x(0) = x 0, t 0 (1)
Suboptimality of minmax MPC Seungho Lee In this paper, we consider particular case of Model Predictive Control (MPC) when the problem that needs to be solved in each sample time is the form of min max
More informationarxiv: v3 [math.ds] 22 Feb 2012
Stability of interconnected impulsive systems with and without time-delays using Lyapunov methods arxiv:1011.2865v3 [math.ds] 22 Feb 2012 Sergey Dashkovskiy a, Michael Kosmykov b, Andrii Mironchenko b,
More informationProblem: A class of dynamical systems characterized by a fast divergence of the orbits. A paradigmatic example: the Arnold cat.
À È Ê ÇÄÁ Ë ËÌ ÅË Problem: A class of dynamical systems characterized by a fast divergence of the orbits A paradigmatic example: the Arnold cat. The closure of a homoclinic orbit. The shadowing lemma.
More informationApproximation Metrics for Discrete and Continuous Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science May 2007 Approximation Metrics for Discrete Continuous Systems Antoine Girard University
More informationRobust Control for Nonlinear Discrete-Time Systems with Quantitative Input to State Stability Requirement
Proceedings of the 7th World Congress The International Federation of Automatic Control Robust Control for Nonlinear Discrete-Time Systems Quantitative Input to State Stability Requirement Shoudong Huang
More informationNEW SUPERVISORY CONTROL USING CONTROL-RELEVANT SWITCHING
NEW SUPERVISORY CONTROL USING CONTROL-RELEVANT SWITCHING Tae-Woong Yoon, Jung-Su Kim Dept. of Electrical Engineering. Korea University, Anam-dong 5-ga Seongbuk-gu 36-73, Seoul, Korea, twy@korea.ac.kr,
More informationMoving Horizon Estimation with Decimated Observations
Moving Horizon Estimation with Decimated Observations Rui F. Barreiro A. Pedro Aguiar João M. Lemos Institute for Systems and Robotics (ISR) Instituto Superior Tecnico (IST), Lisbon, Portugal INESC-ID/IST,
More informationThe ϵ-capacity of a gain matrix and tolerable disturbances: Discrete-time perturbed linear systems
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. IV (May - Jun. 2015), PP 52-62 www.iosrjournals.org The ϵ-capacity of a gain matrix and tolerable disturbances:
More informationKonstantinos Chrysafinos 1 and L. Steven Hou Introduction
Mathematical Modelling and Numerical Analysis Modélisation Mathématique et Analyse Numérique Will be set by the publisher ANALYSIS AND APPROXIMATIONS OF THE EVOLUTIONARY STOKES EQUATIONS WITH INHOMOGENEOUS
More informationRobust output feedback model predictive control of constrained linear systems
Automatica 42 (2006) 1217 1222 Brief paper Robust output feedback model predictive control of constrained linear systems D.Q. Mayne a, S.V. Raković a,, R. Findeisen b, F. Allgöwer b a Department of Electrical
More informationA Novel Integral-Based Event Triggering Control for Linear Time-Invariant Systems
53rd IEEE Conference on Decision and Control December 15-17, 2014. Los Angeles, California, USA A Novel Integral-Based Event Triggering Control for Linear Time-Invariant Systems Seyed Hossein Mousavi 1,
More informationRobust Nonlinear Model Predictive Control with Constraint Satisfaction: A Relaxation-based Approach
Proceedings of the 9th World Congress he International Federation of Automatic Control Robust Nonlinear Model Predictive Control with Constraint Satisfaction: A Relaxation-based Approach Stefan Streif
More informationGiulio Betti, Marcello Farina and Riccardo Scattolini
1 Dipartimento di Elettronica e Informazione, Politecnico di Milano Rapporto Tecnico 2012.29 An MPC algorithm for offset-free tracking of constant reference signals Giulio Betti, Marcello Farina and Riccardo
More informationEconomic model predictive control with self-tuning terminal weight
Economic model predictive control with self-tuning terminal weight Matthias A. Müller, David Angeli, and Frank Allgöwer Abstract In this paper, we propose an economic model predictive control (MPC) framework
More informationNavigation and Obstacle Avoidance via Backstepping for Mechanical Systems with Drift in the Closed Loop
Navigation and Obstacle Avoidance via Backstepping for Mechanical Systems with Drift in the Closed Loop Jan Maximilian Montenbruck, Mathias Bürger, Frank Allgöwer Abstract We study backstepping controllers
More informationA Model Predictive Control Framework for Hybrid Dynamical Systems
A Model Predictive Control Framework for Hybrid Dynamical Systems Berk Altın Pegah Ojaghi Ricardo G. Sanfelice Department of Computer Engineering, University of California, Santa Cruz, CA 9564, USA (e-mail:
More informationTheory in Model Predictive Control :" Constraint Satisfaction and Stability!
Theory in Model Predictive Control :" Constraint Satisfaction and Stability Colin Jones, Melanie Zeilinger Automatic Control Laboratory, EPFL Example: Cessna Citation Aircraft Linearized continuous-time
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationPassivity-based Stabilization of Non-Compact Sets
Passivity-based Stabilization of Non-Compact Sets Mohamed I. El-Hawwary and Manfredi Maggiore Abstract We investigate the stabilization of closed sets for passive nonlinear systems which are contained
More informationEfficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph
Efficient robust optimization for robust control with constraints p. 1 Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph Efficient robust optimization
More informationA Robust MPC/ISM Hierarchical Multi-Loop Control Scheme for Robot Manipulators
52nd IEEE Conference on Decision and Control December 1-13, 213. Florence, Italy A Robust MPC/ISM Hierarchical Multi-Loop Control Scheme for Robot Manipulators Antonella Ferrara and Gian Paolo Incremona
More informationRobust Stabilization of Non-Minimum Phase Nonlinear Systems Using Extended High Gain Observers
28 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 28 WeC15.1 Robust Stabilization of Non-Minimum Phase Nonlinear Systems Using Extended High Gain Observers Shahid
More informationFeedback stabilisation with positive control of dissipative compartmental systems
Feedback stabilisation with positive control of dissipative compartmental systems G. Bastin and A. Provost Centre for Systems Engineering and Applied Mechanics (CESAME Université Catholique de Louvain
More informationDECAY AND GROWTH FOR A NONLINEAR PARABOLIC DIFFERENCE EQUATION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 133, Number 9, Pages 2613 2620 S 0002-9939(05)08052-4 Article electronically published on April 19, 2005 DECAY AND GROWTH FOR A NONLINEAR PARABOLIC
More informationReference Tracking with Guaranteed Error Bound for Constrained Linear Systems
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Reference Tracing with Guaranteed Error Bound for Constrained Linear Systems Di Cairano, S.; Borrelli, F. TR215-124 October 215 Abstract We
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationIEOR 265 Lecture 14 (Robust) Linear Tube MPC
IEOR 265 Lecture 14 (Robust) Linear Tube MPC 1 LTI System with Uncertainty Suppose we have an LTI system in discrete time with disturbance: x n+1 = Ax n + Bu n + d n, where d n W for a bounded polytope
More informationINVERTING CONTROL, A NEW STRATEGY ON TIME DELAYED SYSTEMS
Proceedings of the 17th World Congress The International Federation of Automatic Control Seoul, Korea, July 6-11, 8 INVERTING CONTROL, A NEW STRATEGY ON TIME DELAYED SYSTEMS Ali Fuat Ergenc 1*, Hassan
More informationThe Tuning of Robust Controllers for Stable Systems in the CD-Algebra: The Case of Sinusoidal and Polynomial Signals
The Tuning of Robust Controllers for Stable Systems in the CD-Algebra: The Case of Sinusoidal and Polynomial Signals Timo Hämäläinen Seppo Pohjolainen Tampere University of Technology Department of Mathematics
More informationSolving Zero-Sum Security Games in Discretized Spatio-Temporal Domains
Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains APPENDIX LP Formulation for Constant Number of Resources (Fang et al. 3) For the sae of completeness, we describe the LP formulation
More informationHIGHER ORDER SLIDING MODES AND ARBITRARY-ORDER EXACT ROBUST DIFFERENTIATION
HIGHER ORDER SLIDING MODES AND ARBITRARY-ORDER EXACT ROBUST DIFFERENTIATION A. Levant Institute for Industrial Mathematics, 4/24 Yehuda Ha-Nachtom St., Beer-Sheva 843, Israel Fax: +972-7-232 and E-mail:
More informationConvergence Rate of Nonlinear Switched Systems
Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the
More informationNonlinear error dynamics for cycled data assimilation methods
Nonlinear error dynamics for cycled data assimilation methods A J F Moodey 1, A S Lawless 1,2, P J van Leeuwen 2, R W E Potthast 1,3 1 Department of Mathematics and Statistics, University of Reading, UK.
More informationAn homotopy method for exact tracking of nonlinear nonminimum phase systems: the example of the spherical inverted pendulum
9 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June -, 9 FrA.5 An homotopy method for exact tracking of nonlinear nonminimum phase systems: the example of the spherical inverted
More informationImproved MPC Design based on Saturating Control Laws
Improved MPC Design based on Saturating Control Laws D.Limon 1, J.M.Gomes da Silva Jr. 2, T.Alamo 1 and E.F.Camacho 1 1. Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla, Camino de
More informationStrong Implication-Form ISS-Lyapunov Functions for Discontinuous Discrete-Time Systems
Strong Implication-Form ISS-Lyapunov Functions for Discontinuous Discrete-Time Systems Lars Grüne and Christopher M. Kellett Abstract Input-to-State Stability (ISS) and the ISS- Lyapunov function have
More informationConvergence of a Two-parameter Family of Conjugate Gradient Methods with a Fixed Formula of Stepsize
Bol. Soc. Paran. Mat. (3s.) v. 00 0 (0000):????. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v38i6.35641 Convergence of a Two-parameter Family of Conjugate
More informationMPC for tracking periodic reference signals
MPC for tracking periodic reference signals D. Limon T. Alamo D.Muñoz de la Peña M.N. Zeilinger C.N. Jones M. Pereira Departamento de Ingeniería de Sistemas y Automática, Escuela Superior de Ingenieros,
More informationA class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
Comput Optim Appl (25) 6: 33 DOI.7/s589-4-9665-9 A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations L. Grippo F. Rinaldi Received:
More informationResearch Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming
Discrete Dynamics in Nature and Society Volume 20, Article ID 7697, pages doi:0.55/20/7697 Research Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming Wei-Xiang
More informationMODEL predictive control (MPC) is a control technique
556 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 56, NO. 3, MARCH 2011 Robust Model Predictive Control With Integral Sliding Mode in Continuous-Time Sampled-Data Nonlinear Systems Matteo Rubagotti, Student
More informationA new low-and-high gain feedback design using MPC for global stabilization of linear systems subject to input saturation
A new low-and-high gain feedbac design using MPC for global stabilization of linear systems subject to input saturation Xu Wang 1 Håvard Fjær Grip 1; Ali Saberi 1 Tor Arne Johansen Abstract In this paper,
More informationOn Acceleration with Noise-Corrupted Gradients. + m k 1 (x). By the definition of Bregman divergence:
A Omitted Proofs from Section 3 Proof of Lemma 3 Let m x) = a i On Acceleration with Noise-Corrupted Gradients fxi ), u x i D ψ u, x 0 ) denote the function under the minimum in the lower bound By Proposition
More informationFinite horizon robust model predictive control with terminal cost constraints
Finite horizon robust model predictive control with terminal cost constraints Danlei Chu, Tongwen Chen and Horacio J Marquez Department of Electrical & Computer Engineering, University of Alberta, Canada,
More informationRobust Explicit MPC Based on Approximate Multi-parametric Convex Programming
43rd IEEE Conference on Decision and Control December 4-7, 24 Atlantis, Paradise Island, Bahamas WeC6.3 Robust Explicit MPC Based on Approximate Multi-parametric Convex Programming D. Muñoz de la Peña
More informationx + 1/2 ; 0 x 1/2 f(x) = 2 2x ; 1/2 < x 1
Lecture 3: Invariant Measures Finding the attracting set of a dynamical system tells us asymptotically what parts of the phase space are visited, but that is not the only thing of interest about the long-time
More informationIntroduction to Model Predictive Control. Dipartimento di Elettronica e Informazione
Introduction to Model Predictive Control Riccardo Scattolini Riccardo Scattolini Dipartimento di Elettronica e Informazione Finite horizon optimal control 2 Consider the system At time k we want to compute
More informationNOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES
NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs
More informationRobustly stable feedback min-max model predictive control 1
Robustly stable feedback min-max model predictive control 1 Eric C. Kerrigan 2 and Jan M. Maciejowski Department of Engineering, University of Cambridge Trumpington Street, Cambridge CB2 1PZ, United Kingdom
More informationROBUST STABLE NONLINEAR CONTROL AND DESIGN OF A CSTR IN A LARGE OPERATING RANGE. Johannes Gerhard, Martin Mönnigmann, Wolfgang Marquardt
ROBUST STABLE NONLINEAR CONTROL AND DESIGN OF A CSTR IN A LARGE OPERATING RANGE Johannes Gerhard, Martin Mönnigmann, Wolfgang Marquardt Lehrstuhl für Prozesstechnik, RWTH Aachen Turmstr. 46, D-5264 Aachen,
More informationarxiv: v1 [cs.sy] 30 Jul 2018
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1 Model predictive control of linear systems with preview information: feasibility, stability and inherent robustness P. R. Baldivieso Monasterios and P. A. Trodden,
More informationAn overview of distributed model predictive control (MPC)
An overview of distributed model predictive control (MPC) James B. Rawlings Department of Chemical and Biological Engineering August 28, 2011 IFAC Workshop: Hierarchical and Distributed Model Predictive
More informationAdaptive State Feedback Nash Strategies for Linear Quadratic Discrete-Time Games
Adaptive State Feedbac Nash Strategies for Linear Quadratic Discrete-Time Games Dan Shen and Jose B. Cruz, Jr. Intelligent Automation Inc., Rocville, MD 2858 USA (email: dshen@i-a-i.com). The Ohio State
More informationRegional Solution of Constrained LQ Optimal Control
Regional Solution of Constrained LQ Optimal Control José DeDoná September 2004 Outline 1 Recap on the Solution for N = 2 2 Regional Explicit Solution Comparison with the Maximal Output Admissible Set 3
More information1 Introduction 198; Dugard et al, 198; Dugard et al, 198) A delay matrix in such a lower triangular form is called an interactor matrix, and almost co
Multivariable Receding-Horizon Predictive Control for Adaptive Applications Tae-Woong Yoon and C M Chow y Department of Electrical Engineering, Korea University 1, -a, Anam-dong, Sungbu-u, Seoul 1-1, Korea
More informationNewton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions
260 Journal of Advances in Applied Mathematics, Vol. 1, No. 4, October 2016 https://dx.doi.org/10.22606/jaam.2016.14006 Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum
More informationReduced Order Internal Models in Robust Output Regulation
The final version of record is available at http://dx.doi.org/.9/tac.23.2257596 JOURNAL OF TRANSACTIONS ON AUTOMATIC CONTROL, VOL., NO., Reduced Order Internal Models in Robust Output Regulation Lassi
More information02. Measure and integral. 1. Borel-measurable functions and pointwise limits
(October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]
More informationIEEE copyright notice
IEEE copyright notice Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for
More informationResearch Article Mean Square Stability of Impulsive Stochastic Differential Systems
International Differential Equations Volume 011, Article ID 613695, 13 pages doi:10.1155/011/613695 Research Article Mean Square Stability of Impulsive Stochastic Differential Systems Shujie Yang, Bao
More informationROBUSTNESS OF PERFORMANCE AND STABILITY FOR MULTISTEP AND UPDATED MULTISTEP MPC SCHEMES. Lars Grüne and Vryan Gil Palma
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS Volume 35, Number 9, September 2015 doi:10.3934/dcds.2015.35.xx pp. X XX ROBUSTNESS OF PERFORMANCE AND STABILITY FOR MULTISTEP AND UPDATED MULTISTEP MPC SCHEMES
More informationAn asymptotic ratio characterization of input-to-state stability
1 An asymptotic ratio characterization of input-to-state stability Daniel Liberzon and Hyungbo Shim Abstract For continuous-time nonlinear systems with inputs, we introduce the notion of an asymptotic
More information