- Source: Flat pseudospectral method
The flat pseudospectral method is part of the family of the Ross–Fahroo pseudospectral methods introduced by Ross and Fahroo. The method combines the concept of differential flatness with pseudospectral optimal control to generate outputs in the so-called flat space.
Concept
Because the differentiation matrix,
D
{\displaystyle D}
, in a pseudospectral method is square, higher-order derivatives of any polynomial,
y
{\displaystyle y}
, can be obtained by powers of
D
{\displaystyle D}
,
y
˙
=
D
Y
y
¨
=
D
2
Y
⋮
y
(
β
)
=
D
β
Y
{\displaystyle {\begin{aligned}{\dot {y}}&=DY\\{\ddot {y}}&=D^{2}Y\\&{}\ \vdots \\y^{(\beta )}&=D^{\beta }Y\end{aligned}}}
where
Y
{\displaystyle Y}
is the pseudospectral variable and
β
{\displaystyle \beta }
is a finite positive integer.
By differential flatness, there exists functions
a
{\displaystyle a}
and
b
{\displaystyle b}
such that the state and control variables can be written as,
x
=
a
(
y
,
y
˙
,
…
,
y
(
β
)
)
u
=
b
(
y
,
y
˙
,
…
,
y
(
β
+
1
)
)
{\displaystyle {\begin{aligned}x&=a(y,{\dot {y}},\ldots ,y^{(\beta )})\\u&=b(y,{\dot {y}},\ldots ,y^{(\beta +1)})\end{aligned}}}
The combination of these concepts generates the flat pseudospectral method; that is, x and u are written as,
x
=
a
(
Y
,
D
Y
,
…
,
D
β
Y
)
{\displaystyle x=a(Y,DY,\ldots ,D^{\beta }Y)}
u
=
b
(
Y
,
D
Y
,
…
,
D
β
+
1
Y
)
{\displaystyle u=b(Y,DY,\ldots ,D^{\beta +1}Y)}
Thus, an optimal control problem can be quickly and easily transformed to a problem with just the Y pseudospectral variable.
See also
Ross' π lemma
Ross–Fahroo lemma
Bellman pseudospectral method
References
Kata Kunci Pencarian:
6.5
6.8
6.6
6.5
6.4
7.9
5.268
6.674
6.675
No More Posts Available.
No more pages to load.
