1 / 70

Prof. Wahied Gharieb Ali Abdelaal

Faculty of Engineering Computer and Systems Engineering Department Master and Diploma Students. CSE 502: Control Systems(1) Topic#2 Mathematical Tools for Analysis. Prof. Wahied Gharieb Ali Abdelaal. Outline. Ordinary Differential Equations (ODE) Laplace Transform and Its Inverse

Download Presentation

Prof. Wahied Gharieb Ali Abdelaal

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Faculty of Engineering Computer and Systems Engineering Department Master and Diploma Students CSE 502: Control Systems(1) Topic#2 Mathematical Tools for Analysis Prof. Wahied Gharieb Ali Abdelaal

  2. Outline • Ordinary Differential Equations (ODE) • Laplace Transform and Its Inverse • Laplace Transform Properties • Sampling and Digital Systems • Selection of Sampling Frequency • Z-Transform and Its Properties • Summary

  3. Ordinary Differential Equations (ODE) • An ordinary differential equation of order n is given by: • Example: • Second order linear ordinary differential equation. • It is convenient to define the differential operators: • and

  4. Ordinary Differential Equations (ODE) Characteristic Polynomial & Characteristic Equation Example: • The characteristic polynomial is D2 +3D +2. • The characteristic equation is D2+3D+2=0 • (D+2)(D+1)=0. The roots are D1=-2 & D2=-1 • The polynomial: • is called the Characteristic Polynomial and the equation : • is called the characteristic equation

  5. Ordinary Differential Equations (ODE) Solution of Linear Ordinary Differential Equation • The solution of a differential equation contains two parts: • Free response • Forced response • The free response; is the solution of the differential equation when the input is zero. • The forced response ; is the solution of the differential equation when all initial conditions are zero. • The total response is the sum of the free response and the forced response.

  6. Ordinary Differential Equations (ODE) Example The free response (y1) D2 + 3D +2 =0  (D+2)(D+1)=0  D=-1 ; D=-2 The forced response (y2) depends on the forcing function f(t). If f(t)= cos t  y2(t) = A1 cos t + A2 sin t f(t)= t2  y2(t) = A1 + A2t + A3t2 f(t)= te-t  y2(t) = A1 e-t + A2 te-t f(t)= et  y2(t) = Aet The above forms will usually work if the forcing function is not a part of the free response !

  7. Ordinary Differential Equations (ODE) • In this example, f(t) = -4e-3t y2(t)= Ae-3t because • The total response y(t)= y1(t) + y2(t) • We have to find A , A1 and A2 satisfying the differential equation and the initial conditions 9Ae-3t –9Ae-3t +2Ae-3t = -4e-3t A=-2 y2(t)=-2e-3t

  8. Ordinary Differential Equations (ODE) • The total response y(t)= -2e-3t + A1e-t + A2e-2t • Using initial conditions to find A1 and A2 y(0)=0  A1+A2-2=0  A1=2-A2 ý(0)= 1  -A1-2A2+6=1  A1=-1 and A2=3 y(t)= -e-t + 3e-2t - 2e-3t

  9. Ordinary Differential Equations (ODE) Example The free response (y1) D2 + D +1/2 =0  Complex poles  D1,2= -1/2  j1/2

  10. Ordinary Differential Equations (ODE) Forced response Since f(t)=1/2t  y2(t)=B1+B2t 0+B2 +1/2B1 +1/2B2t =1/2t B1=-2 and B2=1 y2(t)=-2+t

  11. Laplace Transform Definition Given a real function f(t) that satisfies Laplace Transform of f(t) is defined as : Where F(s) = L[f(t)] or f(t) = L-1[F(s)]

  12. Laplace Transform Examples • f(t) = (t) = impulse signal defined by: • wherefor t0, otherwise

  13. Laplace Transform 2. f(t) = u(t) = Unit Step A shift in the time domain is equivalent to an exponential term in the s-plane.

  14. Laplace Transform 3. f(t) = t u(t) = Ramp Function 4. Exponential Function f(t)=e-t u(t)

  15. Laplace Transform 5. Sinusoidal Functions f(t) = ejωtu(t)

  16. Laplace Transform

  17. Laplace Transform

  18. Laplace Transform

  19. Laplace Transform

  20. Initial and Final Value Theorems Initial Value Theorem If the limit exist Final Value Theorem Provided that sF(s) does not have any poles on the j axis and in the right half s-plane Examples 1. F(s) has a pole of order 2 at zero and theorems can not be applied. 2. ; No poles in the right half s-plane (Stable).

  21. Inverse Laplace Transform The inverse Laplace Transform does not relay on the use of the inversion Integral. Rather the inverse Laplace transform operation involving rational functions can be carried out using a Laplace Transform table and Partial fraction expansion. f(t)=L-1[F(s)] Inverse Laplace Transform using Partial Fraction Expansion Suppose that all poles of the transfer function are simple From the Laplace Transform Table,

  22. Inverse Laplace Transform Example Consider : By tacking the inverse Laplace transform of this equation, we get the complete solution as: The first term is the steady-state solution; the last two terms represent the transient solution. Unlike the classical method, which requires separate steps to give the transient and the steady state solutions, the Laplace transform method gives the entire response.

  23. Inverse Laplace Transform Example

  24. Inverse Laplace Transform Example

  25. Inverse Laplace Transform

  26. Laplace Transform of Basic Functions

  27. Laplace Transform Properties

  28. Laplace Transform Properties

  29. Laplace Transform Properties

  30. Sampling and Digital Systems

  31. Sampling and Digital Systems Advantages of digital control • Hardware is replaced by software, which is costly-effective • Complex function can be implemented in software so easily rather than hardware • Reliability in implementation, that means, you can simply modify the control function in software without extra cost. • Computers can be used in data logging (monitoring), supervisory control and can control multiple loop simultaneously as the computers are well fast.

  32. Sampling and Digital Systems

  33. Sampling and Digital Systems

  34. Sampling and Digital Systems

  35. Sampling and Digital Systems

  36. Sampling and Digital Systems • Digital controllers could take one of the forms: • • A computer or simply microprocessor board. Once they have developed and started to be manufactured commercially, digital controllers are developed. • • Microcontroller is a microprocessor system on chip as a single integrated circuit. It is used in embedded control applications such as TV, mobile phones, Air conditioner, Video Camera, Hard disk controllers, Robots, Smart car manufacturing, ...etc. It is used for a limited number of I/O signals in real time applications. • • Programmable logic controller (PLCs). PLC can handle a very large number of I/O signals (as hundreds or thousands) in industrial control applications. It has a standard interfaces with the field measurements. The PLC technology replaces the old hardwired control (relay logic control) cabinets in the industry.

  37. Sampling and Digital Systems The analog signal is a continuous representation of a signal, that it takes different values with time. Digital signals have two values only or two level corresponding to logic 1 and logic zero

  38. Sampling and Digital Systems The ADC requires three operations in sequence: 1- Sampling, we need to sample the analog signal at a constant rate. The sampler could be an electronic switch. The critical question is how to select the sampling frequency. 2- Holding, that holds the sample in during the sampling period until a new sample is captured. This is necessary to convert a constant value into digital word. 3- Conversion, it is often sequential circuit that takes a considerable time to convert the holding sample into digital word.

  39. Sampling and Digital Systems A/D Converters Sampling and holding process Digitized Value 

  40. Sampling and Digital Systems

  41. Sampling and Digital Systems DAC requires two operations in sequence: 1- DAC, in general is faster than ADC ones and easier in implementation. 2- Holding, it is very difficult to apply the discrete signal that outputs from DAC directly to an analog process. It will excite the system and fatigue the actuator. Therefore, holding these samples makes them in a continuous form (stepping levels).

  42. Sampling and Digital Systems

  43. Selection of Sampling Frequency It is imperative that an ADC's sample time is fast enough to capture essential changes in the analog waveform. In data acquisition terminology, the highest-frequency waveform that an ADC can theoretically capture is called Nyquist frequency, which equals to one-half of the ADC's sample frequency. Therefore, if an ADC circuit has a sample frequency of 5000 Hz, the highest frequency waveform will be the Nyquist frequency of 2500 Hz. If an ADC is subjected to an analog input signal whose frequency exceeds the Nyquist frequency for that ADC, the converter will output a digitized signal of falsely low frequency.This phenomenon is known as aliasing effect.

  44. Selection of Sampling Frequency

  45. Selection of Sampling Frequency

  46. Selection of Sampling Frequency Aliasing Phenomenon In practice, the sampling frequency = 10 *frequency bandwidth of the analog signal.

  47. Selection of Sampling Frequency The system bandwidth frequency is not the only limit to select the sampling frequency, there is also other constraints due to time considerations in ADC, DAC, and microprocessor to execute the control program. In general, the sampling period Ts to control a single loop can be selected using the following relationship: 1/(2 fB) > Ts > (TADC + Tμp +TDAC) Where fB = frequency bandwidth of the analog signal TADC = conversion time of ADC TDAC = conversion time of DAC(can be ignored) Tμp = Execution time of the control program in microprocessor, it depends the speed of microprocessor

  48. -2s -s -0 0 s 2s Selection of Sampling Frequency F() Fourier Transform  0 -0 Fs()  Fs() Aliasing effect -0 -2s -s 0 s 2s

  49. Selection of Sampling Frequency • Preventing aliases • Make sure your sampling frequency is greater than twice of the highest frequency component of the signal. In practice, take it ten times the highest frequency component. • Pre-filtering of the analog signal • Set your sampling frequency to the maximum if possible

  50. Selection of Sampling Frequency without pre-filtering With pre- filtering

More Related