• Non ci sono risultati.

Sampled-data systems

N/A
N/A
Protected

Academic year: 2021

Condividi "Sampled-data systems"

Copied!
25
0
0

Testo completo

(1)

Ingegneria dell ’Automazione - Sistemi in Tempo Reale

Selected topics on discrete-time and sampled-data systems

Luigi Palopoli

palopoli@sssup.it - Tel. 050/883444

(2)

Outline

Effects of delay

Sampled-data systems

Discrete equivalents

(3)

An example

Consider a first order system ˙x = λx + u Γ1 = RT

mT eληdη = eλTλeλmT , Γ2 = emλTλ 1 Augmented discrete-time system:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT eλTλeλmT

0 0

3 5

2 4

x(k) z(k)

3 5 +

2 4

emλT1 λ

1

3

5u(k)

Control by static feedback u(k) = kx(x) yields the closed loop dynamic:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT + kemλTλ 1 eλTλeλmT

k 0

3 5z

Stability can be studied- via Jury criterion - on

z2 − (eλT + kemλT − 1

λ )z − keλT − eλmT λ

(4)

An example

Consider a first order system ˙x = λx + u Γ1 = RT

mT eληdη = eλTλeλmT , Γ2 = emλTλ 1 Augmented discrete-time system:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT eλTλeλmT

0 0

3 5

2 4

x(k) z(k)

3 5 +

2 4

emλT1 λ

1

3

5u(k)

Control by static feedback u(k) = kx(x) yields the closed loop dynamic:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT + kemλTλ 1 eλTλeλmT

k 0

3 5z

Stability can be studied- via Jury criterion - on

z2 − (eλT + kemλT − 1

λ )z − keλT − eλmT λ

(5)

An example

Consider a first order system ˙x = λx + u Γ1 = RT

mT eληdη = eλTλeλmT , Γ2 = emλTλ 1 Augmented discrete-time system:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT eλTλeλmT

0 0

3 5

2 4

x(k) z(k)

3 5 +

2 4

emλT1 λ

1

3

5u(k) Control by static feedback u(k) = kx(x) yields the closed loop dynamic:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT + kemλTλ 1 eλTλeλmT

k 0

3 5z

Stability can be studied- via Jury criterion - on

z2 − (eλT + kemλT − 1

λ )z − keλT − eλmT λ

(6)

An example

Consider a first order system ˙x = λx + u Γ1 = RT

mT eληdη = eλTλeλmT , Γ2 = emλTλ 1 Augmented discrete-time system:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT eλTλeλmT

0 0

3 5

2 4

x(k) z(k)

3 5 +

2 4

emλT1 λ

1

3

5u(k)

Control by static feedback u(k) = kx(x) yields the closed loop dynamic:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT + kemλTλ 1 eλTλeλmT

k 0

3 5z Stability can be studied- via Jury criterion - on

z2 − (eλT + kemλT − 1

λ )z − keλT − eλmT λ

(7)

An example

Consider a first order system ˙x = λx + u Γ1 = RT

mT eληdη = eλTλeλmT , Γ2 = emλTλ 1 Augmented discrete-time system:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT eλTλeλmT

0 0

3 5

2 4

x(k) z(k)

3 5 +

2 4

emλT1 λ

1

3

5u(k)

Control by static feedback u(k) = kx(x) yields the closed loop dynamic:

2 4

x(k + 1) z(k + 1)

3 5 =

2 4

eλT + kemλTλ 1 eλTλeλmT

k 0

3 5z

Stability can be studied- via Jury criterion - on

z2 − (eλT + kemλT − 1

)z − keλT − eλmT

(8)

Solution

a 2 < 1 ⇒ k > − e

λT

−e λ

λmT

a 2 > −1 − a 1 ⇒ k < −λ

a 2 > −1 + a 1 ⇒ (

k > −λ 2e

λmT

e

λT

−e +1

λT

−1 if m > log

1+e

λT 2

λT

k > −2e

λmT

e

λT

+e +1

λT

+1 λ Otherwise

(9)

Solution

a 2 < 1 ⇒ k > − e

λT

−e λ

λmT

a 2 > −1 − a 1 ⇒ k < −λ a 2 > −1 + a 1 ⇒

(

k > −λ 2e

λmT

e

λT

−e +1

λT

−1 if m > log

1+e

λT 2

λT

k > −2e

λmT

e

λT

+e +1

λT

+1 λ Otherwise

(10)

Solution

a 2 < 1 ⇒ k > − e

λT

−e λ

λmT

a 2 > −1 − a 1 ⇒ k < −λ a 2 > −1 + a 1 ⇒

(

k > −λ 2e

λmT

e

λT

−e +1

λT

−1 if m > log

1+e

λT 2

λT

k > −2e

λmT

e

λT

+e +1

λT

+1 λ Otherwise

(11)

Sampled-data systems

So far we have seen discrete-time systems Computer controlled systems are actually a mix of discrete-time and continuous time

systems

We need to understand the interaction

between different components

(12)

Ideal sampler

Ideal sampling can intuitively be seen as generated by multiplying a signal by a

sequence of dirac’s δ

(13)

Properties of δ

R + ∞

−∞ f (t)δ(t − a)dt = f (a) R t

−∞ δ(τ )dτ = 1 → L[δ(t)] = 1

(14)

L -trasform of r

Using the above properties it is possible to write:

L[r

(t)] = R

+∞

−∞

r

(τ )e

−sτ

dτ = R

+∞

−∞

P

+∞

−∞

r(τ )δ(τ − kT )dτ =

= P

+∞

−∞

R

+∞

−∞

r(τ )δ(τ − kT )dτ = P

+∞

−∞

r(kT )e

−sKT

= R

(s) The L-transform of the sampled-data signal r can be

achieved from the Z-transform of the sequence r(kT ) by choosing z = e

−sT

Backward or forward shifting yields different samples:

the sampling operation is not time-invariant (but it is

(15)

Spectrum of the Sampled Signal

Fourier Series transform of the sampling signal

P+∞

−∞δ(t − kT ) = P+∞

−∞ Cnej2nπt/T Cn = RT /2

T /2

P+∞

−∞ δ(t − kT )ej2nπt/Tdτ = R T /2

T /2 δ(t)ej2nπt/Tdτ = T1 → P+∞

−∞δ(t − kT ) = T1 P+∞

−∞ej2nπt/T Spectrum of r

L[r(t)] = R +∞

−∞ r(t)T1 P+∞

−∞ej2nπt/TesTdt =

= T1 P+∞

−∞ r(t)R+∞

−∞ e(s−j2nπ/T )tdt =

= T1 P+∞

−∞ R(s − j2πn/T )

(16)

Example

−1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

ω

|R(j ω)|

−2 −1.5 −1 −0.5 0 0.5 1 1.5 2

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

ω

|R*(jω)|

2 π /T

(17)

Aliasing

The spectrum might be altered (i.e., signal not attainable from samples!)

−2

−1.5

−1

−0.5 0 0.5 1 1.5 2

sin(2 π t)

sin(2 π t/3)

samples collected with T = 3/2

(18)

Shannon theorem

If the signal has a finite badwidth then the signal can be reconstructed from samples collected with a period

such that T 1 ≥ 2B

Band-limited signals have infinite duration;

many signals of interest have infinite bandwidth

Typically a low-pass filter is used to

de-emphasize higher frequencies

(19)

Data Extrapolation

If the following hypotheses hold

the signal has limited bandwidth B

the signal is sampled at frequency f

s

=

T1

≥ 2B then the signal can be reconstructed using an ideal lowpass filter L(s) with

|L(jω)| =

T if ω ∈ [−

Tπ

,

Tπ

] 0 elsewhere.

Signal l(t) is given by:

1 Z pi/T sin(πt/T )

(20)

Data Extrapolation I

The reconstructed signal is computed as follows:

r(t) = r(t) ∗ l(t) = R+∞

−∞ r(τ )P δ(τ − kT )sincπ(t−τT dτ =

= P+∞

−∞ r(kT )sincπ(t−kT )T

The function sinc is not causal and has infinite duration In communication applications

The duration problem can be solved truncating the signal

The causality problem can be solved introducing a delay and collecting some sample before the reconstruction

Not viable in control applications since large delays jeopardise stability

(21)

Extrapolation via ZOH

Zoh transfer function

Zoh(jω) = 1−ejωT = ejωT /2 n

ejωT /2−jωT /2 2j

o 2j =

= T ejωT /2sinc(ωT2 ) Amplitude:

|Zoh(jω)| = T |sinc(ωT 2 )|

Phase:

∠Zoh(jω) = −ωT 2

(22)

Sinusoidal signal

−0.6

−0.4

−0.2 0 0.2 0.4 0.6 0.8 1

−0.6

−0.4

−0.2 0 0.2 0.4 0.6 0.8 1

sin(2 π t)

ZoH extrapolation

(23)

Example

Consider the signal r(t) = π 1 sin(t) The spectrum is given by

R(jω) = j(δ(ω − 1) − δ(ω + 1))

Suppose we sample it with period T = 1 The spectrum of

r (t) = 1/T P +∞

k=−∞ R(jω − 2nπ)

(24)

Example - I

−8 −6 −4 −2 0 2 4 6 8

0 0.5 1 1.5 2

−8 −6 −4 −2 0 2 4 6 8

0 0.5 1 1.5 2

|R(j ω) |

|R*(j ω)|

(25)

Example - II

Sampling and ZoH extrapolation orignate spurious harmonics (called impostors)

Taking adavantage of the low pass behaviour of the plant we can restrict to the first

harmonic

v 1 (t) = 1

π sinc(T/2) sin(t − T/2) The sample-and-hold operation can be

thought of (at a first approximation) as the

introduction of delay of T/2

Riferimenti

Documenti correlati

For instance, if we assume that all contexts C i ’s knowledge bases and belief states are finite at any stage, all update operators U i , management functions and trigger- ing

In this paper, we propose necessary and sufficient conditions for the stability of a class of linear continuous-time systems where the delay is subject to stochastic variations..

More precisely the condition under which left invertibility and left D-invertibility are equivalent is that the elements of the dynamic matrix of the system form an

This situation happens when:. rank[A] =

• From this last relation it follows that for continuous-time systems the osservability implies and is implied by the constructability:. Observability

For invariant time-continuous linear systems, the con- trollable subspace X − does not depend on the amplitude of the time interval [0, t] and it is equal to the reachable subspace

A random spanning forest is a random variable Φ, taking values on the set of all possible rooted spanning forests, with law ν called “forest probability measure”.. Note that

• Admission to the oral exam is subject to passing the midterm written exam and the project with an average grade ≥18 and both grades ≥15 (out of 30).. are available on the course