SlideShare a Scribd company logo
ECE 595, Discrete-Time Control Systems October 20, 2005 1
Discretization of Continuous Time State Space Systems
Suppose we are given the continuous time state space system
ẋ(t) = Ax(t) + Bu(t) (1)
y(t) = Cx(t) + Du(t) (2)
and apply an input that changes only at discrete (equal) sampling intervals. It would be nice if
we could find matrices G and H, independent of t or k so that we could obtain a discrete time
model of the system,
x ((k + 1)T) = G(T)x(kT) + H(T)u(kT) (3)
y(kT) = Cx(kT) + Du(kT). (4)
We will now determine the values of the matrices G(T) and H(T). It will turn out that while
they are constant for a particular sampling interval, they depend on the value of the sampling
interval, so for that reason I have written them as G(T) and H(T) in (3) above.
We start by using the solution of (1) to calculate the values of the state x at times kT and
(k + 1)T. These are
x ((k + 1)T) = eA(k+1)T
x(0) + eA(k+1)T
Z (k+1)T
0
e−Aτ
Bu(τ)dτ (5)
x(kT) = eAkT
x(0) + eAkT
Z kT
0
e−Aτ
Bu(τ)dτ. (6)
We want to write x((k +1)T) in terms of x(kT) so we multiply all terms of (6) by eAT and solve
for eA(k+1)T x(0), obtaining
eA(k+1)T
x(0) = eAT
x(kT) − eA(k+1)T
Z kT
0
e−Aτ
Bu(τ)dτ. (7)
Substituting for eA(k+1)T x(0) in (5) we obtain
x ((k + 1)T) = eAT
x(kT) + eA(k+1)T
"Z (k+1)T
0
e−Aτ
Bu(τ)dτ −
Z kT
0
e−Aτ
Bu(τ)dτ
#
(8)
which, by linearity of integration, is equivalent to
x ((k + 1)T) = eAT
x(kT) + eA(k+1)T
Z (k+1)T
kT
e−Aτ
Bu(τ)dτ. (9)
Next, we notice that within the interval from kT to (k + 1)T, u(t) = u(kT) is constant, as is the
matrix B, so we can take them out of the integral to obtain
x ((k + 1)T) = eAT
x(kT) + eA(k+1)T
Z (k+1)T
kT
e−Aτ
dτBu(kT) τ ∈ [kT, (k + 1)T). (10)
We can take the eA(k+1)T inside the integral to obtain
x ((k + 1)T) = eAT
x(kT) +
Z (k+1)T
kT
eA[(k+1)T−τ]
dτBu(kT) τ ∈ [kT, (k + 1)T). (11)
ECE 595, Discrete-Time Control Systems October 20, 2005 2
Now we see that as τ ranges from kT to (k + 1)T (the lower to the upper limit of integration)
the exponent of e ranges from T to 0. Accordingly, let’s define a new variable λ = (k + 1)T − τ.
Then dλ = −dτ and λ ranges from T to 0 as τ ranges from kT to (k + 1)T. Thus we have
x ((k + 1)T) = eAT
x(kT) −
Z 0
T
eAλ
dλBu(kT) λ ∈ [0, kT), (12)
or
x ((k + 1)T) = eAT
x(kT) +
Z T
0
eAλ
dλBu(kT) λ ∈ [0, kT). (13)
We see that in (13) we have written the state update equation exactly in the form of (3) where
G(T) = eAT
(14)
H(T) =
Z T
0
eAλ
dλB, (15)
so we’re done . . . except that we’d rather not leave the expression for H(T) in the form of an
integral. So long as A is invertible, we can easily integrate, using the fact that
d
dt
eAT
= AeAT
= eAT
A (16)
to obtain
H(T) = A−1
Z T
0
AeAλ
dλB = A−1
eAλ
|T
λ=0B (17)
= A−1
(eAT
− I)B = (eAT
− I)BA−1
. (18)
Finally, note that while I restricted the value of τ and λ to lie within a single sampling interval,
k appears nowhere in the expressions for G(T) and H(T). Our solution to (3) is thus
x(kT) = (G(T))k
x(0) +
k−1
X
j=0
(G(T))k−j−1
H(T)u(jT), k = 1, 2, 3, . . . (19)
and we can see that at the sampling instants kT, this has exactly the same value as is obtained
using (1). Specifically,
(G(T))k
= (eAT
)k
= eAkT
, (20)
and since the input u(t) is constant on sampling intervals,
eAkT
Z kT
0
e−Aτ
Bu(τ)dτ =
k−1
X
j=0
eA(k−j−1)T
A−1
(eAT
− I)Bu(jT) =
k−1
X
j=0
(G(T))k−j−1
H(T)u(jT).
(21)

More Related Content

PDF
A Note on TopicRNN
PDF
A Note on Latent LSTM Allocation
PDF
Using blurred images to assess damage in bridge structures?
PDF
Bohmian
PDF
Convergence methods for approximated reciprocal and reciprocal-square-root
PDF
QMC: Operator Splitting Workshop, Forward-Backward Splitting Algorithm withou...
PPT
002 ray modeling dynamic systems
PDF
Graph for Coulomb damped oscillation
A Note on TopicRNN
A Note on Latent LSTM Allocation
Using blurred images to assess damage in bridge structures?
Bohmian
Convergence methods for approximated reciprocal and reciprocal-square-root
QMC: Operator Splitting Workshop, Forward-Backward Splitting Algorithm withou...
002 ray modeling dynamic systems
Graph for Coulomb damped oscillation

What's hot (18)

PPTX
Toward an Improved Computational Strategy for Vibration-Proof Structures Equi...
PDF
Hermite integrators and Riordan arrays
DOC
pradeepbishtLecture13 div conq
PDF
A block-step version of KS regularization
PDF
Mid term solution
PPT
lecture 4
PPTX
Phase shifts in waves lo1
PDF
Prim algorithm
PPT
Lecture 3 tangent & velocity problems
DOCX
Unit 2 analysis of continuous time signals-mcq questions
PDF
Response Surface in Tensor Train format for Uncertainty Quantification
PDF
PPT
Pengantar dasar matematika 4 (TURUNAAN FUNGSI)
PPT
ADA - Minimum Spanning Tree Prim Kruskal and Dijkstra
PDF
Mit2 092 f09_lec11
PDF
The lattice Boltzmann equation: background and boundary conditions
PDF
The Gaussian Hardy-Littlewood Maximal Function
Toward an Improved Computational Strategy for Vibration-Proof Structures Equi...
Hermite integrators and Riordan arrays
pradeepbishtLecture13 div conq
A block-step version of KS regularization
Mid term solution
lecture 4
Phase shifts in waves lo1
Prim algorithm
Lecture 3 tangent & velocity problems
Unit 2 analysis of continuous time signals-mcq questions
Response Surface in Tensor Train format for Uncertainty Quantification
Pengantar dasar matematika 4 (TURUNAAN FUNGSI)
ADA - Minimum Spanning Tree Prim Kruskal and Dijkstra
Mit2 092 f09_lec11
The lattice Boltzmann equation: background and boundary conditions
The Gaussian Hardy-Littlewood Maximal Function
Ad

Similar to Discretization (20)

PPTX
State space techniques for discrete control systems.
PPSX
Pole placement by er. sanyam s. saini (me reg)
PDF
Modern Control Engineering Problems Ch 3.pdf
PDF
Lec11_removed_removed_removed.pdf
DOCX
Discrete control
PDF
Discretizing of linear systems with time-delay Using method of Euler’s and Tu...
DOCX
Discrete control2
PDF
LINEAR SYSTEMS
PDF
PPTX
Time Response in Control System
PDF
Discrete control2 converted
PDF
Sbe final exam jan17 - solved-converted
PDF
Lecture 11 state observer-2020-typed
PDF
Brief summary of signals
PDF
CH3.2 control systens 2 slides study.pdf
PPTX
Controllability of Linear Dynamical System
PDF
Dcs lec03 - z-analysis of discrete time control systems
PDF
Digital control book
PDF
summary.pdf
State space techniques for discrete control systems.
Pole placement by er. sanyam s. saini (me reg)
Modern Control Engineering Problems Ch 3.pdf
Lec11_removed_removed_removed.pdf
Discrete control
Discretizing of linear systems with time-delay Using method of Euler’s and Tu...
Discrete control2
LINEAR SYSTEMS
Time Response in Control System
Discrete control2 converted
Sbe final exam jan17 - solved-converted
Lecture 11 state observer-2020-typed
Brief summary of signals
CH3.2 control systens 2 slides study.pdf
Controllability of Linear Dynamical System
Dcs lec03 - z-analysis of discrete time control systems
Digital control book
summary.pdf
Ad

Recently uploaded (20)

PPTX
CURRICULAM DESIGN engineering FOR CSE 2025.pptx
PPT
Occupational Health and Safety Management System
PDF
BIO-INSPIRED HORMONAL MODULATION AND ADAPTIVE ORCHESTRATION IN S-AI-GPT
PDF
Automation-in-Manufacturing-Chapter-Introduction.pdf
PDF
PPT on Performance Review to get promotions
PPTX
Safety Seminar civil to be ensured for safe working.
PDF
Integrating Fractal Dimension and Time Series Analysis for Optimized Hyperspe...
PDF
III.4.1.2_The_Space_Environment.p pdffdf
PPTX
Fundamentals of safety and accident prevention -final (1).pptx
PPTX
Artificial Intelligence
PPTX
6ME3A-Unit-II-Sensors and Actuators_Handouts.pptx
PDF
Visual Aids for Exploratory Data Analysis.pdf
PDF
BIO-INSPIRED ARCHITECTURE FOR PARSIMONIOUS CONVERSATIONAL INTELLIGENCE : THE ...
PDF
Categorization of Factors Affecting Classification Algorithms Selection
PPTX
UNIT 4 Total Quality Management .pptx
PDF
737-MAX_SRG.pdf student reference guides
PDF
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
PPTX
communication and presentation skills 01
PPTX
introduction to high performance computing
PPT
A5_DistSysCh1.ppt_INTRODUCTION TO DISTRIBUTED SYSTEMS
CURRICULAM DESIGN engineering FOR CSE 2025.pptx
Occupational Health and Safety Management System
BIO-INSPIRED HORMONAL MODULATION AND ADAPTIVE ORCHESTRATION IN S-AI-GPT
Automation-in-Manufacturing-Chapter-Introduction.pdf
PPT on Performance Review to get promotions
Safety Seminar civil to be ensured for safe working.
Integrating Fractal Dimension and Time Series Analysis for Optimized Hyperspe...
III.4.1.2_The_Space_Environment.p pdffdf
Fundamentals of safety and accident prevention -final (1).pptx
Artificial Intelligence
6ME3A-Unit-II-Sensors and Actuators_Handouts.pptx
Visual Aids for Exploratory Data Analysis.pdf
BIO-INSPIRED ARCHITECTURE FOR PARSIMONIOUS CONVERSATIONAL INTELLIGENCE : THE ...
Categorization of Factors Affecting Classification Algorithms Selection
UNIT 4 Total Quality Management .pptx
737-MAX_SRG.pdf student reference guides
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
communication and presentation skills 01
introduction to high performance computing
A5_DistSysCh1.ppt_INTRODUCTION TO DISTRIBUTED SYSTEMS

Discretization

  • 1. ECE 595, Discrete-Time Control Systems October 20, 2005 1 Discretization of Continuous Time State Space Systems Suppose we are given the continuous time state space system ẋ(t) = Ax(t) + Bu(t) (1) y(t) = Cx(t) + Du(t) (2) and apply an input that changes only at discrete (equal) sampling intervals. It would be nice if we could find matrices G and H, independent of t or k so that we could obtain a discrete time model of the system, x ((k + 1)T) = G(T)x(kT) + H(T)u(kT) (3) y(kT) = Cx(kT) + Du(kT). (4) We will now determine the values of the matrices G(T) and H(T). It will turn out that while they are constant for a particular sampling interval, they depend on the value of the sampling interval, so for that reason I have written them as G(T) and H(T) in (3) above. We start by using the solution of (1) to calculate the values of the state x at times kT and (k + 1)T. These are x ((k + 1)T) = eA(k+1)T x(0) + eA(k+1)T Z (k+1)T 0 e−Aτ Bu(τ)dτ (5) x(kT) = eAkT x(0) + eAkT Z kT 0 e−Aτ Bu(τ)dτ. (6) We want to write x((k +1)T) in terms of x(kT) so we multiply all terms of (6) by eAT and solve for eA(k+1)T x(0), obtaining eA(k+1)T x(0) = eAT x(kT) − eA(k+1)T Z kT 0 e−Aτ Bu(τ)dτ. (7) Substituting for eA(k+1)T x(0) in (5) we obtain x ((k + 1)T) = eAT x(kT) + eA(k+1)T "Z (k+1)T 0 e−Aτ Bu(τ)dτ − Z kT 0 e−Aτ Bu(τ)dτ # (8) which, by linearity of integration, is equivalent to x ((k + 1)T) = eAT x(kT) + eA(k+1)T Z (k+1)T kT e−Aτ Bu(τ)dτ. (9) Next, we notice that within the interval from kT to (k + 1)T, u(t) = u(kT) is constant, as is the matrix B, so we can take them out of the integral to obtain x ((k + 1)T) = eAT x(kT) + eA(k+1)T Z (k+1)T kT e−Aτ dτBu(kT) τ ∈ [kT, (k + 1)T). (10) We can take the eA(k+1)T inside the integral to obtain x ((k + 1)T) = eAT x(kT) + Z (k+1)T kT eA[(k+1)T−τ] dτBu(kT) τ ∈ [kT, (k + 1)T). (11)
  • 2. ECE 595, Discrete-Time Control Systems October 20, 2005 2 Now we see that as τ ranges from kT to (k + 1)T (the lower to the upper limit of integration) the exponent of e ranges from T to 0. Accordingly, let’s define a new variable λ = (k + 1)T − τ. Then dλ = −dτ and λ ranges from T to 0 as τ ranges from kT to (k + 1)T. Thus we have x ((k + 1)T) = eAT x(kT) − Z 0 T eAλ dλBu(kT) λ ∈ [0, kT), (12) or x ((k + 1)T) = eAT x(kT) + Z T 0 eAλ dλBu(kT) λ ∈ [0, kT). (13) We see that in (13) we have written the state update equation exactly in the form of (3) where G(T) = eAT (14) H(T) = Z T 0 eAλ dλB, (15) so we’re done . . . except that we’d rather not leave the expression for H(T) in the form of an integral. So long as A is invertible, we can easily integrate, using the fact that d dt eAT = AeAT = eAT A (16) to obtain H(T) = A−1 Z T 0 AeAλ dλB = A−1 eAλ |T λ=0B (17) = A−1 (eAT − I)B = (eAT − I)BA−1 . (18) Finally, note that while I restricted the value of τ and λ to lie within a single sampling interval, k appears nowhere in the expressions for G(T) and H(T). Our solution to (3) is thus x(kT) = (G(T))k x(0) + k−1 X j=0 (G(T))k−j−1 H(T)u(jT), k = 1, 2, 3, . . . (19) and we can see that at the sampling instants kT, this has exactly the same value as is obtained using (1). Specifically, (G(T))k = (eAT )k = eAkT , (20) and since the input u(t) is constant on sampling intervals, eAkT Z kT 0 e−Aτ Bu(τ)dτ = k−1 X j=0 eA(k−j−1)T A−1 (eAT − I)Bu(jT) = k−1 X j=0 (G(T))k−j−1 H(T)u(jT). (21)