Nonlinear L 2 -gain analysis via a cascade
|
|
- Monica Golden
- 6 years ago
- Views:
Transcription
1 9th IEEE Conference on Decision and Control December -7, Hilton Atlanta Hotel, Atlanta, GA, USA Nonlinear L -gain analysis via a cascade Peter M Dower, Huan Zhang and Christopher M Kellett Abstract A nonlinear L -gain property that generalizes the conventional (linear) notion of L -gain for finite dimensional dynamical systems is studied In particular, an optimizationbased approximation strategy that facilitates computation of gain bounds via a cascade is presented The cascade in question consists of the dynamical system under test, driven by a nonlinear energy saturation operator that limits the energy delivered to that system The main advantage of this approach is demonstrated to be improved regularity properties of the value function This is demonstrated via a specific energy saturation operator and a simple example Index Terms L -gain analysis, nonlinear systems, cascade, optimization, dynamic programming I INTRODUCTION Nonlinear L -gain [], [9] is a finite gain property that generalizes the conventional (linear) notion of L -gain (see, for example, [8]) to include nonlinear gain functions of the form commonly employed in the input-to-state stability framework [7] The motivation for this generalization is to admit the application of L -gain analysis tools of a broader class of nonlinear systems, and to facilitate the broader application of small-gain based control design tools (cf []) via the synthesis of tighter gain bounds A significant problem with the concept of nonlinear L - gain introduced lies with the computation of the nonlinear gain functions involved Bisection methods based on verification results for Hamilton-Jacobi-Bellman equations cannot be extended from the linear gain case due to a lack of ordering on general classes of nonlinear gain functions Instead, previous work involving the authors [] involves the development of an optimization-based characterization for this nonlinear L -gain property It was shown that the value function involved can in principle be used to approximate bounds for the nonlinear L -gain of a nonlinear system The main technical difficulty explored in [] concerns the development of a problem reformulation that avoids an inequality constraint present in the aforementioned optimization problem In this work, an alternative formulation is provided that is defined with respect to a particular cascade This new formulation proves to be useful in that it admits a nonlinear scaling of the value function involved, thereby PM Dower and H Zhang are with the Department of Electrical & Electronic Engineering, University of Melbourne, Melbourne, Victoria, Australia pdower,hzhang@unimelbeduau Dower and Zhang are supported by AFOSR grant FA CM Kellett is with the School of Electrical Engineering & Computer Science, University of Newcastle, Newcastle, New South Wales, Australia chriskellett@newcastleeduau Kellett is supported by ARC grant DP773, The authors acknowledge M Cantoni at the University of Melbourne for a number of helpful discussions in relation to this research ameliorating some of the more serious regularity issues observed in [] In terms of organization, Section II recalls the nonlinear L -gain property of [] along with a summary of some of the salient features of the associated optimization-based characterization of nonlinear L -gain introduced there An alternative formulation using a generic cascade is provided in Section III Section IV presents a specific cascade, along with further analysis and an example A summary of conclusions is provided in Section V Throughout the paper, R and R denote the reals and non-negative reals respectively R m denotes m-dimensional Euclidean space L (I;R m ) denotes the space of square integrable functions mapping the real interval I R to R m This space is equipped with an L -norm, denoted L(I;R m ) Specifically, w L (I;R m ) w L(I;R m ) = w(s) ds < I Here, denotes the Euclidean norm on R m Specific variants of this space include L,loc (R m ) = L ([,T];R m ), T [, ) L, (R m ) = L ([, );R m ) Note that L,loc (R m ) L, (R m ) Elements of L ([,T];R m ), T R fixed, may be extended to L, (R m ) L,loc (R m ) via an operator χ T, where χ T : L ([,T];R m ) L, (R m ), χ T [w] = w(s) s [,T], s > T Where appropriate, explicit reference to the codomain R m will be dropped In other notation, a function γ : R R is of class K if it is continuous, non-decreasing, and satisfies γ() = Function γ is of class K if it is of class K, strictly increasing, and unbounded A Class of systems II A NONLINEAR L -GAIN PROPERTY Attention is restricted to finite dimensional nonlinear systems of the form ẋ(t) = f(x(t)) + g(x(t))w(t), x() = x R n Σ : z(t) = h(x(t)) () where t R denotes time, x R n denotes the initial condition, and w : R R m, z : R R p, and x : () //$ IEEE
2 R R n denote the input, output, and state trajectories (all functions of time) respectively For convenience, also define the function l : R n R by l(x) = h(x) In order to simplify the analysis, functions f, g, and l (and consequently h) are assumed to satisfy a number of basic properties, consistent with [] (Chapter 3) In particular, it is assumed that there exist constants C,C,C 3,C < such that f C (R n ;R n ) f(x) f(y) C x y x,y R n (3) f(x) C ( + x ) x R n ( g C R n ;R n m) g(x) C 3 x R n () h C (R n ;R p ), l C (R n ;R) () l(x) l(y) C ( + x + y ) x y Note that these assumptions imply that f() = R n and h() = R p They also imply closeness of solutions in the following sense Lemma : With T R, let x(t) R n, t [,T], denote the solution of () with initial state x() = x R n, driven by an input w L [,T], where w L[,T] ω R Then, there exist constants B, B, B 3 R dependent on T and ω such that x(t) x B t + B t + B3 x t () for all t [,T] B Nonlinear L -gain property System () has nonlinear L -gain [] with transient and gain bound (β,γ) K K if ( ) z L β ( x [,T] ) + γ w L [,T] (7) for all initial conditions x R n, all inputs w L [,T], and all time horizons T A tight lower bound for all nonlinear gains γ for which property (7) holds is denoted by γ Formally, γ (s) = inf γ(s) β K st property (7) holds with transient / gain bound (β,γ) Nonlinear systems () with the nonlinear L -gain property (7) naturally define an operator on L That is, (7) = Σ : L ([,T];R m ) L ([,T];R p ) T R and all initial states x R n Given that the L -norm measures a generalized notion of energy, this is a particularly compelling property for physical systems Nonlinear systems () with the nonlinear L -gain property (7) enjoy an obvious stability property Proposition : Suppose system () is -state detectable [3] and satisfies the nonlinear L -gain property (7) Then, for all x R n, w L, (R m z L, (R ) = p ), (9) lim t x(t) = (8) Bounds for the nonlinear L -gain of system () can be characterized via a constrained optimization problem [] Consistent with the notation used in [], the corresponding infinite horizon value function W : R n R R of interest is given by W(x,s) = sup sup T w L [,T] s z L [,T] () holds, x() = x () A candidate for the nonlinear L -gain of system (), given a specific transient bound β K, is then given by γ,β(s) = sup x R n max (W(x,s) β ( x ), γ (s)) () where γ (s) = W(,s) () Lemma 3: Suppose that system () satisfies the nonlinear L -gain property (7) with transient / gain bound (β,γ) K K Then, the gain candidates γ,β and γ of (), () are zero at zero, non-decreasing, and satisfy the inequality γ (s) γ,β(s) γ(s), s R (3) III NONLINEAR L -GAIN ANALYSIS VIA A GENERIC A Concept CASCADE Bounds on the nonlinear L -gain of system () can be analysed via the cascade of Figure There, Σ : L,loc (R m ) L,loc (R p ), S ξ : L,loc (R m ) L, (R m ), in which Σ denotes the input / output operator defined by system (), and S ξ denotes an auxiliary operator parameterized by ξ R The role of this auxiliary operator is to precisely limit the energy passed from the auxiliary input v L,loc (R m ) through to the system input w L,loc (R m ) of system Σ, whilst ensuring that the dynamics of Σ can be sufficiently excited via the cascade to generate maximal output energy in characterizing the nonlinear L -gain More precisely, S ξ is to have the following properties: (I) S ξ [] = ξ R; (II) S ξ [v] = S ξ [v] = S ξ [ v] v L,loc (R m ); (III) S ξ [v] ξ L[, ) v L,loc (R m ), ξ R; (IV) For each w L, (R m ), w L[, ) < ξ, ξ R, v L,loc (R m ) such that w = S ξ [v] (V) a state-space representation for S ξ, with state ξ : R R satisfying ξ() = ξ () Given such an operator S, the maximum output energy obtainable from the cascade of Figure may be characterized in terms of the value Ŵ : Rn R R of a specific optimization problem Explicitly, Ŵ(x,ξ ) = sup sup T v L [,T] z L [,T] (), () hold, x() = x, w = S ξ χ T [v] () 3
3 z Σ w S ξ Nonlinear system Energy saturation under test w L [, ) ξ Fig System Σ cascaded with the energy saturation operator S ξ (Here, χ is the extension operator of ()) It may be noted that unlike (), the variational problem of () does not involve an explicit integral constraint on the input Instead, the role of operator S is to implement this constraint implicitly via some internal dynamics Furthermore, under a continuity assumption on Ŵ, the value functions of () and () may be shown to be equivalent, provided that operator S satisfies the properties () This facilitates nonlinear L - gain analysis of system () to be formulated in terms of the inequality constraint-free value function of () Theorem 3: Suppose there exists an operator S satisfying properties (I) (IV) of () Then, the following properties concerning the value functions W and Ŵ of () and () hold: ) Ŵ(x, ) is an even and non-decreasing function for each fixed x R n, in the sense that for all ξ ξ ; ) W and Ŵ satisfy the inequality ξ Ŵ(x,ξ ) Ŵ(x,ξ ) () Ŵ(x,ξ ) W(x, ξ ) (7) for all x R n, ξ R; 3) Continuity of Ŵ(x, ) for each x R n fixed implies that the value functions W and Ŵ of () and () are equivalent in the sense that W ( x, ξ ) = Ŵ(x,ξ ) (8) for all x R n and all ξ R Proof: Fix x R n By definition (), property (II) of () implies that for any ξ R, Ŵ(x, ξ ) = sup sup T v L [,T] (), () hold, x() = x, z = Σ S ξ χ T [ v] = sup sup T v L [,T] (), () hold, x() = x, z = Σ S ξ χ T [ v] = Ŵ(x,ξ ), where = z L [,T] That is, Ŵ(x, ) is an even function Suppose that ξ = Fix any ξ R, and let v φ ( ) = ae denote the zero input in L, (R m ) Properties (I) and (III) imply that S ξ [v φ ] = v φ = S χ T [v] for any v v L [,T], T As v φ is sub-optimal in the definition () of Ŵ(x,ξ ), Ŵ(x,ξ ) sup z L [,T] z = Σ S ξ [v φ ] T = sup sup z L [,T] z = Σ S χ T [v] T v L [,T] = Ŵ(x,), so that () holds in this special case In the definition () of W(x,), w L[,T] implies that w = v φ ae on [,T] Hence, W(x,) = sup T z L z [,T] = Σ[v φ ] That is, W(x,) = Ŵ(x,) Ŵ(x,ξ ) for all (x,ξ ) R n+ This proves (), (7), and (8) in the special case where ξ = Now suppose that ξ R \ Then, the set I ξ = δ R ξ + δ > ξ > δ defines a non-empty, bounded interval whose closure contains Fix any δ I ξ For any ǫ >, let T ǫ and v ǫ L [,T ǫ ] be such that Ŵ(x,ξ ) < z ǫ L [,T ǫ ] + ǫ, where z ǫ = Σ[w ǫ ], and property (III) of () has been applied to generate w ǫ = Sξ χ T ǫ[v ǫ ] L, (R m ), w ǫ L [,T ǫ ] ξ Consequently, T ǫ and w ǫ are suboptimal in the definition () of W(x, ξ ) That is, Ŵ(x,ξ ) ǫ < z ǫ L [,T ǫ ] W ( x, ξ ) (9) Next, let T ǫ and w ǫ L [,T] ǫ be such that w ǫ L [,T ǫ] ξ and W(x, ξ ) ǫ < z ǫ L [,T ǫ], where z ǫ = Σ[ w ], ǫ and w ǫ = χ T ǫ [w] ǫ L, (R m ) Note that w ǫ L[, ) = w ǫ L[,T ǫ] ξ < ξ + δ, where the last inequality follows by definition of δ I ξ Property (IV) of () then implies that there exists a v ǫ L, (R m ) such that w ǫ S ξ +δ [ v ] ǫ As v ǫ (restricted to [,T]) ǫ and T, ǫ are sub-optimal in the definition () of Ŵ (x,ξ + δ), W(x, ξ ) ǫ z ǫ L [,T ǫ ] Ŵ (x,ξ + δ) () Combining inequalities (9) and () implies that Ŵ(x,ξ ) ǫ < W(x, ξ ) Ŵ (x,ξ + δ) + ǫ As ǫ > is arbitrary, Ŵ(x,ξ ) W(x, ξ ) Ŵ (x,ξ + δ) () As ξ < ξ +δ and δ I ξ is arbitrary, () clearly holds locally Repeated applications on overlapping intervals I, R, generalizes this to a global result This proves inequalities () and (7) Furthermore, continuity of Ŵ(x, ), inequality (), and the fact that I ξ implies that (8) holds This completes the proof Remark 3: Theorem 3 is the key result required for the development of the approximation strategy for nonlinear L -gain bounds such as () and () presented in this paper This strategy differs from that developed in [] in that the value function computed there was W(x,s) Ŵ (x, s)
4 Regularity issues associated with the s dependence were clearly evident in the explicit examples presented in that work By computing Ŵ instead, it is demonstrated later (see Section IV-C) that these issues can largely be avoided It is also noted that W(x,s) R is only defined for (x,s) R n R, limiting the application of other approximation approaches such as max-plus methods [], [] This is not the case for Ŵ(x,ξ), which is defined for all (x,ξ) Rn+ B Dynamic programming principle A standard application of dynamic programming yields a dynamic programming principle for the optimization problem defined by Ŵ of () Theorem 33: The value function Ŵ of () satisfies the dynamic programming principle (DPP) z L Ŵ (x,ξ ) = sup + (), () hold [,τ] v L [,τ] Ŵ (x(τ),ξ(τ)) x() = x ξ() = ξ () for all τ R, x R n, and ξ R Proof: The proof follows the same argument as that of Lemma 3 of [] The details are omitted C Stability of the worst case dynamics The DPP () can be employed to gain an understanding of how the output energy of system () is maximized In particular, it is possible to determine how the worst case dynamics associated with the value function Ŵ of () evolve in order to maximize the output energy Here, it is shown that near-optimal trajectories of system () always converge to zero To show this, a number of Lemmas are first presented, based on the assumption that Ŵ of () is proper in the following sense: Ŵ is continuous, Ŵ(,) =, with Ŵ(x,ξ) > (x,ξ) Rn+, Ŵ(,ξ) Ŵ(x,ξ) (x,ξ) Rn+, α K st α( x ) Ŵ(x,) x Rn (3) Lemma 3: Suppose that Ŵ is proper in the sense of (3), and that (x,ξ ) R n+ is fixed Then, given any δ R >, there exists an ǫ R > such that for any ǫ- optimal time horizon T ǫ R and input v ǫ L [,T ǫ ], ǫ (,ǫ ], max ( x ǫ (T ǫ ), ξ ǫ (T ǫ ) ) < δ, () in which x ǫ denotes the trajectory of system () driven by input S ξ χ T ǫ[v ǫ ] L, [, ) α(δ),ŵ(,δ) Proof: Fix any δ R > Select ǫ = min >, where positivity follows from α K and properness of Ŵ For any ǫ (,ǫ ], let T ǫ R and v ǫ L [,T ǫ ] be such that z ǫ L [,T ǫ ] > Ŵ(x,ξ ) ǫ Ŵ(x,ξ ) ǫ As T ǫ and v ǫ are suboptimal in the DPP (), Ŵ(x,ξ ) z ǫ L [,T ǫ ] + Ŵ(x ǫ (T ǫ ),ξ ǫ (T ǫ )) Combining these two inequalities yields that Ŵ(xǫ (T ǫ ),ξ ǫ (T ǫ )) ǫ Using the definition of ǫ, Theorem 3 (in particular, equation ()), and properness of Ŵἀ(δ) ǫ Ŵ(xǫ (T ǫ ),ξ ǫ (T ǫ )) Ŵ(xǫ (T ǫ ),) α( x ǫ (T ǫ ) ), so that x ǫ (T ǫ ) δ Similarly, Ŵ(,δ) ǫ Ŵ(x ǫ (T ǫ ),ξ ǫ (T ǫ )) Ŵ(,ξǫ (T ǫ )), so that ξ ǫ (T ǫ ) δ As ǫ (,ǫ ] is arbitrary, the result follows Lemma 3: Given (x,ξ ) R n+, let T ǫ denote the set T ǫ = T R > Ŵ(x,ξ ) ǫ < sup v L [,T] z L [,T] of all ǫ-optimal time horizons in the definition of Ŵ(x,ξ ) Let T : R > R denote the function T (ǫ) = inf T ǫ, () Then, ) Any ǫ-optimal time horizon can be made arbitrarily longer, so that T T ǫ = [T, ) T ǫ () ) T ( ) is non-increasing; 3) Ŵ proper, x, implies that there exists ǫ, T R > such that T (ǫ) T, ǫ (,ǫ ]; (7) Proof: Fix (x,ξ ) R n+ Assertion ): Suppose T T ǫ Then for any δ R, Ŵ(x,ξ ) ǫ < sup z L [,T] v L [,T] sup z L [,T+δ] v L [,T+δ] That is, T +δ T ǫ, where δ R is arbitrary Hence, () holds Assertion ): Fix any ˆǫ R >, ǫ (, ˆǫ] Then, any time horizon that is ǫ-optimal is by definition also ˆǫ-optimal That is, T ǫ Tˆǫ, so that inf T ǫ inf Tˆǫ, as required Assertion 3): Fix x and suppose that the assertion is false Then, for every ǫ, T R >, there exists an ǫ (,ǫ ] such that T (ǫ) < T In particular, select sequences ˆǫ n, ˆT n R >, n Z >, such that ˆǫ n and ˆT n as n Then, there exists ǫ n (, ˆǫ n ] such that T (ǫ n ) < ˆT n, n Z > That is, there exists an ǫ n -optimal time horizon T ǫn [, ˆT n ] and input v ǫn L [,T ǫn ] such that z ǫn L [,T ǫn] + ǫ n > Ŵ(x,ξ ) z ǫn L [,T ǫn] + Ŵ( xǫn (T ǫn ), ξ ǫn (T ǫn )), where ( x ǫn ( ), ξ ǫn ( ) ) R n+ denotes the trajectory of the cascade Σ x S ξ, driven by the input v ǫn = χ T ǫn[v ǫn ], and z ǫn denotes the corresponding output Consequently, Ŵ ( x ǫn (T ǫn ),) Ŵ ( x ǫn (T ǫn ), ξ ǫn (T ǫn ) ) < ǫ n ˆǫ n, (8)
5 where the left-hand inequality comes from Theorem 3 Define w ǫn = Sξ [ v ǫn ], and note that by property (III) of (), w ǫn ξ L[, ) Consequently, Lemma implies that given any δ R >, there exists a N Z > such that x ǫn (T ǫn ) x δ n Z >N That is, lim n x ǫn (T ǫn ) = x Combining this limit with inequality (8), the definition of sequence ǫ n, and continuity of Ŵ implies that W(x,) =, which by properness (3) yields that x =, which is a contradiction Theorem 3: Assume that Ŵ is proper in the sense of (3) Given (x,ξ ) R n+, suppose that an optimal input v L,loc (R m ) exists for Ŵ of () Then, the corresponding trajectory denoted by (x ( ),ξ ( )) : R R n+ is stable in the sense that lim t x (t) = = lim ξ (t) (9) t Proof: Fix (x,ξ ) R n+ By Lemma 3, T ( ) of () is a non-increasing function, which is either bounded above, or not, as ǫ + First suppose that it is That is, there exists T R > such that T (ǫ) T for all ǫ R >, and lim ǫ + T (ǫ) = T < Hence, () of Lemma 3 implies that T + δ T ǫ for any ǫ, δ R > That is, Ŵ(x,ξ ) ǫ < z ǫ L [,T +δ], where z ǫ = Σx S ξ χ T +δ[v ǫ ], with v ǫ L [,T +δ] denoting the corresponding ǫ-optimal input As T +δ and v ǫ are also sub-optimal in the DPP (), Ŵ(x,ξ ) z ǫ L [,T +δ] + Ŵ(x ǫ (T + δ),ξ ǫ (T + δ)) Hence, combining the above two inequalities, Ŵ(x ǫ (T + δ),ξ ǫ (T + δ)) < ǫ As ǫ, δ R > are arbitrary, properness (3) of Ŵ, and the assumed existence of the optimal trajectory, implies that (x (T ),ξ (T )) = R n+ Assumptions (3) and () together with property (III) of () then imply that (x (t),ξ (t)) = R n+, t T, which proves (9) in the case of bounded T Now suppose that T is not bounded, so that T (ǫ) as ǫ + Then, Lemma 3 and () imply that for any δ R >, δ lim T max ( x ǫ (T), ξ ǫ (T) ) As ǫ, δ R > are arbitrary, the result (9) again follows D A sufficient condition for continuity of Ŵ(x, ) In the general statement of Theorem 3, continuity of the function Ŵ(x, ) is required for each fixed x R n, where Ŵ is the value function of () This property may be demonstrated in the special case where specific incremental gain properties hold for both the system Σ of () and the cascaded operator S of Figure These properties are shown to be sufficient to demonstrate continuity of the gain bound γ of () Lemma 37: Suppose that system Σ of () and the cascaded operator S of Figure satisfy respectively the incremental nonlinear gain properties ) Σ x [w ] Σ x [w ] L γ [,T] ( w w L [,T] ) S ξ [v ] S ξ [v ] L β [,T] ( v v L [,T] for all w,, v, L [,T], T, where β, γ K Suppose additionally that system Σ satisfies the nonlinear L -gain property (7) with transient / gain bound pair in K K Then, the value function Ŵ of () satisfies the property that Ŵ(x, ) : R R defines a continuous function for any fixed x R n The proof relies on closeness of solutions [] (Lemma 3) and Theorem 3 The details are omitted for brevity Lemma 37 may be applied in demonstrating that the gain candidate γ is continuous Corollary 38: Suppose that the assumptions of Lemma 37 hold Then, gain bound γ of () satisfies γ K IV NONLINEAR L -GAIN ANALYSIS VIA A SPECIFIC CASCADE Further insight into the analysis problem of the preceding section can be obtained by considering a specific energy saturation operator S to be cascaded with system () A An explicit energy saturation operator S A candidate energy saturation operator is denoted by S ξ : L,loc (R m ) L, (R m ), ξ R, where ξ(t) = ξ(t) v(t), ξ() = ξ S ξ : w(t) = (3) ξ(t)v(t) in which ξ(t) R, v(t), w(t) R m denote respectively the state, input, and output of the nonlinear dynamics of operator S ξ, with initial state ξ R Theorem : The operator S of (3) satisfies properties (I) (V) of () B Dynamic programming equation The dynamic programming principle () may be employed to derive a dynamic programming equation (DPE) This DPE takes the form of a Hamilton-Jacobi-Bellman style PDE In particular, = H (x,ξ, x W(x,ξ), ξ W(x,ξ)) (3) for all (x,ξ) R n+, where H(x,ξ,p,q) = h(x) p,f(x) sup p, ξ g(x)v q ξ v (3) v R m For the specific cascade constructed using (3), it may be shown that the value function Ŵ of () is a viscosity solution of the DPE (3), provided suitable assumptions on system () and the regularity of Ŵ hold Uniqueness of this viscosity solution has yet to be demonstrated However, for the purpose of illustrative computation in the remainder of this paper, uniqueness of this viscosity solution is assumed This facilitates the approximation of Ŵ via the application of standard numerical methods to (3) Here, an approximating Markov chain method [] is employed
6 C Example c (x, ξ) W x Fig 3 ξ c for system (33) Infinite horizon value function W V C ONCLUSIONS x(t) ξ(t) * w (t) Ew(t) Ez(t) Time Fig Optimal trajectory and input for system (33) 7 γ (s) An optimization approach to the characterization of a nonlinear L -gain property was presented Key to this approach was the introduction of a cascaded input operator that precisely limits the input energy delivered to the system under test The resulting optimization problem was studied, yielding a dynamic programming principle and stability results in the presence of worst case inputs A dynamic programming equation was proposed A numerical method was employed to demonstrate the application of this approach to a simple example Trajectory, optimal input, and energies Consider a scalar nonlinear system () with f (x) = x + φ(x), g(x) =, h(x) = x, (33) where φ(x) = x x + x, and x, w R In the absence of inputs, the nonlinearity φ decreases the rate of convergence of the state towards the origin when x > It is expected that the tight lower bound γ of (8) should satisfy γ (s) s, s > Figure illustrates the computed infinite horizon value function W (x, s), x [, ], s [, 8], using the approach of [] For small s >, the s behaviour alluded to in Remark 3 is evident for x = Recall that W (, ξ) = for ξ R< Figure 3 illustrates c (x, ξ), x [, ], ξ [, ] Observe the function W c that W (, ξ) is defined for ξ R< due to (8) Figure illustrates the optimal trajectory of system () generated as result of the application of the optimal input v defined by () The signal w shown is defined as the per Figure, ie, w = Sξ [v ] Note that the internal dynamics of the cascade are stable, as expected by Theorem 3 The obtained gain bound γ of () is illustrated in Figure 3 8 W (x, s) 7 Fig 3 x Fig s Infinite horizon value function W for system (33) R EFERENCES [] PM Dower and CM Kellett A dynamic programming approach to the approximation of nonlinear L -gain In IEEE Conference on Decision and Control (Cancun, Mexico), pages IEEE, 8 [] PM Dower and WM McEneaney A max-plus affine power method for approximation of a class of mixed l-infinity / l- value functions In Proc nd IEEE Conference on Decision & Control (Maui, Hawaii), pages IEEE, 3 [3] A Isidori Nonlinear control systems II Springer-Verlag, 999 s 8 for system (33) Gain bound γ [] ZP Jiang, AR Teel, and L Praly Small-gain theorem for ISS systems and applications Math Control Signals Systems, 7:9, 99 [] HJ Kushner and PG Dupuis Numerical methods for stochastic control problems in continuous time Applications of Mathematics: Stochastic Modelling and Applied Probability Springer-Verlag, New York, 99 [] WM McEneaney Max-plus methods for nonlinear control and estimation Systems & Control: Foundations & Application Birkhauser, [7] ED Sontag New characterizations of input to state stability IEEE Trans Automatic Control, :83 9, 99 [8] AJ van der Schaft L -gain and passivity techniques in nonlinear control, volume 8 of Lecture notes in control and information sciences Springer-Verlag, 99 [9] H Zhang and PM Dower A max-plus method for the approximation of transient bounds for systems with nonlinear L -gain In MTNS (Hungary, Budapest), 7
A max-plus based fundamental solution for a class of infinite dimensional Riccati equations
A max-plus based fundamental solution for a class of infinite dimensional Riccati equations Peter M Dower and William M McEneaney Abstract A new fundamental solution for a specific class of infinite dimensional
More informationAnalysis of Input to State Stability for Discrete Time Nonlinear Systems via Dynamic Programming
Analysis of Input to State Stability for Discrete Time Nonlinear Systems via Dynamic Programming Shoudong Huang Matthew R. James Dragan Nešić Peter M. Dower April 8, 4 Abstract The Input-to-state stability
More informationA small-gain type stability criterion for large scale networks of ISS systems
A small-gain type stability criterion for large scale networks of ISS systems Sergey Dashkovskiy Björn Sebastian Rüffer Fabian R. Wirth Abstract We provide a generalized version of the nonlinear small-gain
More informationViscosity Solutions of the Bellman Equation for Perturbed Optimal Control Problems with Exit Times 0
Viscosity Solutions of the Bellman Equation for Perturbed Optimal Control Problems with Exit Times Michael Malisoff Department of Mathematics Louisiana State University Baton Rouge, LA 783-4918 USA malisoff@mathlsuedu
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 informationContinuous and Piecewise Affine Lyapunov Functions using the Yoshizawa Construction
Continuous and Piecewise Affine Lyapunov Functions using the Yoshizawa Construction Sigurður Hafstein, Christopher M Kellett, Huijuan Li Abstract We present a novel numerical technique for the computation
More informationSmall Gain Theorems on Input-to-Output Stability
Small Gain Theorems on Input-to-Output Stability Zhong-Ping Jiang Yuan Wang. Dept. of Electrical & Computer Engineering Polytechnic University Brooklyn, NY 11201, U.S.A. zjiang@control.poly.edu Dept. of
More informationConverse Lyapunov theorem and Input-to-State Stability
Converse Lyapunov theorem and Input-to-State Stability April 6, 2014 1 Converse Lyapunov theorem In the previous lecture, we have discussed few examples of nonlinear control systems and stability concepts
More informationOn Input-to-State Stability of Impulsive Systems
On Input-to-State Stability of Impulsive Systems João P. Hespanha Electrical and Comp. Eng. Dept. Univ. California, Santa Barbara Daniel Liberzon Coordinated Science Lab. Univ. of Illinois, Urbana-Champaign
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 informationOn the construction of ISS Lyapunov functions for networks of ISS systems
Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan, July 24-28, 2006 MoA09.1 On the construction of ISS Lyapunov functions for networks of ISS
More informationComments on integral variants of ISS 1
Systems & Control Letters 34 (1998) 93 1 Comments on integral variants of ISS 1 Eduardo D. Sontag Department of Mathematics, Rutgers University, Piscataway, NJ 8854-819, USA Received 2 June 1997; received
More informationL -Bounded Robust Control of Nonlinear Cascade Systems
L -Bounded Robust Control of Nonlinear Cascade Systems Shoudong Huang M.R. James Z.P. Jiang August 19, 2004 Accepted by Systems & Control Letters Abstract In this paper, we consider the L -bounded robust
More informationExam February h
Master 2 Mathématiques et Applications PUF Ho Chi Minh Ville 2009/10 Viscosity solutions, HJ Equations and Control O.Ley (INSA de Rennes) Exam February 2010 3h Written-by-hands documents are allowed. Printed
More informationOn the Bellman equation for control problems with exit times and unbounded cost functionals 1
On the Bellman equation for control problems with exit times and unbounded cost functionals 1 Michael Malisoff Department of Mathematics, Hill Center-Busch Campus Rutgers University, 11 Frelinghuysen Road
More informationOn finite gain L p stability of nonlinear sampled-data systems
Submitted for publication in Systems and Control Letters, November 6, 21 On finite gain L p stability of nonlinear sampled-data systems Luca Zaccarian Dipartimento di Informatica, Sistemi e Produzione
More informationLocal ISS of large-scale interconnections and estimates for stability regions
Local ISS of large-scale interconnections and estimates for stability regions Sergey N. Dashkovskiy,1,a,2, Björn S. Rüffer 1,b a Zentrum für Technomathematik, Universität Bremen, Postfach 330440, 28334
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationOn integral-input-to-state stabilization
On integral-input-to-state stabilization Daniel Liberzon Dept. of Electrical Eng. Yale University New Haven, CT 652 liberzon@@sysc.eng.yale.edu Yuan Wang Dept. of Mathematics Florida Atlantic University
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 informationarxiv: v1 [math.oc] 9 Oct 2018
A Convex Optimization Approach to Dynamic Programming in Continuous State and Action Spaces Insoon Yang arxiv:1810.03847v1 [math.oc] 9 Oct 2018 Abstract A convex optimization-based method is proposed to
More informationThe principle of least action and two-point boundary value problems in orbital mechanics
The principle of least action and two-point boundary value problems in orbital mechanics Seung Hak Han and William M McEneaney Abstract We consider a two-point boundary value problem (TPBVP) in orbital
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationOn Input-to-State Stability of Impulsive Systems
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 12-15, 2005 TuC16.5 On Input-to-State Stability of Impulsive Systems João
More informationOn reduction of differential inclusions and Lyapunov stability
1 On reduction of differential inclusions and Lyapunov stability Rushikesh Kamalapurkar, Warren E. Dixon, and Andrew R. Teel arxiv:1703.07071v5 [cs.sy] 25 Oct 2018 Abstract In this paper, locally Lipschitz
More informationDifferential Games II. Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011
Differential Games II Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011 Contents 1. I Introduction: A Pursuit Game and Isaacs Theory 2. II Strategies 3.
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More informationStability Criteria for Interconnected iiss Systems and ISS Systems Using Scaling of Supply Rates
Stability Criteria for Interconnected iiss Systems and ISS Systems Using Scaling of Supply Rates Hiroshi Ito Abstract This paper deals with problems of stability analysis of feedback and cascade interconnection
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
More informationProf. Erhan Bayraktar (University of Michigan)
September 17, 2012 KAP 414 2:15 PM- 3:15 PM Prof. (University of Michigan) Abstract: We consider a zero-sum stochastic differential controller-and-stopper game in which the state process is a controlled
More informationState-norm estimators for switched nonlinear systems under average dwell-time
49th IEEE Conference on Decision and Control December 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA State-norm estimators for switched nonlinear systems under average dwell-time Matthias A. Müller
More informationA DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE PETER G. CASAZZA, GITTA KUTYNIOK,
More informationON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME
ON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME SAUL D. JACKA AND ALEKSANDAR MIJATOVIĆ Abstract. We develop a general approach to the Policy Improvement Algorithm (PIA) for stochastic control problems
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 informationFourier Transform & Sobolev Spaces
Fourier Transform & Sobolev Spaces Michael Reiter, Arthur Schuster Summer Term 2008 Abstract We introduce the concept of weak derivative that allows us to define new interesting Hilbert spaces the Sobolev
More informationInput to state Stability
Input to state Stability Mini course, Universität Stuttgart, November 2004 Lars Grüne, Mathematisches Institut, Universität Bayreuth Part IV: Applications ISS Consider with solutions ϕ(t, x, w) ẋ(t) =
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMinimum-Phase Property of Nonlinear Systems in Terms of a Dissipation Inequality
Minimum-Phase Property of Nonlinear Systems in Terms of a Dissipation Inequality Christian Ebenbauer Institute for Systems Theory in Engineering, University of Stuttgart, 70550 Stuttgart, Germany ce@ist.uni-stuttgart.de
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
More informationThe first order quasi-linear PDEs
Chapter 2 The first order quasi-linear PDEs The first order quasi-linear PDEs have the following general form: F (x, u, Du) = 0, (2.1) where x = (x 1, x 2,, x 3 ) R n, u = u(x), Du is the gradient of u.
More informationDate: July 5, Contents
2 Lagrange Multipliers Date: July 5, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 14 2.3. Informative Lagrange Multipliers...........
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f
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 informationFenchel-Moreau Conjugates of Inf-Transforms and Application to Stochastic Bellman Equation
Fenchel-Moreau Conjugates of Inf-Transforms and Application to Stochastic Bellman Equation Jean-Philippe Chancelier and Michel De Lara CERMICS, École des Ponts ParisTech First Conference on Discrete Optimization
More informationConvergence of generalized entropy minimizers in sequences of convex problems
Proceedings IEEE ISIT 206, Barcelona, Spain, 2609 263 Convergence of generalized entropy minimizers in sequences of convex problems Imre Csiszár A Rényi Institute of Mathematics Hungarian Academy of Sciences
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationThe Minimum Speed for a Blocking Problem on the Half Plane
The Minimum Speed for a Blocking Problem on the Half Plane Alberto Bressan and Tao Wang Department of Mathematics, Penn State University University Park, Pa 16802, USA e-mails: bressan@mathpsuedu, wang
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationLINEAR-CONVEX CONTROL AND DUALITY
1 LINEAR-CONVEX CONTROL AND DUALITY R.T. Rockafellar Department of Mathematics, University of Washington Seattle, WA 98195-4350, USA Email: rtr@math.washington.edu R. Goebel 3518 NE 42 St., Seattle, WA
More informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
More informationA NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS
A NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS PETER GIESL AND MARTIN RASMUSSEN Abstract. The variational equation of a nonautonomous differential equation ẋ = F t, x) along a solution µ is given by ẋ
More informationComparison of Orlicz Lorentz Spaces
Comparison of Orlicz Lorentz Spaces S.J. Montgomery-Smith* Department of Mathematics, University of Missouri, Columbia, MO 65211. I dedicate this paper to my Mother and Father, who as well as introducing
More informationON INPUT-TO-STATE STABILITY OF IMPULSIVE SYSTEMS
ON INPUT-TO-STATE STABILITY OF IMPULSIVE SYSTEMS EXTENDED VERSION) João P. Hespanha Electrical and Comp. Eng. Dept. Univ. California, Santa Barbara Daniel Liberzon Coordinated Science Lab. Univ. of Illinois,
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
More informationHybrid Systems Techniques for Convergence of Solutions to Switching Systems
Hybrid Systems Techniques for Convergence of Solutions to Switching Systems Rafal Goebel, Ricardo G. Sanfelice, and Andrew R. Teel Abstract Invariance principles for hybrid systems are used to derive invariance
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationChain differentials with an application to the mathematical fear operator
Chain differentials with an application to the mathematical fear operator Pierre Bernhard I3S, University of Nice Sophia Antipolis and CNRS, ESSI, B.P. 145, 06903 Sophia Antipolis cedex, France January
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationA LaSalle version of Matrosov theorem
5th IEEE Conference on Decision Control European Control Conference (CDC-ECC) Orlo, FL, USA, December -5, A LaSalle version of Matrosov theorem Alessro Astolfi Laurent Praly Abstract A weak version of
More informationExtremal Solutions of Differential Inclusions via Baire Category: a Dual Approach
Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Alberto Bressan Department of Mathematics, Penn State University University Park, Pa 1682, USA e-mail: bressan@mathpsuedu
More informationExample 1. Hamilton-Jacobi equation. In particular, the eikonal equation. for some n( x) > 0 in Ω. Here 1 / 2
Oct. 1 0 Viscosity S olutions In this lecture we take a glimpse of the viscosity solution theory for linear and nonlinear PDEs. From our experience we know that even for linear equations, the existence
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 informationObservability and forward-backward observability of discrete-time nonlinear systems
Observability and forward-backward observability of discrete-time nonlinear systems Francesca Albertini and Domenico D Alessandro Dipartimento di Matematica pura a applicata Universitá di Padova, 35100
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee227c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee227c@berkeley.edu
More informationExistence and uniqueness of solutions for nonlinear ODEs
Chapter 4 Existence and uniqueness of solutions for nonlinear ODEs In this chapter we consider the existence and uniqueness of solutions for the initial value problem for general nonlinear ODEs. Recall
More informationVISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.
VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)
More informationWeighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes
More informationStochastic Shortest Path Problems
Chapter 8 Stochastic Shortest Path Problems 1 In this chapter, we study a stochastic version of the shortest path problem of chapter 2, where only probabilities of transitions along different arcs can
More informationTHE PONTRYAGIN MAXIMUM PRINCIPLE FROM DYNAMIC PROGRAMMING AND VISCOSITY SOLUTIONS TO FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS
transactions of the american mathematical society Volume 298, Number 2, December 1986 THE PONTRYAGIN MAXIMUM PRINCIPLE FROM DYNAMIC PROGRAMMING AND VISCOSITY SOLUTIONS TO FIRST-ORDER PARTIAL DIFFERENTIAL
More informationA NUMERICAL OPTIMAL CONTROL APPROACH TO THE DESIGN OF AN OPTICAL FIBRE-BASED EVANESCENT FIELD SENSOR. Peter M. Dower Peter M. Farrell Brant C.
A NUMERICAL OPTIMAL CONTROL APPROACH TO THE DESIGN OF AN OPTICAL FIBRE-BASED EVANESCENT FIELD SENSOR. Peter M. Dower Peter M. Farrell Brant C. Gibson Department of Electrical and Electronic Engineering
More informationA Concise Course on Stochastic Partial Differential Equations
A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original
More informationA Systematic Approach to Extremum Seeking Based on Parameter Estimation
49th IEEE Conference on Decision and Control December 15-17, 21 Hilton Atlanta Hotel, Atlanta, GA, USA A Systematic Approach to Extremum Seeking Based on Parameter Estimation Dragan Nešić, Alireza Mohammadi
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationDuality and dynamics in Hamilton-Jacobi theory for fully convex problems of control
Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control RTyrrell Rockafellar and Peter R Wolenski Abstract This paper describes some recent results in Hamilton- Jacobi theory
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationThe Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:
Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationNonlinear stabilization via a linear observability
via a linear observability Kaïs Ammari Department of Mathematics University of Monastir Joint work with Fathia Alabau-Boussouira Collocated feedback stabilization Outline 1 Introduction and main result
More information1 Stochastic Dynamic Programming
1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future
More informationFrom convergent dynamics to incremental stability
51st IEEE Conference on Decision Control December 10-13, 01. Maui, Hawaii, USA From convergent dynamics to incremental stability Björn S. Rüffer 1, Nathan van de Wouw, Markus Mueller 3 Abstract This paper
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 informationExact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems
Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation
More informationFurther Results on the Bellman Equation for Optimal Control Problems with Exit Times and Nonnegative Instantaneous Costs
Further Results on the Bellman Equation for Optimal Control Problems with Exit Times and Nonnegative Instantaneous Costs Michael Malisoff Systems Science and Mathematics Dept. Washington University in
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
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 informationHerz (cf. [H], and also [BS]) proved that the reverse inequality is also true, that is,
REARRANGEMENT OF HARDY-LITTLEWOOD MAXIMAL FUNCTIONS IN LORENTZ SPACES. Jesús Bastero*, Mario Milman and Francisco J. Ruiz** Abstract. For the classical Hardy-Littlewood maximal function M f, a well known
More informationOn deterministic reformulations of distributionally robust joint chance constrained optimization problems
On deterministic reformulations of distributionally robust joint chance constrained optimization problems Weijun Xie and Shabbir Ahmed School of Industrial & Systems Engineering Georgia Institute of Technology,
More informationNoncooperative continuous-time Markov games
Morfismos, Vol. 9, No. 1, 2005, pp. 39 54 Noncooperative continuous-time Markov games Héctor Jasso-Fuentes Abstract This work concerns noncooperative continuous-time Markov games with Polish state and
More informationOn the Convergence of Optimistic Policy Iteration
Journal of Machine Learning Research 3 (2002) 59 72 Submitted 10/01; Published 7/02 On the Convergence of Optimistic Policy Iteration John N. Tsitsiklis LIDS, Room 35-209 Massachusetts Institute of Technology
More informationON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION
ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily
More informationNonlinear Scaling of (i)iss-lyapunov Functions
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 61, NO. 4, APRIL 216 187 Nonlinear Scaling of (i)iss-lyapunov Functions Christopher M. Kellett and Fabian R. Wirth Abstract While nonlinear scalings of Lyapunov
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo September 6, 2011 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationOn Characterizations of Input-to-State Stability with Respect to Compact Sets
On Characterizations of Input-to-State Stability with Respect to Compact Sets Eduardo D. Sontag and Yuan Wang Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA Department of Mathematics,
More informationLecture 8 Plus properties, merit functions and gap functions. September 28, 2008
Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:
More informationA note on stabilization with saturating feedback. Thomas I. Seidman. Houshi Li
A note on stabilization with saturating feedback THOMAS I. SEIDMAN AND HOUSHI LI Thomas I. Seidman Department of Mathematics and Statistics University of Maryland Baltimore County Baltimore, MD 2125, USA
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 3: Regenerative Processes Contents 3.1 Regeneration: The Basic Idea............................... 1 3.2
More information