Feedback Refinement Relations for the Synthesis of Symbolic Controllers
|
|
- Felicity Wiggins
- 5 years ago
- Views:
Transcription
1 Feedback Refinement Relations for the Synthesis of Symbolic Controllers Gunther Reissig 1, Alexander Weber 1 and Matthias Rungger 2 1: Chair of Control Engineering Universität der Bundeswehr, München 2: Hybrid Control Systems Group Technische Universität München (TUM)
2 2/33 Controller Synthesis A conceptual synthesis problem Given a system S and a desired behavior Σ, find a controller, i.e., a system C so that the behavior of the closed loop satisfies B(C S) Σ. Σ, B(C S) are subsets of (U Y ) := (U Y ) (U Y ) ω U are the inputs Y are the outputs Examples Reference tracking Optimal control (u, y) Σ Linear temporal logic specifications lim y(t) y reference (t) = 0 t (u, y) Σ (u, y) inf J(u, y) ε (u, y) Σ (u, y) satisfies ϕ
3 3/33 Abstraction and Refinement for Controller Synthesis Usually, direct synthesis of C from (S, Σ) is impossible and a finite substitute (Ŝ, ˆΣ) is used to determine C: 1. Compute a finite substitute (Ŝ, ˆΣ) of (S, Σ) Ŝ is an abstraction or a symbolic model of S 2. Synthesize controller Ĉ to enforce ˆΣ on Ŝ 3. Refine solution Ĉ to C finite (Ŝ, ˆΣ) 2. Ĉ 1. abstract concrete 3. (S, Σ) C infinite
4 4/33 Correctness Reasoning Given that Ĉ enforces ˆΣ on Ŝ. How to ensure that C enforces Σ an S? For verification simulation relations are used: S S Ŝ and B(Ŝ) ˆΣ = B(S) Σ Recall: Q X ˆX is a simulation relation from S to Ŝ if (x, ˆx) Q implies x x ˆx ˆx (x, ˆx ) Q For synthesis alternating simulation relations are used: Ŝ AS S and B(Ĉ Ŝ) ˆΣ = C : B(C S) Σ Recall: Q X ˆX is an alternating simulation relation from Ŝ to S if (x, ˆx) Q implies û admissible u admissible u x x û ˆx ˆx (x, ˆx ) Q
5 The Refinement Procedure (= Controller Transfer) ASR conditions 1. (x, ˆx) Q implies 2. û admissible 3. u admissible u 4. x x û 5. ˆx ˆx 6. (x, ˆx ) Q Construction of refined controller C 1. Given x, Q acts as quantizer and picks ˆx Q(x) 2. In the abstract closed loop and admissible û is proposed 3. In the concrete closed loop û is matched by an admissible u 4. The concrete closed loop proceeds with x u x Reissig, Rungger, and Weber 5. The next Feedback ˆx is Refinement determined Relations for bythe ˆx Synthesis Q(x of Symbolic ) and ˆx Controllers ˆx The closed loop C S follows to û input u x system x state input u x ˆx û ˆx input converter quantizer abstraction û abstract controller ˆx refined controller 5/33
6 A Closer Look at the Refinement Reissig, Rungger, and Weber The closed loop C S follows to Feedback Refinement Relations for the Synthesis of Symbolic Controllers input system state input input converter quantizer abstraction abstract controller refined controller Properties: Abstraction is contained in the refined controller The refined controller requires exact state information Both properties are critical! (a) Figure 1. (a) Actual closed loop resulting from the use of approximate alternating simulation relations [?], [?]. (b) of feedback refinement relations, as proposed in this paper. As our examples in Section III show, the structure of thi with the use of approximate alternating (bi-)simulation relations or approximate (bi-)simulation relations. Typically abstractions. abstractions Indeed, consists as demonstrated of 10 6 states in Section and 10 III, 9 transitions the issue ]a; b[, [a; b[, and]a; b] stand Usuallyofonly the complexity perturbed/quantized of refined controllers state information cannot beisresolved available [a, b] Z, [1; 4[ = {1, 2, 3}, A static bycontroller merely revising notrefinement refined tomethods a staticifcontroller! existing relations In R n,therelations<, 6/33
7 In this Talk 1. A new notion ofreissig, system Weber, relation, and Runggertermed Feedback Refinement Relation, for controller refinement, so that the closed loop is given by input system abstract controller Feedback Refinement Relations for the Synthesis of Symbolic Co state quantizer refined controller Feedback refinement Figure 1. relations Closed loopare resulting necessary from the and abstraction sufficient and refinement for the approach illustrated refinement procedure based on feedback refinement relations, proposed in this paper. 2. We show how feedback refinement relations can be used to solve general abstraction control problems is not only and sufficient to ensure the simple structure synthesize robust of the closed controllers loop in Fig. 1, but in fact also necessary. 3. We show how to Our compute work abstractions builds a general for control notionsystems of of with the form setvalued dynamics and possibly non-deterministic quantizers. This is particularly useful ξ f to (ξ, model u) + Wvarious types of disturbances, including plant uncertainties, input disturbances and where W is a bounded state measurement set of disturbances errors. We demonstrate how to account for those perturbations in our framework so that the synthesized covers stateful s including transitio as special cases. useful e.g. to mod time or in the con occurrence of the any linear time p Besides the lim of robustness furt For example, [18 dynamics, while deterministic wh precise, without a The synthesis based on a novel theory in [24], fe metric of the stat the necessity as authors of [24] c effect of these pe 7/33
8 8/33 Feedback Refinement Relations Systems, Solutions, Behavior Serial Composition, Feedback Composition Main Theorem
9 Systems: Informal Introduction We consider dynamical systems of the form where x is the state u is the input y is the output F is the transition function H is the output function x(t + 1) F (x(t), u(t)) y(t) H(x(t), u(t)) In order to define a meaningful serial/feedback composition of this general type of systems we need internal variables u 1 x 1 F 1 H 1 u 2 y 1 x 2 F 2 H 2 y2 F 12 (x, u 1 ) = F 1 (x 1, u 1 ) F 2 (x 2, u 2 ), x = (x 1, x 2 ), u 2 H 1 (x 1, u 1 ) H 12 (x, u 1 ) = H 1 (x 1, u 1 ) H 2 (x 2, u 2 ), x = (x 1, x 2 ), u 2 H 1 (x 1, u 1 ) In the first and second line, we need to pick the same u 2! 9/33
10 10/33 F ˆ= : set-valued map F : X V 2 can be identified with relation F X V X, Systems but F depends on input only indirectly, via H, whereas X U X. Intuitive interpretation of functioning of a system: x(t + 1) F (x(t), v(t)) (y(t), v(t)) H(x(t), u(t)) x(t + x(0) 1) F(x(t), X 0 v(t)) x(t) v(t) F H y(t) x(t + 1) S (y(t), v(t)) H(x(t), u(t)) u: input; can be prescribed A system S is a tuple S = (X, X 0, U, V, Y, F y:, H) output; where can be measured X, U, V and Y are nonempty sets x, v: state, internal variable; no direct acces : delay X is the state alphabet X 0 X is the initial state alphabet U is the input alphabet V is the internal input alphabet Y is the output alphabet unther Reißig Lecture 12: Abstraction and Synthesis I Course: Modeling and Verification of Embedded Systems (TUM, M. Zamani) January 21, F : X V X is the transition function u(t) H : X U Y V is the output function and is assumed to be strict, i.e., (x,u) X U : H(x, u) Notation We use F : X Y to denote set-valued function from X to Y
11 11/33 Systems We call a system S = (X, X 0, U, V, Y, F, H) 1. static if X is a singleton 2. Moore if the output does not depend on the input, i.e., (y, v) H(x, u) u U = v (y, v ) H(x, u ); 3. basic if U = V and (y, v) H(x, u) = v = u; 4. Moore with state output if X = Y and (y, v) H(x, u) = y = x. For a basic Moore system with state output and X 0 = X we simply use S = (X, U, F ) We define the set U S (x) of admissible inputs at the state x X by U S (x) = {u U F (x, u) }
12 12/33 Solutions and Behavior Let S = (X, X 0, U, V, Y, F, H) be given. A quadruple (u, v, x, y) (U V X Y ) [0;T [ with T N { } is a solution of the system S on [0; T [ if x(0) X 0 x(t + 1) F (x(t), v(t)) holds for all t [0; T 1[ (y(t), v(t)) H(x(t), u(t)) holds for all t [0; T [ Behavior B(S) of S An element of the behavior (u, y) B(S) is an input/output sequence which is generated by a solution of the system S The generating solution either is infinite or ends in a blocking input/state pair (u, y) B(S) iff v,x,t (u, v, x, y) is a solution of S on [0; T [ T < implies that F (x(t 1), u(t 1)) =
13 13/ Serial Composition F 12(x, v) =F 1(x 1, v 1) F 2(x 2, v 2) H 12(x, u 1)={(y 2, v) Y 2 V 12 y1 (y 1, v 1) H 1(x 1, u 1) (y 2, v 2) H 2(x 2, y 1)} Let S i = (X i, X i,0, U i, V i, Y i, F i, H i ), i {1, 2} be two systems. S 2 S 1 is a system x 1 v F 1 H 1 y 1 1 F v 2 H y u 1 S 1 S 2 x 2 S 2 S 1 Gunther Reißig Lecture 12: Abstraction and Synthesis I Course: Modeling and Verification of Embedded Systems (TUM, M. Zamani) January 21, S 1 is serial composable with S 2 if Y 1 U 2 The serial composition of S 1 and S 2 is denoted by S 2 S 1
14 14/33 Serial Composition: Example u x ˆx ZOH ξ(t) = Aξ(t) + Bu Q τ Sample-and-hold system S = (R n, R m, F ) with { ( τ ) } F (x, u) = e Aτ x + e A(τ s) ds u Quantizer Q : R n Z n Q(x) = {ˆx Z n x ˆx 1} is identified with the static system Q = ({q}, {q}, R n, R n, Z n, F q, H q) F q(q, x) = {q} for all x R n H q(q, x) = Q(x) {x} 0 S is serial composable with Q and Q S = (R n, R n, R m, R m, Z n, F, H) is basic with H(x, u) = Q(x) {u}
15 15/33 H 12 : X 12 2 Y 12 V 12 Feedback Composition x 2, v 2 ), 2 (y Let 1, v S i = 1 ) H (X i, X 1 (x i,0, 1, y U i, 2 ) (y V i, Y i, F 2, v i, H 2 ) H i ), i 2 (x {1, 2, y 2} 1 )}. be two systems. v 2 F 2 x 2 H 2 y 2 S 2 y 1 H 1 x 1 F 1 v 1 S 1 I Course: Modeling and Verification of Embedded Systems (TUM, M. Zamani) January 21, S 1 is feedback composable with S 2 if Y 2 U 1 and Y 1 U 2 S 2 is Moore The feedback composition of S 1 and S 2 is denoted by S 1 S 2
16 16/33 Feedback Refinement Relations Let S i = (X i, U i, F i ), i {1, 2} be two systems and assume U 2 U 1 A strict relation Q X 1 X 2 is a feedback refinement relation from S 1 to S 2, denoted by S 1 Q S 2 if the following holds for all (x 1, x 2) Q: 1. U S2 (x 2) U S1 (x 1) 2. u U S2 (x 2) = Q(F 1(x 1, u)) F 2(x 2, u) In words 1. every adimissible input of S 2 at x 2 is an admissible input of S 1 at x 1 2. every sucessor x 1 F 1(x 1, u) when mapped to X 2 via Q is contained in F 2(x 2, u)
17 Comparison with Alternating Simulation Relations ASR VS FRR (x 1, x 2) Q implies u 2 U S2 (x 2) u 1 U S1 (x 1) x 1 F 1(x 1, u 1) we have (x 1, x 2) Q implies u U S2 (x 2) u U S1 (x 1) x 1 F 1(x 1, u) we have (asr) Q(x 1) F 2(x 2, u 2) Q(x 1) F 2(x 2, u) (frr) Difference 1. ASR: inputs U 1 and U 2 can be different 2. (asr) vs (frr) What is the problem with ASR? In the refinement with ASR 1. for (x 1, x 2 ) Q and u 2 to pick the matching u 1 we need to know concrete state x 1 2. and to pick the right x 2 Q(x 1 ) we need to know F 2(x 2, u 2 ) so that x 2 Q(x 1 ) and x 2 F 2(x 2, u 2 ) In the refinement with FRR 1. u can directly be applied to S 1 2. we can pick any x 2 Q(x 1 ) and use (frr) to ensure x 2 F 2(x 2, u) 17/33
18 Feedback Refinement Relations: Necessary Conditions Consider S i = (X i, U i, F i ), i {1, 2} C = (X c, X c,0, U c, V c, Y c, F c, H c) S 2 :abstraction S 1 :system x 1 strict Q X 1 X 2 and the statements 1. C is feedback composable with S 2 2. C is feedback composable with Q S 1 u C:controller x 2 u C:controller Q x 2 3. B(C (Q S 1)) B(C S 2) Theorem: If 1. implies 2. and 3. then S 1 Q S 2. We have to show U 2 U 1 (x 1, x 2) Q implies U S2 (x 2) U S1 (x 1) (x 1, x 2) Q and u U S2 (x 2) implies Q(F 1(x 1, u)) F 2(x 2, u) U 2 U 1 1. implies Y c U 2 2. implies Y c U 1 Since 1. implies 2. we have: Y c U 2 implies Y c U 1. Hence U 2 U 1 We have to show 18/33
19 19/33 Feedback Refinement Relations: Sufficient Conditions Consider S i = (X i, U i, F i ), i {1, 2} C = (X c, X c,0, U c, V c, Y c, F c, H c) S 2 :abstraction S 1 :system x 1 strict Q X 1 X 2 and the statements u x 2 u Q 1. C is feedback composable with S 2 2. C is feedback composable with Q S 1 C:controller C:controller x 2 3. B(C (Q S 1)) B(C S 2) Theorem: If S 1 Q S 2, then (1. and ( )) imply (2. and 3.) where (y c, v c) H c(x c, x 2) F 2(x 2, y c) = = F c(x c, v c) = ( ) ( ): C non-blocking = S 2 non-blocking In the proof we need C (Q S 1) non-blocking = C S 2 non-blocking
20 20/33 Feedback Refinement Relations: Sufficient Conditions Consider S i = (X i, U i, F i ), i {1, 2} C = (X c, X c,0, U c, V c, Y c, F c, H c) strict Q X 1 X 2 Corollary: If S 1 Q S 2, then 1. and ( ) imply C Q is feedback composable with S 1 for every (u, x 1) B((C Q) S 1) exists (u, x 2) B(C S 2) so that t dom(u,x1 ) : (x 1(t), x 2(t)) Q S 2 :abstraction S 1 :system S 1 :system x 1 x 1 u x 2 u Q u Q C:controller C:controller x 2 C:controller x 2
21 21/33 Applications Symbolic Synthesis Robust Synthesis
22 to denote the fact that S 1 Q S 2 and Σ 2 is an abstract specification associated with S 2, S 1, Σ 1 and Q 22/33 Specifications Consider a system S = (X, X 0, U, V, Y, F, H): any subset Σ (U Y ) is a specification for S S satisfies Σ if B(C S) Σ a system C solves the control problem (S, Σ) if C is feedback composable with S S and C satisfy ( ) (non-blocking requirement) C S satisfies Σ Consider two systems S i = (X i, U i, F i ), i {1, 2} with U 2 U 1 a specification Σ 1 for S 1 a strict relation Q X 1 X 2 A specification Σ 2 (X 2 X 2) for S 2 is an abstract specification associated with S 2, S 1, Σ 1 and Q if for any (u, x 1, x 2) (U X 1 X 2) [0;T [, T N { } with We use (u, x 2) Σ 2 and t [0;T [ : (x 1(t), x 2(t)) Q implies (u, x 1) Σ 1 (S 1, Σ 1) Q (S 2, Σ 2)
23 23/33 Symbolic Synthesis As a direct consequence of the behavioral inclusion B(C (Q S 1)) B(C S 2) for any system C and the defintion of abstract specification we get: Theorem: Let (S 1, Σ 1) Q (S 2, Σ 2). If C solves (S 2, Σ 2) then C Q solves (S 1, Σ 1). S 2:abstraction S 1:system x 1 u x 2 u Q C:controller C:controller x 2
24 Robust Synthesis (Teaser: Details are in the Paper) We consider system S 1 = (X 1, U 1, F 1) u S 1 x P 4 y 1 specification Σ 1 for S 1 quantizer Q perturbations P 1 accounts for actuator imprecisions P 2 accounts for measurement noise P 3 and P 4 are useful to robustify the spec y 2 P 3 P 1 P 2 y c C Q u c We show how to construct Figure: Perturbed System auxiliary system Ŝ 1 auxiliary quantizer ˆQ auxiliary specification ˆΣ 1 so that if C ˆQ solves (Ŝ 1, ˆΣ 1) then the behavior of the Perturbed System satisfies Σ 1. C ˆQ can be computed by an abstract problem (S 2, Σ 2) that satisfies (Ŝ1, ˆΣ 1) ˆQ (S2, Σ2) 24/33
25 Computation of Abstractions of Perturbed Control Systems 25/33
26 Computation of Abstractions We focus on X 2 is a cover of X 1, i.e., X 2 is a set of non-empty subsets of X 1 and X 1 x2 X 2 x 2 x 1 every cell x 2 X 2 is a subset of X 1 the quantizer Q is the set membership relation for a given x 1 X 1 the quantizer Q picks x 2 X 2 in a non-deterministic fashion so that x 1 x 2 Let S i = (X i, U i, F i ) be two systems i {1, 2} X 2 be a cover by non-empty sets of X 1 Theorem: S 1 S 2 if and only if 1. U 2 U 1 and x 1 x 2 X 2 implies U S2 (x 2) U S1 (x 1) 2. x 2, x 2 X 2, u U S2 (x 2) and x 2 F 1(x 2, u) implies x 2 F 2(x 2, u) Computation of abstraction reduces to computation (overapproximation) of reachable sets! 26/33
27 27/33 Abstractions of Perturbed Control Systems We consider a differential inclusion ξ f (ξ, u) + W We cast the sample-and-hold behavior of ( ) with τ R >0 as system ( ) S 1 = (R n, R m, F 1) The abstraction S 2 = (X 2, U 2, F 2) is given by U 2 R m X 2 is a cover of R n x 1 F 1(x 1, u) all driven by constant u cells are hyper-rectangles with center c R n and radius r R n >0 x 2 = c + r, r = [c 1 r 1, c 1 + r 1]... [c n r n, c n + r n] we overapproximate the reachable set by another hyper-rectangle c + r, r F 1(c + r, r, u) c + r, r and then determine the cells c + r, r X 2 with c + r, r c + r, r
28 How to compute c and r? Theorem: consider ( ) and S 1 = (R n, R m, F 1 ) for τ R >0 u U and f (, u) is continuously differentiable disturbances W = w, w, w R n 0 a cell c + r, r K, with K R n is convex ξ sol. of ( ) and ξ(0) K = ξ(t) K for all t [0, τ] dom ξ let L R n n satisfy for all x K { D L i,j (u) j f i (x, u) if i = j D j f i (x, u) if i = j Then D j f i : partial derivative of f i w.r.t. jth component of 1st argument F 1 (c + r, r, u) c + r, r where c and r follow by the solution at time τ of c : ẏ = f (y, u) y(0) = c r : ż = Lz + w z(0) = r Overapproximation of reachable set is reduced to estimation of partial derivatives of f solution of two unperturbed initial value problems 28/33
29 29/33 Numerical Examples A planning problem for a mobile robot An aircraft landing maneuver
30 30/33 Reach-Avoid Specifications The desired behavior Σ in both exampels is defined in terms of three sets A init : the set of initial states A avoid : the set of obstacles A reach : the target set Given S = (X, U, F ), we define a reach-avoid specification Σ (U X ) for S by (u, x) Σ x(0) A init = T x(t ) A reach t [0;T ] x(t) A avoid Given Ŝ = ( ˆX, Û, ˆF ) with S Ŝ the abstract specificiation is defined by the reach-void specification induced by the sets  init = {ˆx ˆX ˆx A init }  avoid = {ˆx ˆX ˆx A avoid }  reach = {ˆx ˆX ˆx A reach }
31 Robot Path Planning unicylce/segway dynamics robot ξ 1 = u 1 cos(α + ξ 3) cos(α) 1 ξ 2 = u 1 sin(α + ξ 3) cos(α) 1 ξ 3 = u 1 tan(u 2) ξ 2 ξ 3 where α = arctan(tan(u 2)/2) ξ 1 and ξ 2 coordinates in the plane ξ 3 orientation u 1 forward velocity u 2 steering angle sampling time τ = 0.3 sec computation of S 2 = (X 2, U 2, F 2) number of states X number of inputs U 2 = 49 number of transitions computation times 2.33 sec to compute the abstract problem 0.22 sec to solve the abstract problem specification A init ξ 1 A avoid closed loop simulation A target 31/33
32 y x Aircraft Landing Maneuver aircraft dynamics aircraft ξ 1 = 1 m (u 1 cos u 2 D(u 2, ξ 1 ) mg sin ξ 2 ) ξ 2 = 1 mx 1 (u 1 sin u 2 + L(u 2, ξ 1 ) mg cos ξ 2 ) ξ 3 = ξ 1 sin ξ 2 ξ 1 forward velocity ξ 2 flight path angle ξ 3 altitude u 1 [ 0, ] engine thrust u 2 [0, 10 ] angle of attack actuator and measurement errors [ P 1(u) = (u , ] [ 0.25, 0.25 ] ) U P 2(x) = x + 1 [ 1 20 [ 0.25, 0.25] , 0.05 ] 1 20 [ 1, 1] sampling time τ = 0.25 sec computation of S 2 = (X 2, U 2, F 2) number of states X number of inputs U 2 = 20 number of transitions min to compute (S 2, Σ 2 ) 26 sec to solve (S 2, Σ 2 ) specification: steer the aircraft from 55 m close to the ground with a given total and horizontal touchdown velocity landing maneuver /33
33 33/33 Summary and Related Work We have seen Feedback refinement relations Solve general control problems via abstraction and refinement Account for various perturbations Computation of abstractions Related and ongoing work Abstraction-based solution of optimal control problems Combination of the computation of abstractions within existing toolboxes to solve synthesis problems with more complex specifications Various work to reduce the complexity of the computation of the abstraction compositional construction of abstractions merge the computation of the abstraction with the solution of the abstract control problem pick a cell radius so as to minimize number of transitions Gunther: local refinement of the abstract state space Gunther: Validated numerics: account for approximation errors in the solution of ODE and other computations...
Feedback Refinement Relations for the Synthesis of Symbolic Controllers
Reissig, Weber, and Rungger Feedback Refinement Relations for the Synthesis of Symbolic Controllers 1 Feedback Refinement Relations for the Synthesis of Symbolic Controllers Gunther Reissig, Alexander
More informationSENSE: Abstraction-Based Synthesis of Networked Control Systems
SENSE: Abstraction-Based Synthesis of Networked Control Systems Mahmoud Khaled, Matthias Rungger, and Majid Zamani Hybrid Control Systems Group Electrical and Computer Engineering Technical University
More informationAbstraction-based synthesis: Challenges and victories
Abstraction-based synthesis: Challenges and victories Majid Zamani Hybrid Control Systems Group Electrical Engineering Department Technische Universität München December 14, 2015 Majid Zamani (TU München)
More informationSynthesis via Sampling-Based Abstractions
Synthesis via Sampling-Based Abstractions Some Problems and Initial Ideas Matthias Rungger 2 Morteza Lahijanian 1 Lydia E Kavraki 1 Paulo Tabuada 2 Moshe Y Vardi 1 1 Department of Computer Science, Rice
More informationarxiv: v1 [cs.sy] 20 Nov 2017
DISSIPATIVITY OF SYSTEM ABSTRACTIONS OBTAINED USING APPROXIMATE INPUT-OUTPUT SIMULATION ETIKA AGARWAL, SHRAVAN SAJJA, PANOS J. ANTSAKLIS, AND VIJAY GUPTA arxiv:1711.07529v1 [cs.sy] 20 Nov 2017 Abstract.
More informationBisimilar Finite Abstractions of Interconnected Systems
Bisimilar Finite Abstractions of Interconnected Systems Yuichi Tazaki and Jun-ichi Imura Tokyo Institute of Technology, Ōokayama 2-12-1, Meguro, Tokyo, Japan {tazaki,imura}@cyb.mei.titech.ac.jp http://www.cyb.mei.titech.ac.jp
More informationLecture 8 Receding Horizon Temporal Logic Planning & Finite-State Abstraction
Lecture 8 Receding Horizon Temporal Logic Planning & Finite-State Abstraction Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 26 April 2012 Contents of the lecture: Intro: Incorporating continuous
More informationStability of Deterministic Finite State Machines
2005 American Control Conference June 8-10, 2005. Portland, OR, USA FrA17.3 Stability of Deterministic Finite State Machines Danielle C. Tarraf 1 Munther A. Dahleh 2 Alexandre Megretski 3 Abstract We approach
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More informationD(s) G(s) A control system design definition
R E Compensation D(s) U Plant G(s) Y Figure 7. A control system design definition x x x 2 x 2 U 2 s s 7 2 Y Figure 7.2 A block diagram representing Eq. (7.) in control form z U 2 s z Y 4 z 2 s z 2 3 Figure
More informationCHAPTER 1. Introduction
CHAPTER 1 Introduction Linear geometric control theory was initiated in the beginning of the 1970 s, see for example, [1, 7]. A good summary of the subject is the book by Wonham [17]. The term geometric
More informationONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies. Calin Belta
ONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies Provable safety for animal inspired agile flight Calin Belta Hybrid and Networked Systems (HyNeSs) Lab Department of
More informationLecture 7 : Generalized Plant and LFT form Dr.-Ing. Sudchai Boonto Assistant Professor
Dr.-Ing. Sudchai Boonto Assistant Professor Department of Control System and Instrumentation Engineering King Mongkuts Unniversity of Technology Thonburi Thailand Linear Quadratic Gaussian The state space
More informationCourse on Hybrid Systems
Course on Hybrid Systems Maria Prandini Politecnico di Milano, Italy Organizer and lecturer: Maria Prandini Politecnico di Milano, Italy maria.prandini@polimi.it Additional lecturers: CONTACT INFO Goran
More informationSCOTS: A Tool for the Synthesis of Symbolic Controllers
SCOTS: A Tool for the Synthesis of Symbolic Controllers Matthias Rungger Hybrid Control Systems Group Technical University of Munich matthias.rungger@tum.de Majid Zamani Hybrid Control Systems Group Technical
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 informationSolutions. Problems of Chapter 1
Solutions Problems of Chapter 1 1.1 A real square matrix A IR n n is invertible if and only if its determinant is non zero. The determinant of A is a polynomial in the entries a ij of A, whose set of zeros
More informationELEC4631 s Lecture 2: Dynamic Control Systems 7 March Overview of dynamic control systems
ELEC4631 s Lecture 2: Dynamic Control Systems 7 March 2011 Overview of dynamic control systems Goals of Controller design Autonomous dynamic systems Linear Multi-input multi-output (MIMO) systems Bat flight
More informationBALANCING-RELATED MODEL REDUCTION FOR DATA-SPARSE SYSTEMS
BALANCING-RELATED Peter Benner Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität Chemnitz Computational Methods with Applications Harrachov, 19 25 August 2007
More informationDiscrete abstractions of hybrid systems for verification
Discrete abstractions of hybrid systems for verification George J. Pappas Departments of ESE and CIS University of Pennsylvania pappasg@ee.upenn.edu http://www.seas.upenn.edu/~pappasg DISC Summer School
More informationSimulation and Bisimulation over Multiple Time Scales in a Behavioral Setting
2014 22nd Mediterranean Conference on Control and Automation (MED) University of Palermo. June 16-19, 2014. Palermo, Italy Simulation and Bisimulation over Multiple ime Scales in a Behavioral Setting Anne-Kathrin
More informationUsing Theorem Provers to Guarantee Closed-Loop Properties
Using Theorem Provers to Guarantee Closed-Loop Properties Nikos Aréchiga Sarah Loos André Platzer Bruce Krogh Carnegie Mellon University April 27, 2012 Aréchiga, Loos, Platzer, Krogh (CMU) Theorem Provers
More informationFunnel control in mechatronics: An overview
Funnel control in mechatronics: An overview Position funnel control of stiff industrial servo-systems C.M. Hackl 1, A.G. Hofmann 2 and R.M. Kennel 1 1 Institute for Electrical Drive Systems and Power Electronics
More informationThe Output Stabilization problem: a conjecture and counterexample
The Output Stabilization problem: a conjecture and counterexample Thomas I. Seidman Department of Mathematics and Statistics University of Maryland Baltimore County Baltimore, MD 21250, e-mail: seidman@math.umbc.edu
More informationRobustness Analysis of Networked Systems
Robustness Analysis of Networked Systems Roopsha Samanta The University of Texas at Austin Joint work with Jyotirmoy V. Deshmukh and Swarat Chaudhuri January, 0 Roopsha Samanta Robustness Analysis of Networked
More informationTRACKING AND DISTURBANCE REJECTION
TRACKING AND DISTURBANCE REJECTION Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 13 General objective: The output to track a reference
More informationEE Control Systems LECTURE 9
Updated: Sunday, February, 999 EE - Control Systems LECTURE 9 Copyright FL Lewis 998 All rights reserved STABILITY OF LINEAR SYSTEMS We discuss the stability of input/output systems and of state-space
More informationarxiv: v1 [math.oc] 22 Sep 2016
EUIVALENCE BETWEEN MINIMAL TIME AND MINIMAL NORM CONTROL PROBLEMS FOR THE HEAT EUATION SHULIN IN AND GENGSHENG WANG arxiv:1609.06860v1 [math.oc] 22 Sep 2016 Abstract. This paper presents the equivalence
More informationTime-Constrained Temporal Logic Control of Multi-Affine Systems
Time-Constrained Temporal Logic Control of Multi-Affine Systems Ebru Aydin Gol Calin Belta Boston University, Boston, MA 02215, USA e-mail: {ebru,cbelta}@bu.edu Abstract: We consider the problem of controlling
More informationObservability for deterministic systems and high-gain observers
Observability for deterministic systems and high-gain observers design. Part 1. March 29, 2011 Introduction and problem description Definition of observability Consequences of instantaneous observability
More informationarxiv: v2 [cs.sy] 16 Jun 2011
CONTROLLER SYNTHESIS FOR SAFETY AND REACHABILITY VIA APPROXIMATE BISIMULATION ANTOINE GIRARD arxiv:1010.4672v2 [cs.sy] 16 Jun 2011 Abstract. In this paper, we consider the problem of controller design
More informationCDS 101/110a: Lecture 8-1 Frequency Domain Design
CDS 11/11a: Lecture 8-1 Frequency Domain Design Richard M. Murray 17 November 28 Goals: Describe canonical control design problem and standard performance measures Show how to use loop shaping to achieve
More informationControl Hierarchies and Tropical Algebras
Control Hierarchies and Tropical Algebras Jörg Raisch 1,2, Xavier David-Henriet 1,2,3, Tom Brunsch 1,3, Laurent Hardouin 3 1 Fachgebiet Regelungssysteme Fakultät Elektrotechnik und Informatik, TU Berlin
More informationEECS C128/ ME C134 Final Wed. Dec. 14, am. Closed book. One page, 2 sides of formula sheets. No calculators.
Name: SID: EECS C128/ ME C134 Final Wed. Dec. 14, 211 81-11 am Closed book. One page, 2 sides of formula sheets. No calculators. There are 8 problems worth 1 points total. Problem Points Score 1 16 2 12
More information1 Kalman Filter Introduction
1 Kalman Filter Introduction You should first read Chapter 1 of Stochastic models, estimation, and control: Volume 1 by Peter S. Maybec (available here). 1.1 Explanation of Equations (1-3) and (1-4) Equation
More informationLecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016
Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,
More informationRegularity and approximations of generalized equations; applications in optimal control
SWM ORCOS Operations Research and Control Systems Regularity and approximations of generalized equations; applications in optimal control Vladimir M. Veliov (Based on joint works with A. Dontchev, M. Krastanov,
More informationOften, in this class, we will analyze a closed-loop feedback control system, and end up with an equation of the form
ME 32, Spring 25, UC Berkeley, A. Packard 55 7 Review of SLODEs Throughout this section, if y denotes a function (of time, say), then y [k or y (k) denotes the k th derivative of the function y, y [k =
More informationImpartial Anticipation in Runtime-Verification
Impartial Anticipation in Runtime-Verification Wei Dong 1, Martin Leucker 2, and Christian Schallhart 2 1 School of Computer, National University of Defense Technology, P.R.China 2 Institut für Informatik,
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
More informationAC&ST AUTOMATIC CONTROL AND SYSTEM THEORY SYSTEMS AND MODELS. Claudio Melchiorri
C. Melchiorri (DEI) Automatic Control & System Theory 1 AUTOMATIC CONTROL AND SYSTEM THEORY SYSTEMS AND MODELS Claudio Melchiorri Dipartimento di Ingegneria dell Energia Elettrica e dell Informazione (DEI)
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October 21, 2002 ee249
More informationQUANTIZED SYSTEMS AND CONTROL. Daniel Liberzon. DISC HS, June Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign
QUANTIZED SYSTEMS AND CONTROL Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign DISC HS, June 2003 HYBRID CONTROL Plant: u y
More informationarxiv: v1 [cs.sy] 26 Mar 2012
Time-Constrained Temporal Logic Control of Multi-Affine Systems Ebru Aydin Gol Calin Belta Boston University, Boston, MA 02215, USA e-mail: {ebru,cbelta}@bu.edu arxiv:1203.5683v1 [cs.sy] 26 Mar 2012 Abstract:
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationTesting System Conformance for Cyber-Physical Systems
Testing System Conformance for Cyber-Physical Systems Testing systems by walking the dog Rupak Majumdar Max Planck Institute for Software Systems Joint work with Vinayak Prabhu (MPI-SWS) and Jyo Deshmukh
More informationExam. 135 minutes, 15 minutes reading time
Exam August 6, 208 Control Systems II (5-0590-00) Dr. Jacopo Tani Exam Exam Duration: 35 minutes, 5 minutes reading time Number of Problems: 35 Number of Points: 47 Permitted aids: 0 pages (5 sheets) A4.
More informationControl Systems Design, SC4026. SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC426 SC426 Fall 2, dr A Abate, DCSC, TU Delft Lecture 5 Controllable Canonical and Observable Canonical Forms Stabilization by State Feedback State Estimation, Observer Design
More informationEECS C128/ ME C134 Final Wed. Dec. 15, am. Closed book. Two pages of formula sheets. No calculators.
Name: SID: EECS C28/ ME C34 Final Wed. Dec. 5, 2 8- am Closed book. Two pages of formula sheets. No calculators. There are 8 problems worth points total. Problem Points Score 2 2 6 3 4 4 5 6 6 7 8 2 Total
More informationCONTROL OF THE NONHOLONOMIC INTEGRATOR
June 6, 25 CONTROL OF THE NONHOLONOMIC INTEGRATOR R. N. Banavar (Work done with V. Sankaranarayanan) Systems & Control Engg. Indian Institute of Technology, Bombay Mumbai -INDIA. banavar@iitb.ac.in Outline
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Presented by Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October
More informationAdvanced Adaptive Control for Unintended System Behavior
Advanced Adaptive Control for Unintended System Behavior Dr. Chengyu Cao Mechanical Engineering University of Connecticut ccao@engr.uconn.edu jtang@engr.uconn.edu Outline Part I: Challenges: Unintended
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationLecture 19 Observability and state estimation
EE263 Autumn 2007-08 Stephen Boyd Lecture 19 Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time
More informationEE C128 / ME C134 Feedback Control Systems
EE C128 / ME C134 Feedback Control Systems Lecture Additional Material Introduction to Model Predictive Control Maximilian Balandat Department of Electrical Engineering & Computer Science University of
More informationRaktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Preliminaries
. AERO 632: of Advance Flight Control System. Preliminaries Raktim Bhattacharya Laboratory For Uncertainty Quantification Aerospace Engineering, Texas A&M University. Preliminaries Signals & Systems Laplace
More informationValue Function and Optimal Trajectories for some State Constrained Control Problems
Value Function and Optimal Trajectories for some State Constrained Control Problems Hasnaa Zidani ENSTA ParisTech, Univ. of Paris-saclay "Control of State Constrained Dynamical Systems" Università di Padova,
More informationDiscrete-state Abstractions of Nonlinear Systems Using Multi-resolution Quantizer
Discrete-state Abstractions of Nonlinear Systems Using Multi-resolution Quantizer Yuichi Tazaki and Jun-ichi Imura Tokyo Institute of Technology, Ōokayama 2-12-1, Meguro, Tokyo, Japan {tazaki,imura}@cyb.mei.titech.ac.jp
More informationPrashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides. Department of Chemical Engineering University of California, Los Angeles
HYBRID PREDICTIVE OUTPUT FEEDBACK STABILIZATION OF CONSTRAINED LINEAR SYSTEMS Prashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides Department of Chemical Engineering University of California,
More informationECE557 Systems Control
ECE557 Systems Control Bruce Francis Course notes, Version.0, September 008 Preface This is the second Engineering Science course on control. It assumes ECE56 as a prerequisite. If you didn t take ECE56,
More informationCommunication constraints and latency in Networked Control Systems
Communication constraints and latency in Networked Control Systems João P. Hespanha Center for Control Engineering and Computation University of California Santa Barbara In collaboration with Antonio Ortega
More informationDistributed and Real-time Predictive Control
Distributed and Real-time Predictive Control Melanie Zeilinger Christian Conte (ETH) Alexander Domahidi (ETH) Ye Pu (EPFL) Colin Jones (EPFL) Challenges in modern control systems Power system: - Frequency
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 informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationChapter 7 Control. Part State Space Control. Mobile Robotics - Prof Alonzo Kelly, CMU RI
Chapter 7 Control Part 2 7.2 State Space Control 1 7.2 State Space Control Outline 7.2.1 Introduction 7.2.2 State Space Feedback Control 7.2.3 Example: Robot Trajectory Following 7.2.4 Perception Based
More informationIEOR 265 Lecture 14 (Robust) Linear Tube MPC
IEOR 265 Lecture 14 (Robust) Linear Tube MPC 1 LTI System with Uncertainty Suppose we have an LTI system in discrete time with disturbance: x n+1 = Ax n + Bu n + d n, where d n W for a bounded polytope
More informationThe i/s/o resolvent set and the i/s/o resolvent matrix of an i/s/o system in continuous time
21st International Symposium on Mathematical Theory of Networks and Systems July 7-11, 2014. The i/s/o resolvent set and the i/s/o resolvent matrix of an i/s/o system in continuous time Damir Z. Arov 1,
More informationSymbolic Control of Incrementally Stable Systems
Symbolic Control of Incrementally Stable Systems Antoine Girard Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France Workshop on Formal Verification of Embedded Control Systems LCCC,
More informationIntroduction to Modern Control MT 2016
CDT Autonomous and Intelligent Machines & Systems Introduction to Modern Control MT 2016 Alessandro Abate Lecture 2 First-order ordinary differential equations (ODE) Solution of a linear ODE Hints to nonlinear
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationLecture Note 13:Continuous Time Switched Optimal Control: Embedding Principle and Numerical Algorithms
ECE785: Hybrid Systems:Theory and Applications Lecture Note 13:Continuous Time Switched Optimal Control: Embedding Principle and Numerical Algorithms Wei Zhang Assistant Professor Department of Electrical
More informationFall 線性系統 Linear Systems. Chapter 08 State Feedback & State Estimators (SISO) Feng-Li Lian. NTU-EE Sep07 Jan08
Fall 2007 線性系統 Linear Systems Chapter 08 State Feedback & State Estimators (SISO) Feng-Li Lian NTU-EE Sep07 Jan08 Materials used in these lecture notes are adopted from Linear System Theory & Design, 3rd.
More informationMonotone Control System. Brad C. Yu SEACS, National ICT Australia And RSISE, The Australian National University June, 2005
Brad C. Yu SEACS, National ICT Australia And RSISE, The Australian National University June, 005 Foreword The aim of this presentation is to give a (primitive) overview of monotone systems and monotone
More informationObservability and state estimation
EE263 Autumn 2015 S Boyd and S Lall Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time observability
More informationDynamic and Adversarial Reachavoid Symbolic Planning
Dynamic and Adversarial Reachavoid Symbolic Planning Laya Shamgah Advisor: Dr. Karimoddini July 21 st 2017 Thrust 1: Modeling, Analysis and Control of Large-scale Autonomous Vehicles (MACLAV) Sub-trust
More informationModeling and Analysis of Dynamic Systems
Modeling and Analysis of Dynamic Systems Dr. Guillaume Ducard Fall 2017 Institute for Dynamic Systems and Control ETH Zurich, Switzerland G. Ducard c 1 / 57 Outline 1 Lecture 13: Linear System - Stability
More informationA Hybrid Systems Approach to Trajectory Tracking Control for Juggling Systems
A Hybrid Systems Approach to Trajectory Tracking Control for Juggling Systems Ricardo G Sanfelice, Andrew R Teel, and Rodolphe Sepulchre Abstract From a hybrid systems point of view, we provide a modeling
More informationEquivalence of dynamical systems by bisimulation
Equivalence of dynamical systems by bisimulation Arjan van der Schaft Department of Applied Mathematics, University of Twente P.O. Box 217, 75 AE Enschede, The Netherlands Phone +31-53-4893449, Fax +31-53-48938
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 14: Controllability Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 14: Controllability p.1/23 Outline
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationGradient Sampling for Improved Action Selection and Path Synthesis
Gradient Sampling for Improved Action Selection and Path Synthesis Ian M. Mitchell Department of Computer Science The University of British Columbia November 2016 mitchell@cs.ubc.ca http://www.cs.ubc.ca/~mitchell
More informationRealization theory for systems biology
Realization theory for systems biology Mihály Petreczky CNRS Ecole Central Lille, France February 3, 2016 Outline Control theory and its role in biology. Realization problem: an abstract formulation. Realization
More informationSelected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.
. Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,
More informationOverview of the Seminar Topic
Overview of the Seminar Topic Simo Särkkä Laboratory of Computational Engineering Helsinki University of Technology September 17, 2007 Contents 1 What is Control Theory? 2 History
More informationHybrid Systems Course Lyapunov stability
Hybrid Systems Course Lyapunov stability OUTLINE Focus: stability of an equilibrium point continuous systems decribed by ordinary differential equations (brief review) hybrid automata OUTLINE Focus: stability
More informationHybrid Systems - Lecture n. 3 Lyapunov stability
OUTLINE Focus: stability of equilibrium point Hybrid Systems - Lecture n. 3 Lyapunov stability Maria Prandini DEI - Politecnico di Milano E-mail: prandini@elet.polimi.it continuous systems decribed by
More informationACM/CMS 107 Linear Analysis & Applications Fall 2016 Assignment 4: Linear ODEs and Control Theory Due: 5th December 2016
ACM/CMS 17 Linear Analysis & Applications Fall 216 Assignment 4: Linear ODEs and Control Theory Due: 5th December 216 Introduction Systems of ordinary differential equations (ODEs) can be used to describe
More informationTrajectory-tracking control of a planar 3-RRR parallel manipulator
Trajectory-tracking control of a planar 3-RRR parallel manipulator Chaman Nasa and Sandipan Bandyopadhyay Department of Engineering Design Indian Institute of Technology Madras Chennai, India Abstract
More informationApproximate Bisimulations for Constrained Linear Systems
Approximate Bisimulations for Constrained Linear Systems Antoine Girard and George J Pappas Abstract In this paper, inspired by exact notions of bisimulation equivalence for discrete-event and continuous-time
More informationCONTROL DESIGN FOR SET POINT TRACKING
Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded
More informationApproximate Time-Optimal Control via Approximate Alternating Simulations
21 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 3-July 2, 21 WeB7.2 Approximate Time-Optimal Control via Approximate Alternating Simulations Manuel Mazo Jr and Paulo Tabuada
More informationLecture 5 Linear Quadratic Stochastic Control
EE363 Winter 2008-09 Lecture 5 Linear Quadratic Stochastic Control linear-quadratic stochastic control problem solution via dynamic programming 5 1 Linear stochastic system linear dynamical system, over
More informationExponential stability of families of linear delay systems
Exponential stability of families of linear delay systems F. Wirth Zentrum für Technomathematik Universität Bremen 28334 Bremen, Germany fabian@math.uni-bremen.de Keywords: Abstract Stability, delay systems,
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More informationANALYZING REAL TIME LINEAR CONTROL SYSTEMS USING SOFTWARE VERIFICATION. Parasara Sridhar Duggirala UConn Mahesh Viswanathan UIUC
ANALYZING REAL TIME LINEAR CONTROL SYSTEMS USING SOFTWARE VERIFICATION Parasara Sridhar Duggirala UConn Mahesh Viswanathan UIUC Real-Time Systems Linear Control Systems Verification Verification Control
More informationChapter 3. State Feedback - Pole Placement. Motivation
Chapter 3 State Feedback - Pole Placement Motivation Whereas classical control theory is based on output feedback, this course mainly deals with control system design by state feedback. This model-based
More informationA Separation Principle for a Class of Hybrid Automata on a Partial Order
2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 ThC12.4 A Separation Principle for a Class of Hybrid Automata on a Partial Order Domitilla Del Vecchio, Michael
More informationEL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)
EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the
More informationCOMBINED ADAPTIVE CONTROLLER FOR UAV GUIDANCE
COMBINED ADAPTIVE CONTROLLER FOR UAV GUIDANCE B.R. Andrievsky, A.L. Fradkov Institute for Problems of Mechanical Engineering of Russian Academy of Sciences 61, Bolshoy av., V.O., 199178 Saint Petersburg,
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More information