Conditions for Saddle-Point Equilibria in Output-Feedback MPC with MHE
|
|
- Garey McBride
- 6 years ago
- Views:
Transcription
1 Conditions for Sadde-Point Equiibria in Output-Feedback MPC with MHE David A. Copp and João P. Hespanha Abstract A new method for soving output-feedback mode predictive contro (MPC) and moving horizon estimation (MHE) probems simutaneousy as a singe minmax optimization probem was recenty proposed. This method aows for stabiity anaysis of the joint outputfeedback contro and estimation probem. In fact, under the main assumption that a sadde-point soution exists for the min-max optimization probem, the state is guaranteed to remain bounded. In this paper we derive sufficient conditions for the existence of a sadde-point soution to this min-max optimization probem. For the speciaized inearquadratic case, we show that a sadde-point soution exists if the system is observabe and weights in the cost function are chosen appropriatey. A numerica exampe is given to iustrate the effectiveness of this combined contro and estimation approach. I. INTRODUCTION Cassica MPC has been a prominent contro technique in academia and industria appications for decades because of its abiity to hande compex mutivariabe systems and hard constraints. MPC, which is cassicay formuated with state-feedback and invoves the repeated soution of an open-oop optima contro probem onine in order to find a sequence of future contro inputs, has a we-deveoped theory as evidenced by [1 3], and has been shown to be effective in practice [4]. However, with more efficient methods and continued theoretica work, more recent advances in MPC incude the incorporation of disturbances, uncertainties, faster dynamics, distributed systems, and output-feedback. Reated to these advances is the recent work combining noninear output-feedback MPC with MHE into a singe min-max optimization probem [5]. This combined approach simutaneousy soves an MHE probem, which invoves the repeated soution of a simiar optimization probem over a finite-horizon of past measurements in order to find an estimate of the current state [6, 7], and an MPC probem. In order to be robust to worst-case disturbances and noise, this approach invoves the soution of a min-max optimization where an objective function is minimized with respect D. A. Copp and J. P. Hespanha are with the Center for Contro, Dynamica Systems, and Computation, University of Caifornia, Santa Barbara, CA 9316 USA. dacopp@engr.ucsb.edu,hespanha@ece.ucsb.edu to contro input variabes and maximized with respect to disturbance and noise variabes, simiar to gametheoretic approaches to MPC considered in [8, 9]. The motivation for the combined MPC/MHE approach in [5] is proving joint stabiity of the combined estimation and contro probems, and, under some assumptions, the resuts guarantee boundedness of the state and bounds on the tracking error for trajectory tracking probems in the presence of noise and disturbances. The main assumption required for these resuts to hod is that there exists a sadde-point soution to the min-max optimization probem at every time step. The anaysis of the min-max probem that appears in the forward horizon of the combined MPC/MHE approach is cosey reated to the anaysis of two-payer zero-sum dynamic games as in [1] and to the dynamic game approach to H 8 optima contro as in [11]. In these anayses the contro is designed to guard against the worst-case unknown disturbances and mode uncertainties, and in both of these references, sadde-point equiibria and conditions under which they exist are anayzed. The probem proposed in [5] differs, however, in that a backwards finite horizon is aso considered in order to incorporate the simutaneous soution of an MHE probem, which aso aows the contro to be robust to worst-case estimates of the initia state. In this paper we derive conditions under which a sadde-point soution exists for the combined MPC/MHE min-max optimization probem proposed in [5] and speciaize those resuts for discrete-time inear timeinvariant systems and quadratic cost functions. We show that in the inear-quadratic case, if the system is observabe, simpy choosing appropriate weights in the cost function is enough to ensure that a sadde-point soution exists. Whie these resuts are for unconstrained probems, the weights in the cost function can be tuned to impose soft constraints on corresponding variabes, and a numerica exampe discussed at the end of the paper shows that, even for unconstrained inear-quadratic probems, faster reguation may be achieved using this MPC/MHE approach with a shorter finite horizon. The paper is organized as foows. In Section II, we formuate the contro probem under consideration
2 and discuss the main stabiity assumption regarding the existence of a sadde-point. In Section III, we describe a method that can be used to compute a sadde-point soution and give conditions under which this method succeeds. A numerica exampe is presented in Section IV. Finay, we provide some concusions and directions for future research in Section V. II. PROBLEM FORMULATION As in [5], we consider the contro of a time-varying discrete-time process of the form x t1 f t px t,u t,d t q, y t g t px t q n t P Z ě, with state x t taking vaues in a set X Ă R nx. The inputs to this system are the contro input u t that must be restricted to a set U Ă R nu, the unmeasured disturbance d t that is known to beong to a set D Ă R n d, and the measurement noise n t P R nn. The signa y t P Y Ă R ny denotes the measured output that is avaiabe for feedback. The contro objective is to seect the contro signa u t P P Z ě, so as to minimize a finite-horizon criterion of the form 1 J t px t L,u t L:,d t L:,y t L:t q k t c k px k,u k q q tt px tt q t η k pn k q ρ k pd k q (2) for worst-case vaues of the unmeasured disturbanced t P P Z ě and the measurement noise n t P R P Z ě. The functions c k p q, η k p q, and ρ k p q in (2) are a assumed to take non-negative vaues. The optimization criterion incudes T P Z ě1 terms of the running cost c t px t,u t q, which recede as the current time t advances, L 1 P Z ą1 terms of the measurement cost η t pn t q, and L T P Z ą1 terms of the cost on the disturbances ρ t pd t q. We aso incude a termina cost q tt px tt q to penaize the fina state at time t T. Just as in a two-payer zero-sum dynamic game, payer 1 (the controer) desires to minimize this criterion whie payer 2 (the noise and disturbance) woud ike to maximize it. This eads to a contro input that is designed for the worst-case disturbance input, measurement noise, and initia state. This motivates the foowing finite-dimensiona optimization 1 Given a discrete-time signa z : Z ě Ñ R n, and two times t,t P Z ě with t ď t, we denote by z t :t the sequence tz t,z t1,...,z tu. min û t:pu max ˆx t LPX,ˆd t L:tT 1PD J t pˆx t L,u t L:t 1,û t:, ˆd t L:,y t L:t q. (3) In this formuation, we use a contro aw of the form u t û ě, (4) where û t denotes the first eement of the sequence û t: computed at each time t that minimizes (3). For the impementation of the contro aw (4), the outer minimizations in (3) must ead to finite vaues for the optima that are achieved at specific sequences û t: P U, t P Z ě. However, for the stabiity resuts given in [5], we actuay ask for the existence of a sadde-point soution to the min-max optimization in (3) as foows, (as in [5, Assumption 1]): Assumption 1 (Sadde-point): The min-max optimization (3) with cost given as in (2) aways has a sadde-point soution for which the min and max commute. Specificay, for every time t P Z ě, past contro input sequence u t L:t 1 P U, and past measured output sequence y t L:t P Y, there exists a finite scaar J t pu t L:t 1,y t L:t q P R, an initia condition ˆx t L P X, and sequences û t: P U, ˆd t L: P D such that J t pu t L:t 1,y t L:t q J t pˆx t L,u t L:t 1,û t:, ˆd t L:,y t L:tq max ˆx t LPX,ˆd t L:PD J t pˆx t L,u t L:t 1,û t:, ˆd t L:,y t L:t q (5a) min û t:pu J t pˆx t L,u t L:t 1,û t:, ˆd t L:,y t L:t q (5b) ă 8. In the next section we derive conditions under which a sadde-point soution exists for the genera noninear case and then speciaize those resuts for discrete-time inear time-invariant systems and quadratic cost functions. III. MAIN RESULTS Before presenting the main resuts, for convenience we define the foowing sets of time sequences for the forward and backward horizons, respectivey, T tt,t1,...,u andl tt L,t L1,...,t 1u and use them in the seque. 2
3 A. Noninear systems Theorem 1: (Existence of sadde-point) Suppose there exist recursivey computed functions V k p q, for a k P T, and V j p q, for a j P L, such that for a y t L:t P Y, and u t L:t 1 P U, V tt px tt q q tt px tt q, (6a) V k px k q min max k px k,û k, ˆd k q V k1 px k1 q û k PU ˆd k PD max min k px k,û k, ˆd k q V k1 px k1 q, ˆd k PD û k P T zt, (6b) V t px t,y t q min max t px t,û t, ˆd t,y t qv t1 px t1 q û tpu ˆd tpd maxmin t px t,û t, ˆd t,y t q V t1 px t1 q, (6c) ˆd tpd û tpu V j px j,u j:t 1,y j:t q max j px j,u j, ˆd j,y j q ˆd jpd V j1 px j1,u j1:t 1,y j1:t P Lzt L, (6d) V t L pu t L:t 1,y t L:t q max ˆx t LPX,ˆd t LPD t L pˆx t L,u t L, ˆd t L,y t L q where V t L1 px t L1,u t L1:t 1,y t L1:t q, (6e) k px k,û k, ˆd k q c k px k,û k q ρ k pˆd k q,k P T zt, (7a) t px t,û t, ˆd t,y t q c t px t,û t q η t pn t q ρ t pˆd t q, (7b) j px j,u j, ˆd j,y j q η j pn j q ρ j pˆd j q, j P L. (7c) Then the soutions û k, ˆd k, ˆd j, and ˆx t L defined as foows, for a k P T and j P L, satisfy the saddepoint Assumption 1. û k arg minmax k px k,û k, ˆd k,y k q V k1 px k1 q, û k PU ˆd k PD (8a) ˆd k ˆd j ˆx t L arg max ˆd k PD min k px k,û k, ˆd k,y k q V k1 px k1 q, û k PU arg max j px j,u j, ˆd j,y j q ˆd jpd (8b) V j1 px j1,u j1:t 1,y j1:t q, (8c) arg max t L pˆx t L,u t L, ˆd t L,y t L q ˆx t LPX V t L1 px t L1,u t L1:t 1,y t L1:t q. (8d) Moreover, the sadde-point vaue is equa to J t pu t L:t 1,y t L:t q V t L pu t L:t 1,y t L:t q. Proof. We begin by proving equation (5b) in Assumption 1. Let û k be defined as in (8a), and etû k be another arbitrary contro input. To prove optimaity, we need to show that the atter trajectory cannot ead to a cost ower than the former. Since V k px k q satisfies (6b) and achieves the minimum in (6b), for every k P T zt, û k V k px k q min û k PU k px k,û k, ˆd k q V k1px k1 q k px k,û k, ˆd k q V k1px k1 q. (9) However, since û k does not necessariy achieve the minimum, we have that V k px k q min k px k,û k, ˆd k q V k1px k1 q û k PU ď k px k,û k, ˆd k q V k1px k1 q. (1) Summing both sides of (9) from k t 1 to k t T 1, we concude that V k px k q k px k,û k, ˆd k q ðñ V t1 px t1 q V k1 px k1 q k px k,û k, ˆd k q. Next, summing both sides of (1) from k t 1 to k t T 1, we concude that V k px k q ď k px k,û k, ˆd k q ðñ V t1 px t1 q ď from which we concude that V t1 px t1 q k px k,û k, ˆd k q ď V k1 px k1 q k px k,û k, ˆd k q, k px k,û k,d k q. (11) Simiary, since V t px t,y t q satisfies (6c) and û t achieves the minimum in (6c), we can concude that 3
4 V t px t,y t q t px t,û t, ˆd t,y t q V t1 px t1 q ď t px t,û t, ˆd t,y tq V t1 px t1 q. (12) Then from (11) and (12), we concude that tt V t px t,y t q t px t,û t, ˆd t,y 1 tq k px k,û k, ˆd k q tt ď t px t,û t, ˆd t,y 1 tq k px k,û k,d k q. (13) Next, since V j px j,u j:t 1,y j:t q satisfies (6d) and achieves the maximum in (6d), we can concude that V j px j,u j:t 1,y j:t q j px j,u j, ˆd j,y jq V j1 px j1,u j:t 1,y j:t q. (14) Summing both sides of (14) from j t L 1 to j t 1, and using (13), we concude that V j px j,u j:t 1,y j:t q V j1 px j1,u j:t 1,y j:t q ˆd j j px j,u j, ˆd j,y jq ðñ V t L1 px t L1,u t L1:t 1,y t L1:t q j px j,u j, ˆd j,y j q t px t,û t, ˆd t,y t q t 1 k px k,û k, ˆd k q ď j px j,u j, ˆd j,y jq tt t px t,û t, ˆd t,y 1 tq k px k,û k, ˆd k q. Finay, from this and the facts that V t L pu t L:t 1,y t L:t q satisfies (6e) and ˆd t L and ˆx t L achieve the maximum in (6e), we can concude that V t L pu t L:t 1,y t L:t q t L pˆx t L,u t L, ˆd t L,y t Lq V t L1 px t L1,u t L1:t 1,y t L1:t q k px k,û k, ˆd k q tpx t,û t, ˆd t,y t q j px j,u j, ˆd j,y j q t L pˆx t L,u t L, ˆd t L,y t L q ď k px k,û k, ˆd k q t px t,û t, ˆd t,y tq j px j,u j, ˆd j,y jq t L pˆx t L,u t L, ˆd t L,y t L q. Therefore û k is a minimizing poicy, for a k P T, and (5b) is satisfied with J t pu t L:t 1,y t L:t q V t L pu t L:t 1,y t L:t q. To prove (5a), et ˆd k be defined as in (8b), ˆd j be defined as in (8c), and et ˆd k and ˆd j be other arbitrary disturbance inputs. Simiary, et ˆx t L be defined as in (8d), and et ˆx t L be another arbitrary initia condition. Then, since V k px k q satisfies (6b), V t px t,y t q satisfies (6c), V j px j,u j:t 1,y j:t q satisfies (6d), and ˆd k achieves the maximum in (6b), ˆd t achieves the maximum in (6c), and ˆd j achieves the maximum in (6d), we can use a simiar argument as in the proof of (5b) to concude that V t L1 px t L1,u t L1:t 1,y t L1:t q j px j,u j, ˆd j,y jq t px t,û t, ˆd t,y tq t 1 k px k,û k, ˆd k q ě j px j,u j, ˆd j,y j q t px t,û t, ˆd t,y t q k px k,û k, ˆd k q. Finay, (5a) foows from this, (6e), (8c), (8d), and simiar arguments as used before (further detais of which can be found in [12]), which ead to V t L pu t L:t 1,y t L:t q t L pˆx t L,u t L, ˆd t L,y t L q j t L V t L1 px t L1,u t L1:t 1,y t L1:t q ě k px k,û k, ˆd k q tpx t,û t, ˆd t,y t q j px j,u j, ˆd j,y jq t L pˆx t L,u t L, ˆd t L,y t Lq k px k,û k, ˆd k q t px t,û t, ˆd t,y t q j px j,u j, ˆd j,y j q t L pˆx t L,u t L, ˆd t L,y t L q. Therefore ˆd k, for a k P T, and ˆd j, for a j P L, are maximizing poicies, ˆx t L is a maximizing poicy, and (5b) is satisfied with J t pu t L:t 1,y t L:t q V t L pu t L:t 1,y t L:t q. 4
5 Thus, Assumption 1 is satisfied. Next we speciaize these resuts for inear timeinvariant (LTI) systems and quadratic cost functions. B. LTI systems and quadratic costs Consider the foowing discrete inear time-invariant system, for a t P Z ě, x t1 Ax t Bu t Dd t, y t Cx t n t, (15) with x t P X R nx, u t P U R nu, d t P D R n d, n t P N R nn, and y t P Y R ny. Aso consider the quadratic cost function J t px t L,u t L:,d t L:,y t L:t q t k t x1 k Qx k λ u u 1 k u k x 1 tt Qx tt λ n py k Cx k q 1 py k Cx k q λ d d 1 kd k (16) where Q Q 1 ě is a weighting matrix, and λ u, λ d, λ n are positive constants that can be tuned to impose soft constraints on the variabes x k, u k, d k, and n k, respectivey. Again, the contro objective is to sove for a contro inputu t that minimizes the criterion (16) in the presence of the worst-case disturbance d t and initia state x t L. This motivates soving the optimization probem (3) with the cost given as in (16) subject to the dynamics given in (15). Then the contro input as defined in (4) is seected and appied to the pant. The foowing Theorem gives conditions under which a sadde-point soution exists for probem (3) with cost (16), thereby satisfying Assumption 1, as we as a description of the resuting sadde-point soution. Theorem 2: (Existence of sadde-point for inear systems with quadratic costs) LetM k andλ k, for a k P T, and P j and Z j, for a j P L, be matrices of appropriate dimensions defined by 2 M k Q A 1 M Λ 1 k1 k A; M tt Q, (17a) 1 Λ k I BB DD M k1, (17b) λ u λ d P j A 1 P j1 A A 1 P DZ 1 j1 j D 1 P j1 A λ n C 1 C; P t M t λ n C 1 C, (17c) Z j λ d I D 1 P j1 D. Then, if the foowing conditions are satisfied, λ u I B 1 M k1 B ą, 2 I denotes the identity matrix with appropriate dimensions. (17d) (18a) λ d I D 1 M k1 D ą, (18b) λ d I D 1 P j1 D ą, (18c) j λn C 1 C A 1 P t L1 A A 1 P t L1 D D 1 P t L1 A λ d I D 1 ą, P t L1 D (18d) the min-max optimization (3) with quadratic costs (16) subject to the inear dynamics (15) admits a unique sadde-point soution that satisfies Assumption 1. Proof. Conditions (18) come directy from the secondorder conditions for strict-convexity/concavity of a quadratic function. If conditions (18) are satisfied, the optimizations in (6) with quadratic costs coming from (16) are stricty convex with respect to û k, for a k P T, stricty concave with respect to ˆd k and ˆd j, for a k P T and j P L, and stricty concave with respect to rˆx 1 ˆd t L 1 t L s1. Therefore, soutions as in (8) exist. Thus, a sadde point soution exists because of Theorem 1. In this inear-quadratic case, the functions (6) can be soved for expicity, and anaytica soutions exist for (8). These soutions and further detais of this proof can be found in [12]. Coroary 1: If the discrete-time inear time-invariant system given in (15) is observabe, then the scaar weights λ n and λ d can be chosen sufficienty arge such that the conditions (18a)-(18d) are satisfied. Therefore, according to Theorem 2, there exists a sadde-point soution for the optimization probem (3) with cost (16). Therefore, aso, Assumption 1 is satisfied. Proof. Condition (18a) is triviay satisfied for a k P T as ong as we choose λ u ą and weighting matrix Q ě because Q ě ùñ M k P T. 3 Condition (18b) is satisfied if the scaar weight λ d is chosen sufficienty arge. To show this, we take the imit of the sequence of matrices M k, as given in (17a), as λ d Ñ 8 and notice that M k Ñ M k, where M k is described by M k Q A 1 p M k1 ri 1 λ u BB 1 Mk1 s 1 qa; M tt M tt, for a k P T. Then, in the imit as λ d Ñ 8, condition (18b) becomes 8I D 1 Mk1 D ą, and therefore, condition (18b) is satisfied when λ d is chosen sufficienty arge. Next we prove that conditions (18c) and (18d) are satisfied, for a j P L, when λ n and λ d are chosen sufficienty arge and the system (15) is observabe. We 3 Note that M k M 1 k due to the fact that Q Q1 and the matrix identity in [13] which says that ApI BAq 1 pi ABq 1 A. 5
6 first take the imit of the sequence of matrices P j, as given in (17c), as λ d Ñ 8 and notice that P j Ñ P j where P j is described by P j λ n Θ 1 jθ j A 1 t j Mt A t j, for a j P L Yt, and Θ j is defined as Θ j rc 1 A 1 C 1 A 12 C 1... A 1 t j C 1 s 1. The matrix Θ j ooks simiar to the observabiity matrix, and therefore, Θ 1 j Θ j ą if the system given in (15) is observabe. Then, the scaar weight λ n can be chosen arge enough to ensure that λ n Θ 1 j Θ j ą A 1 t j Mt A t j, for a j P L. It then foows that Pj ă for a j P L. Therefore, condition (18c) becomesλ d I D 1 Pj1 D ą in the imit as λ d Ñ 8 and is triviay satisfied if system (15) is observabe and λ n is chosen sufficienty arge. Finay, consider condition (18d). Using the Schur Compement, condition (18d) is satisfied if, and ony if, λ d I D 1 P t L1 D ą and λ n C 1 C A 1 P t L1 A A 1 P t L1 Dpλ d I D 1 P t L1 Dq 1 D 1 P t L1 A ą. We just proved that λ d I D 1 P t L1 D ą if the system (15) is observabe and the weights λ d and λ n are chosen sufficienty arge. Now we show that the second inequaity is satisfied under these same conditions. In the imit as λ d Ñ 8, the second inequaity becomes λ n C 1 C A 1 Pt L1 A ą. Then, if the system (15) is observabe,λ n can be chosen sufficienty arge such that this inequaity is satisfied, and therefore, condition (18d) is satisfied. IV. SIMULATION Intuition says that for unconstrained inear-quadratic probems, the best soution can be found by soving an infinite-horizon optimization probem. However, there are cases where a finite-horizon approach may be beneficia. Specificay, faster reguation can be achieved for the foowing unconstrained inear-quadratic exampe, where the system is subjected to impusive disturbances, using the combined MPC/MHE approach with a shorter finite-horizon. This motivates using the combined MPC/MHE finite-horizon approach over other standard infinite-horizon contro techniques for particuar types of inear-quadratic probems. Exampe 1: (Stabiizing a rideress bicyce.) Consider the foowing second order continuous-time inearized bicyce mode in state-space form: 9x t Ax t Bpu t d t q, y t Cx t n t (19) The state is given by x t φ δ φ 9 δ 9 1 where φ is the ro ange of the bicyce, δ is the steering ange of the handebars, and φ 9 and δ 9 are the corresponding anguar veocities. The contro input u t is the steering torque appied to the handebars. The matrices defining the inearized dynamics are given, as described in [14], as» fi 1 1 ffi A v 2.164v.552vf, v v 2.388v» fi ffi B f, C j 1 1, where v is the bicyce s forward veocity on which the dynamics depend. Ony the ro ange and steering ange (and not their corresponding anguar veocities) are measured and avaiabe for feedback. As noted in [14], the bicyce dynamics are sefstabiizing for veocities between 3.4m{s and 4.1m{s. For our exampe, we fix the forward veocity at 2m{s; therefore, the system is unstabe. The contro objective is to stabiize the bicyce in the upright position, i.e. around a zero ro ange (φ ), by appying a steering torque to the handebars. The disturbance d t acts on the input and can be thought of as sharp bumps in the bicyce s path or simiar environmenta perturbations. Simuation resuts for two simuations of the system (19) discretized using a.1 second zero-order-hod are shown in Figures 1 and 2, respectivey. The optimization given in (3) with cost (16) was soved at each time t, and the resuting û t was appied as the contro input. The same parameters, besides the ength of the backwards horizon L, were used for both simuations. These parameters were chosen as λ u.1, λ d 1, λ n 1,T 2, andqwas chosen as a 4x4 matrix with the eement in upper eft corner equa to one and a other eements equa to zero. The measurement noise was generated as a random variabe n t N p,.1 2 q. The disturbance d t was impusive and is shown in the bottom pots of Figures 1 and 2 denoted by o s. The simuations were initiaized with zero input, and with the initia state x 1. With the same impusive disturbances, better performance is achieved when appying the contro input computed using a shorter backwards horizon ength of L 2, as shown in Figure 2, than when using a onger horizon ength of L 2, as shown in Figure 1. The contro input computed using the shorter backwards horizon ength L 2 is abe to more quicky reguate the ro ange φ back to zero without requiring 6
7 φ, δ [deg] u, d [Nm] φ, δ [deg] u, d [Nm] φ δ u d Fig. 1. Longer backwards horizon (L 2) φ δ u d Fig. 2. Shorter backwards horizon (L 2). contro inputs that are arger in magnitude than those computed using L 2. This is possibe because a short backwards finite horizon L aows the combined contro and estimation scheme to, in a sense, forget the irreguar impusive disturbances so that they do not ead to skewed estimates and more conservative contro. Therefore, it may be beneficia to use the combined MPC/MHE approach for unconstrained inear-quadratic probems when certain system characteristics, such as impusive disturbances, are present. V. CONCLUSION AND FUTURE WORK We discussed the main assumption of a new approach to soving MPC and MHE probems simutaneousy as a singe min-max optimization probem as proposed in [5]. This assumption is that a sadde-point soution exists for the resuting min-max optimization probem. First we gave conditions for the existence of a saddepoint soution when considering a genera discrete-time noninear system and a genera cost function. Next we speciaized those resuts for discrete-time inear timeinvariant systems and quadratic cost functions. For this case, we showed that observabiity of the inear system and arge weights λ d and λ n in the cost function are sufficient conditions for a sadde-point soution to exist. We showed the effectiveness of this contro approach in a numerica exampe of a inearized rideress bicyce system subjected to impusive disturbances. The simuation showed that, for this exampe, performance can be improved if a shorter backwards optimization horizon L is used. Future work may invove reaxing the requirement of a sadde-point soution to that of beingε-cose to a saddepoint soution. This coud be reated to resuts for ε-nash equiibria. REFERENCES [1] M. Morari and J. H Lee, Mode predictive contro: past, present and future, Computers & Chemica Engineering, vo. 23, no. 4, pp , [2] D. Q. Mayne, J. B. Rawings, C. V. Rao, and P. O. Scokaert, Constrained mode predictive contro: Stabiity and optimaity, Automatica, vo. 36, no. 6, pp , 2. [3] J. B. Rawings and D. Q. Mayne, Mode Predictive Contro: Theory and Design. Nob Hi Pubishing, 29. [4] S. J. Qin and T. A. Badgwe, A survey of industria mode predictive contro technoogy, Contro engineering practice, vo. 11, no. 7, pp , 23. [5] D. A. Copp and J. P. Hespanha, Noninear output-feedback mode predictive contro with moving horizon estimation, in Proc. of the 53nd Conf. on Decision and Contr., Dec [6] C. V. Rao, J. B. Rawings, and D. Q. Mayne, Constrained state estimation for noninear discrete-time systems: Stabiity and moving horizon approximations, Automatic Contro, IEEE Transactions on, vo. 48, no. 2, pp , 23. [7] A. Aessandri, M. Bagietto, and G. Battistei, Moving-horizon state estimation for noninear discrete-time systems: New stabiity resuts and approximation schemes, Automatica, vo. 44, no. 7, pp , 28. [8] H. Chen, C. Scherer, and F. Agöwer, A game theoretic approach to noninear robust receding horizon contro of constrained systems, in American Contro Conference, Proceedings of the 1997, vo. 5, pp , IEEE, [9] S. La and K. Gover, A game theoretic approach to moving horizon contro, in Advances in Mode-Based Predictive Contro, Oxford University Press, [1] T. Başar and G. J. Osder, Dynamic Noncooperative Game Theory. London: Academic Press, [11] T. Başar and P. Bernhard, H-infinity optima contro and reated minimax design probems: a dynamic game approach. Springer, 28. [12] D. A. Copp and J. P. Hespanha, Conditions for sadde-point equiibria in output-feedback MPC with MHE: Technica report, tech. rep., University of Caifornia, Santa Barbara, 215. [13] S. R. Seare, Matrix Agebra Usefu for Statistics. John Wiey and Sons, [14] V. Cerone, D. Andreo, M. Larsson, and D. Regruto, Stabiization of a rideress bicyce [appications of contro], Contro Systems, IEEE, vo. 3, no. 5, pp , 21. 7
Nonlinear Output-Feedback Model Predictive Control with Moving Horizon Estimation
Noninear Output-Feedback Mode Predictive Contro with Moving Horizon Estimation David A. Copp and João P. Hespanha Abstract We introduce an output-feedback approach to mode predictive contro that combines
More informationAnalysis of Emerson s Multiple Model Interpolation Estimation Algorithms: The MIMO Case
Technica Report PC-04-00 Anaysis of Emerson s Mutipe Mode Interpoation Estimation Agorithms: The MIMO Case João P. Hespanha Dae E. Seborg University of Caifornia, Santa Barbara February 0, 004 Anaysis
More informationInput-to-state stability for a class of Lurie systems
Automatica 38 (2002) 945 949 www.esevier.com/ocate/automatica Brief Paper Input-to-state stabiity for a cass of Lurie systems Murat Arcak a;, Andrew Tee b a Department of Eectrica, Computer and Systems
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationDISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE
DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE Yury Iyushin and Anton Mokeev Saint-Petersburg Mining University, Vasiievsky Isand, 1 st ine, Saint-Petersburg,
More informationSTABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM 1. INTRODUCTION
Journa of Sound and Vibration (996) 98(5), 643 65 STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM G. ERDOS AND T. SINGH Department of Mechanica and Aerospace Engineering, SUNY at Buffao,
More informationAvailable online at ScienceDirect. IFAC PapersOnLine 50-1 (2017)
Avaiabe onine at www.sciencedirect.com ScienceDirect IFAC PapersOnLine 50-1 (2017 3412 3417 Stabiization of discrete-time switched inear systems: Lyapunov-Metzer inequaities versus S-procedure characterizations
More informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationDIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM
DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing
More informationNOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS
NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs
More informationLECTURE 10. The world of pendula
LECTURE 0 The word of pendua For the next few ectures we are going to ook at the word of the pane penduum (Figure 0.). In a previous probem set we showed that we coud use the Euer- Lagrange method to derive
More informationFirst-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries
c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationMaximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR
1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,
More informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More information4 Separation of Variables
4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE
More informationSymbolic models for nonlinear control systems using approximate bisimulation
Symboic modes for noninear contro systems using approximate bisimuation Giordano Poa, Antoine Girard and Pauo Tabuada Abstract Contro systems are usuay modeed by differentia equations describing how physica
More informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More information6 Wave Equation on an Interval: Separation of Variables
6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.
More informationSE-514 (OPTIMAL CONTROL) OPTIMAL CONTROL FOR SINGLE AND DOUBLE INVERTED PENDULUM. DONE BY: Fatai Olalekan ( Ayman Abdallah (973610)
SE-54 (OPTIAL CONTROL OPTIAL CONTROL FOR SINGLE AND DOUBLE INVERTED PENDULU DONE BY: Fatai Oaekan (363 Ayman Abdaah (9736 PREPARED FOR: Dr. Sami E-Ferik Tabe of contents Abstract... 3 Introduction... 3
More informationSteepest Descent Adaptation of Min-Max Fuzzy If-Then Rules 1
Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rues 1 R.J. Marks II, S. Oh, P. Arabshahi Λ, T.P. Caude, J.J. Choi, B.G. Song Λ Λ Dept. of Eectrica Engineering Boeing Computer Services University
More informationA SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS
A SIPLIFIED DESIGN OF ULTIDIENSIONAL TRANSFER FUNCTION ODELS Stefan Petrausch, Rudof Rabenstein utimedia Communications and Signa Procesg, University of Erangen-Nuremberg, Cauerstr. 7, 958 Erangen, GERANY
More informationMATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES
MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is
More informationMath 124B January 31, 2012
Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat
More informationDisturbance decoupling by measurement feedback
Preprints of the 19th Word Congress The Internationa Federation of Automatic Contro Disturbance decouping by measurement feedback Arvo Kadmäe, Üe Kotta Institute of Cybernetics at TUT, Akadeemia tee 21,
More informationIntuitionistic Fuzzy Optimization Technique for Nash Equilibrium Solution of Multi-objective Bi-Matrix Games
Journa of Uncertain Systems Vo.5, No.4, pp.27-285, 20 Onine at: www.jus.org.u Intuitionistic Fuzzy Optimization Technique for Nash Equiibrium Soution of Muti-objective Bi-Matri Games Prasun Kumar Naya,,
More informationNonlinear Analysis of Spatial Trusses
Noninear Anaysis of Spatia Trusses João Barrigó October 14 Abstract The present work addresses the noninear behavior of space trusses A formuation for geometrica noninear anaysis is presented, which incudes
More informationCombining reaction kinetics to the multi-phase Gibbs energy calculation
7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation
More informationObservability of linear systems under adversarial attacks*
Observabiity of inear systems under adversaria attacks* Michee S. Chong 1, Masashi Wakaiki 1 and João P. Hespanha 1 Abstract We address the probem of state estimation for muti-output continuous-time inear
More informationStatistical Learning Theory: A Primer
Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationCryptanalysis of PKP: A New Approach
Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in
More informationIndirect Optimal Control of Dynamical Systems
Computationa Mathematics and Mathematica Physics, Vo. 44, No. 3, 24, pp. 48 439. Transated from Zhurna Vychisite noi Matematiki i Matematicheskoi Fiziki, Vo. 44, No. 3, 24, pp. 444 466. Origina Russian
More informationNon-linear robust control for inverted-pendulum 2D walking
Non-inear robust contro for inverted-penduum 2D waking Matthew Key and Andy Ruina 2 Abstract We present an approach to high-eve contro for bipeda waking exempified with a 2D point-mass inextensibeegs inverted-penduum
More informationSome Measures for Asymmetry of Distributions
Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester
More informationIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University
More informationu(x) s.t. px w x 0 Denote the solution to this problem by ˆx(p, x). In order to obtain ˆx we may simply solve the standard problem max x 0
Bocconi University PhD in Economics - Microeconomics I Prof M Messner Probem Set 4 - Soution Probem : If an individua has an endowment instead of a monetary income his weath depends on price eves In particuar,
More informationSeparation of Variables and a Spherical Shell with Surface Charge
Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation
More informationStatistical Inference, Econometric Analysis and Matrix Algebra
Statistica Inference, Econometric Anaysis and Matrix Agebra Bernhard Schipp Water Krämer Editors Statistica Inference, Econometric Anaysis and Matrix Agebra Festschrift in Honour of Götz Trenker Physica-Verag
More informationA Statistical Framework for Real-time Event Detection in Power Systems
1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem
More informationRadar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance
adar/ racing of Constant Veocity arget : Comparison of Batch (LE) and EKF Performance I. Leibowicz homson-csf Deteis/IISA La cef de Saint-Pierre 1 Bd Jean ouin 7885 Eancourt Cede France Isabee.Leibowicz
More informationTime-Inconsistent Mean-Field Stochastic Linear-Quadratic Optimal Control
Time-Inconsistent Mean-Fied Stochastic Linear-Quadratic Optima Contro I Yuan-Hua 1 1. Department of Mathematics Schoo of Sciences Tianjin Poytechnic University Tianjin P. R. China E-mai: yhni@amss.ac.cn
More informationTracking Control of Multiple Mobile Robots
Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart
More informationA Solution to the 4-bit Parity Problem with a Single Quaternary Neuron
Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria
More informationReliability: Theory & Applications No.3, September 2006
REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate
More informationThroughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay
Throughput Optima Scheduing for Wireess Downinks with Reconfiguration Deay Vineeth Baa Sukumaran vineethbs@gmai.com Department of Avionics Indian Institute of Space Science and Technoogy. Abstract We consider
More informationComponentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems
Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,
More informationC. Fourier Sine Series Overview
12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a
More informationAdjustment of automatic control systems of production facilities at coal processing plants using multivariant physico- mathematical models
IO Conference Series: Earth and Environmenta Science AER OEN ACCESS Adjustment of automatic contro systems of production faciities at coa processing pants using mutivariant physico- mathematica modes To
More informationAlgorithms to solve massively under-defined systems of multivariate quadratic equations
Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations
More informationT.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA
ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network
More informationA unified framework for design and analysis of networked and quantized control systems
1 A unified framework for design and anaysis of networked and quantized contro systems Dragan ešić and Danie Liberzon Abstract We generaize and unify a range of recent resuts in quantized contro systems
More informationSequential Decoding of Polar Codes with Arbitrary Binary Kernel
Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient
More informationA Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)
A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,
More informationACTIVE electrical networks, which require energizing sources for their operation, are most widely
1 Stabiization heory For Active Muti-port Networks Mayuresh Bakshi Member, IEEE,, Virendra R Sue and Maryam Shoejai Baghini, Senior Member, IEEE, arxiv:1606.03194v1 [cs.sy] 10 Jun 2016 Abstract his paper
More informationNumerical solution of one dimensional contaminant transport equation with variable coefficient (temporal) by using Haar wavelet
Goba Journa of Pure and Appied Mathematics. ISSN 973-1768 Voume 1, Number (16), pp. 183-19 Research India Pubications http://www.ripubication.com Numerica soution of one dimensiona contaminant transport
More informationAkaike Information Criterion for ANOVA Model with a Simple Order Restriction
Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike
More informationHomework #04 Answers and Hints (MATH4052 Partial Differential Equations)
Homework #4 Answers and Hints (MATH452 Partia Differentia Equations) Probem 1 (Page 89, Q2) Consider a meta rod ( < x < ), insuated aong its sides but not at its ends, which is initiay at temperature =
More informationIntegrating Factor Methods as Exponential Integrators
Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been
More informationAppendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model
Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this
More informationSEMINAR 2. PENDULUMS. V = mgl cos θ. (2) L = T V = 1 2 ml2 θ2 + mgl cos θ, (3) d dt ml2 θ2 + mgl sin θ = 0, (4) θ + g l
Probem 7. Simpe Penduum SEMINAR. PENDULUMS A simpe penduum means a mass m suspended by a string weightess rigid rod of ength so that it can swing in a pane. The y-axis is directed down, x-axis is directed
More informationLECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October 7, 202 Prof. Aan Guth LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL
More informationc 2007 Society for Industrial and Applied Mathematics
SIAM REVIEW Vo. 49,No. 1,pp. 111 1 c 7 Society for Industria and Appied Mathematics Domino Waves C. J. Efthimiou M. D. Johnson Abstract. Motivated by a proposa of Daykin [Probem 71-19*, SIAM Rev., 13 (1971),
More informationControl with Minimum Communication Cost per Symbol
Contro with Minimum Communication Cost per ymbo Justin Pearson, João P. Hespanha, Danie Liberzon Abstract We address the probem of stabiizing a continuous-time inear time-invariant process under communication
More information8 Digifl'.11 Cth:uits and devices
8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,
More informationGauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law
Gauss Law 1. Review on 1) Couomb s Law (charge and force) 2) Eectric Fied (fied and force) 2. Gauss s Law: connects charge and fied 3. Appications of Gauss s Law Couomb s Law and Eectric Fied Couomb s
More informationOn norm equivalence between the displacement and velocity vectors for free linear dynamical systems
Kohaupt Cogent Mathematics (5 : 95699 http://dxdoiorg/8/33835595699 COMPUTATIONAL SCIENCE RESEARCH ARTICLE On norm equivaence between the dispacement and veocity vectors for free inear dynamica systems
More informationInternational Journal of Mass Spectrometry
Internationa Journa of Mass Spectrometry 280 (2009) 179 183 Contents ists avaiabe at ScienceDirect Internationa Journa of Mass Spectrometry journa homepage: www.esevier.com/ocate/ijms Stark mixing by ion-rydberg
More informationAsymptotic Properties of a Generalized Cross Entropy Optimization Algorithm
1 Asymptotic Properties of a Generaized Cross Entropy Optimization Agorithm Zijun Wu, Michae Koonko, Institute for Appied Stochastics and Operations Research, Caustha Technica University Abstract The discrete
More informationIdentification of macro and micro parameters in solidification model
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vo. 55, No. 1, 27 Identification of macro and micro parameters in soidification mode B. MOCHNACKI 1 and E. MAJCHRZAK 2,1 1 Czestochowa University
More informationConservation of Circulations in Turbulent Flow
(D) Conservation of Circuations in Turbuent Fow We have emphasized the importance of deveoping a better understanding of the dynamica & statistica origin of the positivity of vortex-stretching rate ω S
More informationAn explicit Jordan Decomposition of Companion matrices
An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057
More informationPosition Control of Rolling Skateboard
osition Contro of Roing kateboard Baazs Varszegi enes Takacs Gabor tepan epartment of Appied Mechanics, Budapest University of Technoogy and Economics, Budapest, Hungary (e-mai: varszegi@mm.bme.hu) MTA-BME
More informationOn a geometrical approach in contact mechanics
Institut für Mechanik On a geometrica approach in contact mechanics Aexander Konyukhov, Kar Schweizerhof Universität Karsruhe, Institut für Mechanik Institut für Mechanik Kaiserstr. 12, Geb. 20.30 76128
More informationPublished in: Proceedings of the Twenty Second Nordic Seminar on Computational Mechanics
Aaborg Universitet An Efficient Formuation of the Easto-pastic Constitutive Matrix on Yied Surface Corners Causen, Johan Christian; Andersen, Lars Vabbersgaard; Damkide, Lars Pubished in: Proceedings of
More informationarxiv: v1 [math.oc] 21 Sep 2018
Differentia Dynamic Programming for Noninear Dynamic Games Boei Di and Andrew Lampersi arxiv:8090830v mathoc Sep 08 Abstract Dynamic games arise when mutipe agents with differing objectives choose contro
More informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationMelodic contour estimation with B-spline models using a MDL criterion
Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex
More informationMethods for Ordinary Differential Equations. Jacob White
Introduction to Simuation - Lecture 12 for Ordinary Differentia Equations Jacob White Thanks to Deepak Ramaswamy, Jaime Peraire, Micha Rewienski, and Karen Veroy Outine Initia Vaue probem exampes Signa
More informationMode in Output Participation Factors for Linear Systems
2010 American ontro onference Marriott Waterfront, Batimore, MD, USA June 30-Juy 02, 2010 WeB05.5 Mode in Output Participation Factors for Linear Systems Li Sheng, yad H. Abed, Munther A. Hassouneh, Huizhong
More informationTitle Sinusoidal Signals. Author(s) Sakai, Hideaki; Fukuzono, Hayato. Conference: Issue Date DOI
Tite Anaysis of Adaptive Fiters in Fee Sinusoida Signas Authors) Sakai, Hideaki; Fukuzono, Hayato Proceedings : APSIPA ASC 2009 : Asi Citation Information Processing Association, Conference: 430-433 Issue
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationarxiv: v1 [cs.sy] 31 May 2014
Cooperative Contro of Linear Muti-Agent Systems via Distributed Output Reguation and Transient Synchronization Georg S. Seyboth, Wei Ren, Fran Agöwer arxiv:46.85v cs.sy 3 May 24 Abstract A wide range of
More informationTarget Location Estimation in Wireless Sensor Networks Using Binary Data
Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO. 2, FEBRUARY 206 857 Optima Energy and Data Routing in Networks With Energy Cooperation Berk Gurakan, Student Member, IEEE, OmurOze,Member, IEEE,
More information(f) is called a nearly holomorphic modular form of weight k + 2r as in [5].
PRODUCTS OF NEARLY HOLOMORPHIC EIGENFORMS JEFFREY BEYERL, KEVIN JAMES, CATHERINE TRENTACOSTE, AND HUI XUE Abstract. We prove that the product of two neary hoomorphic Hece eigenforms is again a Hece eigenform
More informationStochastic Variational Inference with Gradient Linearization
Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,
More informationMultiple Loop Self-Triggered Model Predictive Control for Network Scheduling and Control
Mutipe Loop Sef-Triggered Mode Predictive Contro for Networ Scheduing and Contro Eri Henrisson, Danie E. Quevedo, Edwin G.W. Peters, Henri Sandberg, Kar Henri Johansson arxiv:5.38v [cs.sy] Feb 5 Abstract
More informationEconomic model predictive control without terminal constraintsforoptimalperiodicbehavior
Economic mode predictive contro without termina constraintsforoptimaperiodicbehavior MatthiasA.Müer a LarsGrüne b a Institute for Systems Theory and Automatic Contro, University of Stuttgart, 70550 Stuttgart,
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More information$, (2.1) n="# #. (2.2)
Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier
More informationModel Predictive Control of Interconnected Linear and Nonlinear Processes
Ind. Eng. Chem. Res. 2002, 41, 801-816 801 Mode Predictive Contro of Interconnected Linear and Noninear Processes Guang-Yan Zhu and Michae A. Henson* Department of Chemica Engineering, Louisiana State
More informationResearch on liquid sloshing performance in vane type tank under microgravity
IOP Conference Series: Materias Science and Engineering PAPER OPEN ACCESS Research on iquid soshing performance in vane type tan under microgravity Reated content - Numerica simuation of fuid fow in the
More information17 Lecture 17: Recombination and Dark Matter Production
PYS 652: Astrophysics 88 17 Lecture 17: Recombination and Dark Matter Production New ideas pass through three periods: It can t be done. It probaby can be done, but it s not worth doing. I knew it was
More informationSource and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems
Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,
More information18-660: Numerical Methods for Engineering Design and Optimization
8-660: Numerica Methods for Engineering esign and Optimization in i epartment of ECE Carnegie Meon University Pittsburgh, PA 523 Side Overview Conjugate Gradient Method (Part 4) Pre-conditioning Noninear
More information12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes
Maima and Minima 1. Introduction In this Section we anayse curves in the oca neighbourhood of a stationary point and, from this anaysis, deduce necessary conditions satisfied by oca maima and oca minima.
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More information