Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)

Similar documents
Topic # Feedback Control Systems

Here represents the impulse (or delta) function. is an diagonal matrix of intensities, and is an diagonal matrix of intensities.

EE C128 / ME C134 Final Exam Fall 2014

minimize x subject to (x 2)(x 4) u,

Lecture 5: Linear Systems. Transfer functions. Frequency Domain Analysis. Basic Control Design.


LQR, Kalman Filter, and LQG. Postgraduate Course, M.Sc. Electrical Engineering Department College of Engineering University of Salahaddin

Written Examination

2.098/6.255/ Optimization Methods Practice True/False Questions

Linear State Feedback Controller Design

Introduction to Controls

Final Exam Solutions

Introduction. Performance and Robustness (Chapter 1) Advanced Control Systems Spring / 31

6 OUTPUT FEEDBACK DESIGN

EECS C128/ ME C134 Final Thu. May 14, pm. Closed book. One page, 2 sides of formula sheets. No calculators.

5 Handling Constraints

Automatic Control II Computer exercise 3. LQG Design

OPTIMAL CONTROL AND ESTIMATION

Homework Solution # 3

Gradient Descent. Dr. Xiaowei Huang

sc Control Systems Design Q.1, Sem.1, Ac. Yr. 2010/11

State Regulator. Advanced Control. design of controllers using pole placement and LQ design rules

Lecture 18: Optimization Programming

MAS107 Control Theory Exam Solutions 2008

Time Response Analysis (Part II)

Module 3F2: Systems and Control EXAMPLES PAPER 2 ROOT-LOCUS. Solutions

(Continued on next page)

Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control

ME 375 Final Examination Thursday, May 7, 2015 SOLUTION


Semidefinite Programming Duality and Linear Time-invariant Systems

(b) A unity feedback system is characterized by the transfer function. Design a suitable compensator to meet the following specifications:

CONTROL DESIGN FOR SET POINT TRACKING

4TE3/6TE3. Algorithms for. Continuous Optimization

Control Systems Design

FEEDBACK CONTROL SYSTEMS

ECEN 605 LINEAR SYSTEMS. Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability 1/27

Return Difference Function and Closed-Loop Roots Single-Input/Single-Output Control Systems

EL2520 Control Theory and Practice

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints

Modern Optimal Control

CDS Solutions to Final Exam

Übersetzungshilfe / Translation aid (English) To be returned at the end of the exam!

Chapter 9 Observers, Model-based Controllers 9. Introduction In here we deal with the general case where only a subset of the states, or linear combin

D(s) G(s) A control system design definition

Nonlinear Optimization: What s important?

Nonlinear Optimization for Optimal Control

LMI Methods in Optimal and Robust Control

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67

Professor Fearing EE C128 / ME C134 Problem Set 7 Solution Fall 2010 Jansen Sheng and Wenjie Chen, UC Berkeley

Iterative Controller Tuning Using Bode s Integrals

Algorithms for constrained local optimization

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)

FEL3210 Multivariable Feedback Control

100 (s + 10) (s + 100) e 0.5s. s 100 (s + 10) (s + 100). G(s) =

Problem Set 3: Solution Due on Mon. 7 th Oct. in class. Fall 2013

Chapter 5 HW Solution

Übersetzungshilfe / Translation aid (English) To be returned at the end of the exam!

MODERN CONTROL DESIGN

Classify a transfer function to see which order or ramp it can follow and with which expected error.

Review: transient and steady-state response; DC gain and the FVT Today s topic: system-modeling diagrams; prototype 2nd-order system

R10 JNTUWORLD B 1 M 1 K 2 M 2. f(t) Figure 1

Lab 3: Quanser Hardware and Proportional Control

Control of Manufacturing Processes

Algorithms for Constrained Optimization

ESC794: Special Topics: Model Predictive Control

FEL3210 Multivariable Feedback Control

CS711008Z Algorithm Design and Analysis

Controls Problems for Qualifying Exam - Spring 2014

R a) Compare open loop and closed loop control systems. b) Clearly bring out, from basics, Force-current and Force-Voltage analogies.

Linear Algebra. P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015

Singular Value Decomposition Analysis

MAE 143B - Homework 9

IE 5531: Engineering Optimization I

Interior Point Methods for Mathematical Programming

Convex Optimization. Prof. Nati Srebro. Lecture 12: Infeasible-Start Newton s Method Interior Point Methods

Lecture 9. Introduction to Kalman Filtering. Linear Quadratic Gaussian Control (LQG) G. Hovland 2004

Appendix A: Exercise Problems on Classical Feedback Control Theory (Chaps. 1 and 2)

CHAPTER 2: QUADRATIC PROGRAMMING

Constrained Optimization and Lagrangian Duality

Bangladesh University of Engineering and Technology. EEE 402: Control System I Laboratory

Vector Derivatives and the Gradient

, b = 0. (2) 1 2 The eigenvectors of A corresponding to the eigenvalues λ 1 = 1, λ 2 = 3 are

Chapter 7. Digital Control Systems

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Control Systems. University Questions

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

(a) Find the transfer function of the amplifier. Ans.: G(s) =

Contents lecture 6 2(17) Automatic Control III. Summary of lecture 5 (I/III) 3(17) Summary of lecture 5 (II/III) 4(17) H 2, H synthesis pros and cons:

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

Module 02 CPS Background: Linear Systems Preliminaries

ECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko

An Inexact Newton Method for Nonlinear Constrained Optimization

Robust Multivariable Control

Optimization and Root Finding. Kurt Hornik

Chapter 3. LQ, LQG and Control System Design. Dutch Institute of Systems and Control

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

Applications of Linear Programming

EEE582 Homework Problems

The output voltage is given by,

Transcription:

Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must be at least 6cm. in radius. The surface area of the sides must not be greater than 8cm 2 (ignore the area of the bottom of the mug and ignore the mug handle). Formulate the optimum design problem. R H Ignore bottom surface Figure : Oil mug 2. A refinary has two crude oils: (a) Crude A cost Rs. 8 per barrel and 5 barrel are available. (b) Crude B costs Rs. 22 per barrel and 25 barrel are available. The company manufactures gasoline and lube oil from the crude oils. Yield and sale price per barrel of the product and markets are shown in Table. How much crude oils should the company use to maximize its profit? Formulate the optimum design problem. Yield/barrel Yield/barrel Product Crude A Crude B Sale Price Market per bbl(rs.) (bbl) Gasoline.5.7 28 2 Lube oil.5.3 75 8 3. A company manufactures two types of products X and Y, sells them at a profit of Rs.8 type on X and Rs. on type Y. Each product is processed on two machines A and B. Type X (product) requires, 4 minutes of processing time on A (machine) and 6 minutes on B type. Type Y (product) requires 4 minutes on A (machine)and 4 minutes on B. The machine, A is available for not more than 6 hours 3 minutes, while machine B is available for hours during any working day. Maximize the profit on the products X and Y where x = number of products of type X and x 2 =number of products of type Y. Formulate the problem as a linear optimization problem. 4. Two electric generators are interconnected to provide total power to meet the load. Each generator s cost is a function of the power output, as shown in fig.2. All costs and power are expressed on a per unit basis. The total power needed is at least 6 units. Formulate a minimum cost design problem to determine the power outputs P and P 2.

Gen Gen 2 Load Cost, C 2 Cost, C 2 C = P + P P P 2 C 2 =+.6 2 + 2 P 2 Power, P Power, P 2 Figure 2: Power generator 5. Consider the standard bridge circuit shown in fig.3. The power delivered by the batteries is P b and power consumed by the resistors is P r. Formulate the solution to the optimization problem of Minimizing P r with respect to the currents (i, i 2, i 3 ) and subject to the constraints that will yield the Kirchhoff s loop equations. R4 i2 R5 R E2 i3 R2 E i R3 R6 Figure 3: A bridge circuit 6. The shortest length l between a given point x = x x 2 T and a given line a + a x + a 2 x 2 = is expressed as l = at x b a T a. Derive the expression by formulating the problem in optimization framework where a = a a 2 T, b = a and x = x x 2 T is any point on the line. 7. Determine the dimensions for building a minimum cost cylindrical refrigeration tank of volume 6 m 3, if the cylindrical ends cost Rs.7./m 2, cylindrical wall costs Rs.45./mm 2, and it costs Rs.6./mm 2 to refrigerate over the useful life. 8. Sketch the feasible space on a graph paper for each of the following independent constraints, given that x, x 2 (i) 3x + x 2 6 (ii)x 2x 2 5 9. Sketch the feasible solution space of the following optimization problem Maximizef(x, x 2 ) = f(x) = 5x + 4x 2 subject to 6x + 4x 2 24 2

x + 2x 2 6 x + x 2 x 2 2 x, x 2 Using graphical method and hence obtain the maximum value of the function f(x, x 2 ).. Find the stationary points for the following functions. (a) f(x) = x 2 28.6x + 22 (b) f(x, x 2 ) = 3x 2 + 2x 2 2 + 2x x 2 + 7 (c) f(x, x 2 ) = x 2 + x 2 2 + x x 2 (d) f(x, x 2 ) = 3x 2 + 5x 2 2 2x x 2 + 8x 2 (e) f(x, x 2 ) = 3x 2 5x 2 2 + 2x x 2 8x 2 (f) f(x, x 2, x 3 ) = x 2 + 2x 2 2 + 3x 2 3 + x x 2 2x 2 x 3 (g) f(x, x 2, x 3 ) = x 2 2x 2 2 3x 2 3 x x 2 + 2x 2 x 3 Also determine the local minimum, local maximum, and inflection (saddle) points ( inflection or saddle points are those points that are neither minimum nor maximum). Find the function values around the stationary points and plot them. Comments whether the following functions are unimodal around the stationary points.. Suppose f(x) is a convex function, and a, b dom f with a < b (a) Show that for all x a, b. (b) Show that for all (c) Suppose f(x) f(x) f(a) x a b x b a f(a) + x a b a f(b) f(b) f(a) b a f(b) f(x) b x x a, b. Draw a sketch that illustrates this inequality. f(x) is differentiable. Use the result in 2 (b) to show that f(x) f(b) f(a) b a f(b) (d) Suppose f(x) is twice differentiable. Use the result in 2 (c) to show that f (a) and f (b) 2. Determine the nature ( i.e -ve definite (semi-definite) function, or +ve definite (semi-definite) function, or indefinite function )of the following quadratic forms: (a) f(x) = x 2 + 4x 2 x 2 + 2x x 2 7x 2 2 6x 2 x 3 + 5x 2 3 (b) f(x) = x 2 x 2 2 2x 2 x 3 + x 2 3 (c) f(x) = 2x 2 + 2x 2 2 2x x 3 + 3x 2 3 + x x 2 3

3. Consider the following problem with equality constraints: Minimize, (x ) 2 + (x 2 ) 2 (a) Is it a valid optimization problem? Explain. subject to x + x 2 4 = x x 2 2 = (b) Explain how you would solve the problem? Are necessary conditions needed to find the optimum solution? 4. Solve the following problems graphically. Check necessary and sufficient conditions for candidate local minimum points and verify them on the graph for the problem. (a) Minimize f(x, x 2 ) = 4x 2 + 3x 2 2 5x x 2 8x subject to x + x 2 = 4 (b) Minimize f(x, x 2 ) = 4x 2 + 3x 2 2 5x x 2 8x subject to x + x 2 4 (c) Minimize f(x, x 2 ) = 3x 2 + 5x 2 2 2x x 2 + 8x 2 subject to x 2 x 2 2 + 8x 2 6 5. Show that a general form for a quadratic function is f(x n ) = x T P x + b T x + c where, C is a scalar and b is an n vector. 6. Compute the optimum values of the function f(x) = 5x 6 36x 5 + 65 2 x4 6x 3 + 36 7. Consider the where, x = x, f(x 2 ) = 2x 2 + 4x x 2 + x 2 2 + 3x + 4x 2 + 7 = x T P x + b T x + c x 2 T (a) Find the matrix P 2 2, vector b 2 and the scalar quantity c. (b) Check the nature of the function. (c) Find all points that satisfy the first-order necessary condition for f(x) to be optimal. (d) Does the function f(x) have a minimizer? explain why it does not. 8. Consider the following functions: If it does, then find all minimizer(s); otherwise (a) minimize f(x, x 2 ) = 3x 2 4x x 2 + 2x 2 2 + 4x + 6 with starting point x () =., and x () 2 =. (b) minimize f(x, x 2 ) = x 2 x x 2 + x 2 2 with starting point x () =., and x () 2 =.5 (c) maximize f(x, x 2 ) = x 2 + x x 2 3x 2 2 with starting point x () =., and x () 2 = 2 (d) minimize f(x, x 2 ) = 2.x 2.73x x 2 + 2.5x 2 2 with starting point x () =., and x () 2 = (e) minimize f(x, x 2, x 3 ) = x 2 +2x x 2 +2x 2 x 3 +2x 2 2 +2x 2 3 with starting point x () =., and x () 2 = and x 3 =. using (i) Steepest Descent Method (ii) Conjugate Gradient Method (iii) Newton s Method. For each method show only three iterations and hence make your comments. 9. Find the points satisfying KKT necessary conditions for the followings, Check if they are optimum points using the graphical method (if possible). 4

(a) Minimize f(x, x 2 ) = 4x 2 + 3x 2 2 5x x 2 8x ; subject to x + x 2 = 4 (b) Minimize f(x, x 2 ) = (x ) 2 + (x 2 ) 2 ; subject to x + x 2 = 4 (c) Maximum f(x, x 2 ) = 4x 2 + 3x 2 2 5x x 2 8; subject to x + x 2 = 4 (d) Minimize f(x, x 2 ) = (x 3) 2 + (x 2 3) 2 ; subject to x + x 2 4 and x 3x 2 = (e) Minimize f(x, x 2 ) = 3x 2 + 5x 2 2 2x x 2 + 8x ; subject to x 2 x 2 2 + 8x 2 6 2. Consider the circuit in fig.4 Formulate and solve the KKT for the following problems:( Assume i is the current following through the circuit.) R 2 volts Figure 4: A resistive circuit (a) Find the value of the resistance R such that the power absorbed by this resistor is maximized. (b) Find the value of the resistance R such that the power delivered to the Ω resistor is maximized. 5

Assignment-2 (Related to Lecture notes -22) 2. Convert the following problems to the standard linear programming (LP) problem. (a) Maximize f = x + 2x 2 subject to x + 3x 2 x x 2 2 x + x 2 6 x + 3x 2 6 x, x 2 (b) Minimize f = x + 4x 2 subject to x + 2x 2 5 2x + x 2 = 4 x x 2 3 x, x 2 unrestricted in sign 22. Solve the following problems by the Simplex method and verify the solution graphically whenever possible. (a) Maximize f = x +.5x 2 subject to 6x + 5x 2 3 3x + x 2 2 x + 3x 2 2 x, x 2 (b) Maximize f = 5x 2x 2 subject to 2x + x 2 9 x x 2 2 3x + 2x 2 3 x, x 2 (c) Minimize f = 5x + 4x 2 x 3 subject to x + 2x 2 x 3 2x + x 2 + x 3 4 x, x 2 ; x 3 is unrestricted in sign (d) Maximize f = x + 4x 2 subject to x + 2x 2 5 2x + x 2 = 4 x x 2 x, x 2 ; 6

23. Write the dual problems for the following problems and solve the dual the problems and recover the values of the primal variables from the final dual tableau. (a) Maximize z(x, x 2 ) = x + 4x 2 subject to x + 2x 2 5 x + x 2 = 4 x x 2 3 x, x 2 (b) Minimize f(x, x 2 ) = 2x 6x 2 subject to 3x x 2 3 4x + 3x 2 = 8 x, x 2 24. Consider the problem of Minimize f(x, x 2 ) = x 2 + 4x 2 2 8x 6x 2, subject to x + x 2 5, x 2 3, x ;, x 2 (a) Is this problem a quadratic programming problem (QPP)? Justify your answer. (b) Express the objective function in standard QPP form. (c) Convert the above QPP into an equivalent standard linear programming problem. 25. Solve the following Quadratic programming problems using KKT condition (see lecture notes- 22) (a) Minimize f(x, x 2 ) = (x ) 2 + (x 2 ) 2 2x 2 + 2, subject to x + x 2 4, x ;, x 2 (b) Minimize f(x, x 2 ) = 2x 2 + 9x 2 2 + 6x x 2 8x + 9x 2, subject to x 2x 2, 4x 3x 2 2 x ;, x 2 7

Assignment-3 (Related to Lecture notes 23-29) 26. Solve the problems, (a) Maximize f(x, x 2 ) = x + 2x 2, subject to x + x 2 8, x ;, x 2 (b) Maximize f(x, x 2 ) = 4x + 2x 2, subject to x + x 2, x 2 5 x ;, x 2 using interior point method based on centering scheme. Assume the initial trial solution for(a) as x = 2 2 4 T and for(b) as x = 3 3 4 2 T. Show only one iteration. 27. Solve the following problems (a) Minimize f(x) = x 2 + x 2, subject to x 2 + x 2 2, using the logarithm barrier function method (interior penalty method). Apply (i) Analytical implementation method (ii) Numerical implementation method with λ k+ =.λ k, for k =,, 2. Assume λ =.. (b) Minimize f(x) = 3x 2 + x 2 2 ; where x = x x 2 T subject to g(x) = 2 x x 2 ; x > and x 2 > applying the logarithmic interior penalty method and hence estimate Lagrange multiplier using the expression µ τ = lim k k ; where τ g k is the penalty coefficient. 28. Solve the following problems (a) Minimize f(x, x 2 ) = (x 4) 2 + (x 2 4) 2 ; subject to g(x) = 5 x x 2 using exterior point method. Show the calculations only for two iterations, the penalty coefficients values at two successive iterations are considered as τ = and τ = respectively. (b) Minimize f(x) = 3x 2 + x 2 2 ; where x = x x 2 T using the exterior point method. subject to g(x) = 2 x x 2 ; x > and x 2 >. 8

Assignment-4 (Related to Lecture notes 3-52) 29. Find the variations of the functionals: (a) v(x (t), x 2 (t)) = π/2 (x 4 (t) + 2x 2 (t)x 2 2(t) + x 2 2(t))dt, (b) v(x (t), x 2 (t)) = (e(x (t) x 2 (t)) e (x (t)+x 2 (t)) )dt. 3. Find the equations of the curves that are extremals for the functional for the boundary conditions v(x(t)) = tf (a) x() =, t f = 2, and x(2) = ; (b) x() =, t f =, and x() is free. ( 4ẋ2 (t) tẋ(t) x(t) + 2 x(t)ẋ(t))dt 3. Find the equation of the curve that is an extremal for the functional v(x(t)) = tf ( 2ẋ2 (t) tẋ(t) + 2x 2 (t))dt subject to boundary conditions x() = 3/4, t f =., and x() is free. 32. Given a dynamical system model ẋ(t) = x(t) + u(t); and y(t) = 2 x(t) and the associated performance index J = (a) Assuming that u(t) = Kx(t) is such that systems. (y 2 (t) + u 2 (t))dt (b) Assume that x() = 2 T, find the optimal value of J. J is minimized, find the poles of the closed-loop (c) Obtained the gain and phase margins of the closed loop system while the controller is designed based on LQR. 33. Show that if λ is an eigenvalue of the Hamiltonian matrix H, then so is λ. 34. Given the Hamiltonian matrix corresponding to a dynamical system and its associated performance index. The Hamiltonian matrix is A BR H = B T 2 5 Q A T = 2 and its eigenvalues are λ = 3, and λ 2 = 3 respectively. (a) Find the solution to A.R.E using eigenvalue-eigenvector method. (b) Write the equation of the closed-loop system driven by the optimal controller. 9

35. For the standard infinite horizon (LQR) control problem, the optimal controller gain (k) is given as k = 3.6 2.5, for the corresponding system and weighting matrices are described below: A =...., b =, Q = (a) Obtain the Kalman s return difference identity. (b) Compute gain and phase margin of the closed loop system. 36. Consider a dynamical system model and the cost function do the following. J = 2 8x2 () + 2 ẋ(t) = x(t) + u(t) (3x 2 (t) + u 2 (t))dt (a) Generate the Hamiltonian matrix for this control problem (b) Generate the Riccati equation for this control problem (c) Solve the optimal feedback gain. (d) Obtain the steady state solution of the optimal gain. (e) What is the pole of the closed-loop system at steady state gain?, and R =. (f) How does this closed-loop pole change if the state weighting matrix is increased by a factor of? 37. (a) Suppose that λ i is an eigenvalue of the matrix A BR B T P and v i is the corresponding eigenvector, wherep is the symmetric positive definite solution of the A.R.E. Show that v T i (P v i ) T T is an eigenvector of the associated Hamiltonian matrix corresponding to the eigenvalue λ i. (b) Show that if Q = Q T >, then the real parts of the eigen values of the matrix A BR B T P are all negative, where P = P T > is solution of the associated A.R.E. 38. Design a system for controlling the shaft angle of a dc motor. The entire state is measured and be used to generate the motor control voltage. A block diagram for the dc motor is shown in fig.5. U(s) _.2 /s Angular velocity /s Angular position Figure 5: A position control System Assume θ(t) is the motor shaft angular position(angle)and U(t) is the dc voltage applied to the motor. Design a controller that minimizes the cost function.

J(x(t), U(t)) = 2.4 (θ 2 (t) + 8 u 2 (t))dt (a) Simulate the closed-loop system with an initial shaft position of θ= degree and an initial shaft velocity θ of zero. (b) Using the steady state gains, simulate the closed-loop system with the same initial conditions. (c) Plot the plant state and the control input for these two simulations and compare the results. 39. Given the following model of dynamic systems: (a) ẋ (t) = x 2 (t) + 5 ẋ 2 (t) = u(t) (b) ẋ (t) = x 2 (t) ẋ 2 (t) = x 2 (t) + u(t) where u(t). The performance index to be minimized is J = tf dt = t f Find the state feedback control law u = u(x, x 2 ) that minimizes J and drives the system from a given initial condition x() = 2 T to the final state x(t f ) =. Proceed as indicated below: (i) Derive the equations of the optimal trajectories. (ii) Derive the equation of the switching curve. (iii)write the expression for the optimal state-feedback controller. (iv)draw an implementable control scheme to realize such a controller in practice. 4. Consider a dynamic system ẋ(t) = 3 4 x(t) + u(t) + 6 3 ω(t); and y(t) = 2 x(t) + η(t) Assume the state and input weighting matrices of LQR parameters are given as Q = 5I 2 2 and R = 5. The input and output noises are considered to be zero mean white noise Gaussian processes with known input and output noise covariances as Ω =.3I 2 2 and V =.2 respectively. Design a controller u(t) = K ˆx(t) based on Kalman filter. (a) Compute the controller gain K. (b) Compute Kalman filter gain L. (c) Compute gain and phase margins of the system and draw the Nyquist plot overlaid on the unit circle centered at the origin. (d) Plot the response of the closed loop system with designed estimator based controller. (e) Show the implementation scheme of Kalman filter based controlled system. (f) Design LQR controller for the same system and compare the gain and phase margins that are obtained in (c).

Assignment-5 (Related to Lecture notes 53-6) 4. Consider a true plant G(s) = 3e.s (2s + )(.s + ) 2 Obtain the additive uncertainty function (weight) a (s) and sketch its magnitude for all frequencies ω, when the nominal model is G(s) = 3 (2s+) 42. The nominal plant of a unity feedback control system is described as G m (s) = and the (s+2)(s+5) controller K(s) = k is placed in the forward path. Using small-gain theorem, find the maximum s value of k for which closed-loop system will be robustly stable while the bound of the multiplicative model uncertainty is m (s) =.25(+4s). (+.25s) 43. Consider the system shown in Fig.6 and assume the actual plant is given by R(s) + u m + v + Y(s) G m (s)= s 2 H(s)= 2(s+) (s 2 +s+) Figure 6: An uncertain SISO System G(s) = 2(s + 2) s 2 (s 2 + s + ) (a) Find a multiplicative uncertainty model for the system. (b) Find M(s), the transfer function as seen by the multiplicative uncertainty. (c) Determine if the closed-loop system is robustly stable under the multiplicative uncertainty (computed in (i).) using small-gain theorem 44. Consider the system shown in Fig.7. Plant, G(s) Controller r(t) + _ v K(s) u y d (s++ δ ) (s++ δ 2 ) y Figure 7: A SISO closed loop System (a) Draw a block diagram of the plant in standard form of a general system P (s) with uncertainties ( = diag.δ δ 2 ). 5 (b) Convert N structure (i.e. uncertain feedback system) where = diag.δ δ 2 and N(s) = F (P (s), K(s)). 5 2

45. Consider the following nominal system stable (i.e without uncertainties): ẋ(t) =. x(t) + 6 + 9 + 2 3 + 3 u(t); where, 2 and 3 are uncertainties. Decompose the system as the nominal system (A, B) and uncertainty as shown in Figure 8. Use the Small-Gain theorem to find the bound on the uncertainty that guarantees the stability of the system. w e u (A,B) z Figure 8: An uncertain System 46. For the system Ẋ(t) = X + and y = X (a) Calculate the H 2 -norm of the trasfer function G(s) of the above system using the method based on the Lyapunov equation. (b) Evaluate of H 2 -norm of G(s) using Cauchy residue theorem. (c) Calculate H norm of G(s) by hand computation. 47. For the system G(s) = (s+2) 2 (s+)(s+2) (s+2) 2 (s+2) 2 ; Compute and plot (i) the maximum ( σ) (ii) minimum (σ) singular values (SVD) of the T.F matrix G(jω) for. ω and hence obtain G(jω). Calculate the G(jω) directly using the MatLab command. Compare the result obtained in previous step. 48. For the system ẋ(t) = 6. 9... x(t) + u(t); y(t) =. 2. x(t) Compute (i) G(s) 2 (open-loop transfer function) (ii) G(s) and interpret their significance. 49. A standard H control problem with no uncertainties in system matrices are given below:.. A = ; B 6. 5. = ;, B. 2 = ;. C =.. ; C 2 =.. ; D =.; D 22 =., D 2 =., and D 2 = 2. 3

Find the four-block representation of the generalized plant matrix P (s). Find T.F from ω to z in terms of controller gain matrix k(s) with u(s) = k(s)y(s). 5. Solve the H control problem for the generalized plant P (s) which is described in state-space form: P (s) = with controller u(s) = k(s)y(s); A B B 2 C D D 2 C 2 D 2 D 22 =.2 Draw the generic H block diagram of the system (indicating all internal and external signals). Verify that all rank conditions are met. Compute, X, Y, Z, K c, and K e for γ =.. Find the compensator T.F and the closed-loop poles. Draw the schematic diagram showing structure of the H control system in time domain. 4