擴展卡曼濾波器 （英文 ：Extended Kalman filter , EKF 線性系統 嘅卡曼濾波器 嘅，令到非線性系統 啲平均值 同埋協方差 得到線性化 並攞嚟做預測同埋修正。喺啲過渡模型有明確定義到嘅情況下，EKF 得認為[1] de facto 標準喺非線性狀態估計理論、導航系統 同埋GPS 當中。[2]
喺擴展卡曼濾波器中，狀態轉移同觀察模型嘸需要係線性函數畀狀態，而係可以係可微得嘅函數[3] :407 ：
x
k
=
f
k
−
1
(
x
k
−
1
,
u
k
−
1
,
w
k
−
1
)
{\displaystyle {\boldsymbol {x}}_{k}=f_{k-1}({\boldsymbol {x}}_{k-1},{\boldsymbol {u}}_{k-1},{\boldsymbol {w}}_{k-1})}
z
k
=
h
k
(
x
k
,
v
k
)
{\displaystyle {\boldsymbol {z}}_{k}=h_{k}({\boldsymbol {x}}_{k},{\boldsymbol {v}}_{k})}
呢度
u
k
{\displaystyle {\boldsymbol {u}}_{k}}
w
k
{\displaystyle {\boldsymbol {w}}_{k}}
v
k
{\displaystyle {\boldsymbol {v}}_{k}}
協方差
Q
k
{\displaystyle {\boldsymbol {Q}}_{k}}
R
k
{\displaystyle {\boldsymbol {R}}_{k}}
w
t
∼
(
0
,
Q
t
)
,
v
t
∼
(
0
,
R
t
)
{\textstyle {\boldsymbol {w}}_{t}\sim (0,{\boldsymbol {Q_{t}}}),{\boldsymbol {v}}_{t}\sim (0,{\boldsymbol {R_{t}}})}
函數
f
{\displaystyle f}
h 可以攞嚟根據預測狀態計算預測嘅測量值。之但係，
f
{\displaystyle f}
h
{\displaystyle h}
Jacobi矩陣 ）。
喺每個時間𨂾，Jacobi 矩陣都藉由噉時嘅預測狀態評估到。啲矩陣可以用喺卡曼濾波器方程入便。呢個過程本質上係線性化個非線性函數畀噉時嘅估計。
離散時間預測同更新方程 [ 編輯 ] 符號
x
^
n
∣
m
{\displaystyle {\hat {\mathbf {x} }}_{n\mid m}}
x
{\displaystyle \mathbf {x} }
n
{\displaystyle n}
m
≤
n
{\displaystyle m\leq n}
卡曼濾波器#過程 。[3] :409
預測狀態估計
x
^
k
|
k
−
1
=
f
(
x
^
k
−
1
|
k
−
1
,
u
k
−
1
,
0
)
{\displaystyle {\hat {\boldsymbol {x}}}_{k|k-1}=f({\hat {\boldsymbol {x}}}_{k-1|k-1},{\boldsymbol {u}}_{k-1},0)}
預測協方差估計
P
k
|
k
−
1
=
F
k
P
k
−
1
|
k
−
1
F
k
⊤
+
L
k
Q
k
L
k
⊤
{\displaystyle {\boldsymbol {P}}_{k|k-1}={{\boldsymbol {F}}_{k}}{\boldsymbol {P}}_{k-1|k-1}{{\boldsymbol {F}}_{k}^{\top }}+{{\boldsymbol {L}}_{k}}{\boldsymbol {Q}}_{k}{{\boldsymbol {L}}_{k}^{\top }}}
新息 或者測量殘差
y
~
k
=
z
k
−
h
(
x
^
k
|
k
−
1
,
0
)
{\displaystyle {\tilde {\boldsymbol {y}}}_{k}={\boldsymbol {z}}_{k}-h({\hat {\boldsymbol {x}}}_{k|k-1},0)}
新息（或者殘差）協方差
S
k
=
H
k
P
k
|
k
−
1
H
k
⊤
+
M
k
R
k
M
k
⊤
{\displaystyle {\boldsymbol {S}}_{k}={{\boldsymbol {H}}_{k}}{\boldsymbol {P}}_{k|k-1}{{\boldsymbol {H}}_{k}^{\top }}+{{\boldsymbol {M}}_{k}}{\boldsymbol {R}}_{k}{{\boldsymbol {M}}_{k}^{\top }}}
近最優嘅卡曼增益
K
k
=
P
k
|
k
−
1
H
k
⊤
S
k
−
1
{\displaystyle {\boldsymbol {K}}_{k}={\boldsymbol {P}}_{k|k-1}{{\boldsymbol {H}}_{k}^{\top }}{\boldsymbol {S}}_{k}^{-1}}
更新唨嘅狀態估計
x
^
k
|
k
=
x
^
k
|
k
−
1
+
K
k
y
~
k
{\displaystyle {\hat {\boldsymbol {x}}}_{k|k}={\hat {\boldsymbol {x}}}_{k|k-1}+{\boldsymbol {K}}_{k}{\tilde {\boldsymbol {y}}}_{k}}
更新唨嘅協方差估計
P
k
|
k
=
(
I
−
K
k
H
k
)
P
k
|
k
−
1
{\displaystyle {\boldsymbol {P}}_{k|k}=({\boldsymbol {I}}-{\boldsymbol {K}}_{k}{{\boldsymbol {H}}_{k}}){\boldsymbol {P}}_{k|k-1}}
其中狀態轉移矩陣同觀測矩陣定義為以下啲 Jacobi 矩陣；
F
k
,
H
k
{\displaystyle {\boldsymbol {F}}_{k},{\boldsymbol {H}}_{k}}
L
k
,
M
k
{\displaystyle {\boldsymbol {L}}_{k},{\boldsymbol {M}}_{k}}
F
k
=
∂
f
∂
x
|
x
^
k
−
1
|
k
−
1
,
u
k
−
1
{\displaystyle {{\boldsymbol {F}}_{k}}=\left.{\frac {\partial f}{\partial {\boldsymbol {x}}}}\right\vert _{{\hat {\boldsymbol {x}}}_{k-1|k-1},{\boldsymbol {u}}_{k-1}}}
L
k
=
∂
f
∂
w
|
x
^
k
−
1
|
k
−
1
,
u
k
−
1
{\displaystyle {{\boldsymbol {L}}_{k}}=\left.{\frac {\partial f}{\partial {\boldsymbol {w}}}}\right\vert _{{\hat {\boldsymbol {x}}}_{k-1|k-1},{\boldsymbol {u}}_{k-1}}}
H
k
=
∂
h
∂
x
|
x
^
k
|
k
−
1
{\displaystyle {{\boldsymbol {H}}_{k}}=\left.{\frac {\partial h}{\partial {\boldsymbol {x}}}}\right\vert _{{\hat {\boldsymbol {x}}}_{k|k-1}}}
M
k
=
∂
h
∂
v
|
x
^
k
|
k
−
1
{\displaystyle {{\boldsymbol {M}}_{k}}=\left.{\frac {\partial h}{\partial {\boldsymbol {v}}}}\right\vert _{{\hat {\boldsymbol {x}}}_{k|k-1}}}
加性過程（additive process）同測量噪音嘅情況下可以睇作：
x
k
=
f
(
x
k
−
1
,
u
k
−
1
)
+
w
k
−
1
{\displaystyle {\boldsymbol {x}}_{k}=f({\boldsymbol {x}}_{k-1},{\boldsymbol {u}}_{k-1})+{\boldsymbol {w}}_{k-1}}
z
k
=
h
(
x
k
)
+
v
k
{\displaystyle {\boldsymbol {z}}_{k}=h({\boldsymbol {x}}_{k})+{\boldsymbol {v}}_{k}}
而
L
k
,
M
k
{\displaystyle {\boldsymbol {L}}_{k},{\boldsymbol {M}}_{k}}
戥線性嘅傳統卡曼濾波器 嘸同，擴展卡曼濾波器通常嘸係 最佳嘅估計器（若果測量同狀態轉換模型都係線性嘅就係最佳，因為喺種情況下擴展卡曼濾波器同常規濾波器係相同嘅）。此外，若果狀態嘅初始估計錯唨，或者個過程建模嘸正確，係噉個濾波器可能會由於個線性化處理而迅速發散。擴展卡曼濾波器嘅另一個問題係估計嘅協方差矩陣好多時係低估唨真正嘅協方差矩陣，係噉嘸去添加「穩定噪音」嘅話，有可能啲估計風險喺統計意義上會變得嘸一致 。
雖然係噉，擴展卡曼濾波器都可以提供到合理嘅表現，而且可以講係導航系統同 GPS 嘅 de facto 標準。
普適化 [ 編輯 ] 連續時間擴展卡曼濾波器 [ 編輯 ] 模型
x
˙
(
t
)
=
f
(
x
(
t
)
,
u
(
t
)
)
+
w
(
t
)
w
(
t
)
∼
N
(
0
,
Q
(
t
)
)
z
(
t
)
=
h
(
x
(
t
)
)
+
v
(
t
)
v
(
t
)
∼
N
(
0
,
R
(
t
)
)
{\displaystyle {\begin{aligned}{\dot {\mathbf {x} }}(t)&=f{\bigl (}\mathbf {x} (t),\mathbf {u} (t){\bigr )}+\mathbf {w} (t)&\mathbf {w} (t)&\sim {\mathcal {N}}{\bigl (}\mathbf {0} ,\mathbf {Q} (t){\bigr )}\\\mathbf {z} (t)&=h{\bigl (}\mathbf {x} (t){\bigr )}+\mathbf {v} (t)&\mathbf {v} (t)&\sim {\mathcal {N}}{\bigl (}\mathbf {0} ,\mathbf {R} (t){\bigr )}\end{aligned}}}
初始化
x
^
(
t
0
)
=
E
[
x
(
t
0
)
]
,
P
(
t
0
)
=
V
a
r
[
x
(
t
0
)
]
{\displaystyle {\hat {\mathbf {x} }}(t_{0})=E{\bigl [}\mathbf {x} (t_{0}){\bigr ]}{\text{, }}\mathbf {P} (t_{0})=Var{\bigl [}\mathbf {x} (t_{0}){\bigr ]}}
預測更新
x
^
˙
(
t
)
=
f
(
x
^
(
t
)
,
u
(
t
)
)
+
K
(
t
)
(
z
(
t
)
−
h
(
x
^
(
t
)
)
)
P
˙
(
t
)
=
F
(
t
)
P
(
t
)
+
P
(
t
)
F
(
t
)
⊤
−
K
(
t
)
H
(
t
)
P
(
t
)
+
Q
(
t
)
K
(
t
)
=
P
(
t
)
H
(
t
)
⊤
R
(
t
)
−
1
F
(
t
)
=
∂
f
∂
x
|
x
^
(
t
)
,
u
(
t
)
H
(
t
)
=
∂
h
∂
x
|
x
^
(
t
)
{\displaystyle {\begin{aligned}{\dot {\hat {\mathbf {x} }}}(t)&=f{\bigl (}{\hat {\mathbf {x} }}(t),\mathbf {u} (t){\bigr )}+\mathbf {K} (t){\Bigl (}\mathbf {z} (t)-h{\bigl (}{\hat {\mathbf {x} }}(t){\bigr )}{\Bigr )}\\{\dot {\mathbf {P} }}(t)&=\mathbf {F} (t)\mathbf {P} (t)+\mathbf {P} (t)\mathbf {F} (t)^{\top }-\mathbf {K} (t)\mathbf {H} (t)\mathbf {P} (t)+\mathbf {Q} (t)\\\mathbf {K} (t)&=\mathbf {P} (t)\mathbf {H} (t)^{\top }\mathbf {R} (t)^{-1}\\\mathbf {F} (t)&=\left.{\frac {\partial f}{\partial \mathbf {x} }}\right\vert _{{\hat {\mathbf {x} }}(t),\mathbf {u} (t)}\\\mathbf {H} (t)&=\left.{\frac {\partial h}{\partial \mathbf {x} }}\right\vert _{{\hat {\mathbf {x} }}(t)}\end{aligned}}}
戥離散時間擴展卡曼濾波器嘸同，預測𨂾同更新𨂾喺連續時間擴展卡曼濾波器度耦合到（coupled）。 [4]
離散時間測量 [ 編輯 ] 大多數物理系統都表示為連續時間模型，而離散時間測量經常透過數字處理器進行狀態估計。係噉，系統模型同測量模型由下式畀出
x
˙
(
t
)
=
f
(
x
(
t
)
,
u
(
t
)
)
+
w
(
t
)
w
(
t
)
∼
N
(
0
,
Q
(
t
)
)
z
k
=
h
(
x
k
)
+
v
k
v
k
∼
N
(
0
,
R
k
)
{\displaystyle {\begin{aligned}{\dot {\mathbf {x} }}(t)&=f{\bigl (}\mathbf {x} (t),\mathbf {u} (t){\bigr )}+\mathbf {w} (t)&\mathbf {w} (t)&\sim {\mathcal {N}}{\bigl (}\mathbf {0} ,\mathbf {Q} (t){\bigr )}\\\mathbf {z} _{k}&=h(\mathbf {x} _{k})+\mathbf {v} _{k}&\mathbf {v} _{k}&\sim {\mathcal {N}}(\mathbf {0} ,\mathbf {R} _{k})\end{aligned}}}
其中
x
k
=
x
(
t
k
)
{\displaystyle \mathbf {x} _{k}=\mathbf {x} (t_{k})}
初始化
x
^
0
|
0
=
E
[
x
(
t
0
)
]
,
P
0
|
0
=
E
[
(
x
(
t
0
)
−
x
^
(
t
0
)
)
(
x
(
t
0
)
−
x
^
(
t
0
)
)
T
]
{\displaystyle {\hat {\mathbf {x} }}_{0|0}=E{\bigl [}\mathbf {x} (t_{0}){\bigr ]},\mathbf {P} _{0|0}=E{\bigl [}\left(\mathbf {x} (t_{0})-{\hat {\mathbf {x} }}(t_{0})\right)\left(\mathbf {x} (t_{0})-{\hat {\mathbf {x} }}(t_{0})\right)^{T}{\bigr ]}}
預測
solve
{
x
^
˙
(
t
)
=
f
(
x
^
(
t
)
,
u
(
t
)
)
P
˙
(
t
)
=
F
(
t
)
P
(
t
)
+
P
(
t
)
F
(
t
)
⊤
+
Q
(
t
)
with
{
x
^
(
t
k
−
1
)
=
x
^
k
−
1
|
k
−
1
P
(
t
k
−
1
)
=
P
k
−
1
|
k
−
1
⇒
{
x
^
k
|
k
−
1
=
x
^
(
t
k
)
P
k
|
k
−
1
=
P
(
t
k
)
{\displaystyle {\begin{aligned}{\text{solve }}&{\begin{cases}{\dot {\hat {\mathbf {x} }}}(t)=f{\bigl (}{\hat {\mathbf {x} }}(t),\mathbf {u} (t){\bigr )}\\{\dot {\mathbf {P} }}(t)=\mathbf {F} (t)\mathbf {P} (t)+\mathbf {P} (t)\mathbf {F} (t)^{\top }+\mathbf {Q} (t)\end{cases}}\qquad {\text{with }}{\begin{cases}{\hat {\mathbf {x} }}(t_{k-1})={\hat {\mathbf {x} }}_{k-1|k-1}\\\mathbf {P} (t_{k-1})=\mathbf {P} _{k-1|k-1}\end{cases}}\\\Rightarrow &{\begin{cases}{\hat {\mathbf {x} }}_{k|k-1}={\hat {\mathbf {x} }}(t_{k})\\\mathbf {P} _{k|k-1}=\mathbf {P} (t_{k})\end{cases}}\end{aligned}}}
其中
F
(
t
)
=
∂
f
∂
x
|
x
^
(
t
)
,
u
(
t
)
{\displaystyle \mathbf {F} (t)=\left.{\frac {\partial f}{\partial \mathbf {x} }}\right\vert _{{\hat {\mathbf {x} }}(t),\mathbf {u} (t)}}
更新
K
k
=
P
k
|
k
−
1
H
k
⊤
(
H
k
P
k
|
k
−
1
H
k
⊤
+
R
k
)
−
1
{\displaystyle \mathbf {K} _{k}=\mathbf {P} _{k|k-1}\mathbf {H} _{k}^{\top }{\bigl (}\mathbf {H} _{k}\mathbf {P} _{k|k-1}\mathbf {H} _{k}^{\top }+\mathbf {R} _{k}{\bigr )}^{-1}}
x
^
k
|
k
=
x
^
k
|
k
−
1
+
K
k
(
z
k
−
h
(
x
^
k
|
k
−
1
)
)
{\displaystyle {\hat {\mathbf {x} }}_{k|k}={\hat {\mathbf {x} }}_{k|k-1}+\mathbf {K} _{k}{\bigl (}\mathbf {z} _{k}-h({\hat {\mathbf {x} }}_{k|k-1}){\bigr )}}
P
k
|
k
=
(
I
−
K
k
H
k
)
P
k
|
k
−
1
{\displaystyle \mathbf {P} _{k|k}=(\mathbf {I} -\mathbf {K} _{k}\mathbf {H} _{k})\mathbf {P} _{k|k-1}}
其中
H
k
=
∂
h
∂
x
|
x
^
k
|
k
−
1
{\displaystyle {\textbf {H}}_{k}=\left.{\frac {\partial h}{\partial {\textbf {x}}}}\right\vert _{{\hat {\textbf {x}}}_{k|k-1}}}
啲更新方程戥離散時間擴展卡曼濾波器相同。
高階擴展卡曼濾波器 [ 編輯 ] 上述遞歸係針對一階擴展卡曼濾波器。高階啲嘅 EKF 可以透過保留多啲嘅泰勒級數展開項嚟獲取。譬如，二階同三階 EKF經已得到描述。 [5]
隱式擴展卡曼濾波器 [ 編輯 ] 喺某啲情況下，非線性系統嘅觀測模型冇辦法求解得到
z
k
{\displaystyle {\boldsymbol {z}}_{k}}
隱函數 ：
h
(
x
k
,
z
′
k
)
=
0
{\displaystyle h({\boldsymbol {x}}_{k},{\boldsymbol {z'}}_{k})={\boldsymbol {0}}}
其中
z
k
=
z
′
k
+
v
k
{\displaystyle {\boldsymbol {z}}_{k}={\boldsymbol {z'}}_{k}+{\boldsymbol {v}}_{k}}
傳統嘅擴展卡曼濾波器可以做噉樣嘅替換： [6] [7]
R
k
←
J
k
R
k
J
k
T
{\displaystyle {{\boldsymbol {R}}_{k}}\leftarrow {{\boldsymbol {J}}_{k}}{{\boldsymbol {R}}_{k}}{{\boldsymbol {J}}_{k}^{T}}}
y
~
k
←
−
h
(
x
^
k
|
k
−
1
,
z
k
)
{\displaystyle {\tilde {\boldsymbol {y}}}_{k}\leftarrow -h({\hat {\boldsymbol {x}}}_{k|k-1},{\boldsymbol {z}}_{k})}
其中：
J
k
=
∂
h
∂
z
|
x
^
k
|
k
−
1
,
z
^
k
{\displaystyle {{\boldsymbol {J}}_{k}}=\left.{\frac {\partial h}{\partial {\boldsymbol {z}}}}\right\vert _{{\hat {\boldsymbol {x}}}_{k|k-1},{\hat {\boldsymbol {z}}}_{k}}}
當中個原始觀測協方差矩陣
R
k
{\displaystyle {{\boldsymbol {R}}_{k}}}
y
~
k
{\displaystyle {\tilde {\boldsymbol {y}}}_{k}}
H
k
{\displaystyle {{\boldsymbol {H}}_{k}}}
h
(
x
k
,
z
k
)
{\displaystyle h({\boldsymbol {x}}_{k},{\boldsymbol {z}}_{k})}
↑ Julier, S.J.; Uhlmann, J.K. (2004). "Unscented filtering and nonlinear estimation" (PDF) . Proceedings of the IEEE . 92 (3): 401–422. doi :10.1109/jproc.2003.823141 . S2CID 9614092 . ↑ Courses, E.; Surveys, T. (2006). Sigma-Point Filters: An Overview with Applications to Integrated Navigation and Vision Assisted Control . Nonlinear Statistical Signal Processing Workshop, 2006 IEEE . pp. 201–202. doi :10.1109/NSSPW.2006.4378854 . ISBN 978-1-4244-0579-4 S2CID 18535558 . ↑ 3.0 3.1 Simon, Dan (2006). Optimal State Estimation: Kalman, H Infinity, and Nonlinear Approaches . John Wiley & Sons. ISBN 978-0-471-70858-2 ↑ Brown, Robert Grover; Hwang, Patrick Y.C. (1997). Introduction to Random Signals and Applied Kalman Filtering 289 –293. ISBN 978-0-471-12839-7 ↑ Einicke, G.A. (2019). Smoothing, Filtering and Prediction: Estimating the Past, Present and Future (2nd ed.) . Amazon Prime Publishing. ISBN 978-0-6485115-0-2 ↑ Quan, Quan (2017). Introduction to multicopter design and control . Singapore: Springer. ISBN 978-981-10-3382-7 ↑ Zhang, Zhengyou (1997). "Parameter estimation techniques: a tutorial with application to conic fitting" (PDF) . Image and Vision Computing . 15 (1): 59–76. doi :10.1016/s0262-8856(96)01112-2 . ISSN 0262-8856 .
![{\displaystyle {\hat {\mathbf {x} }}(t_{0})=E{\bigl [}\mathbf {x} (t_{0}){\bigr ]}{\text{, }}\mathbf {P} (t_{0})=Var{\bigl [}\mathbf {x} (t_{0}){\bigr ]}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/afc225ee37e2c67dcd3a6669257defa0bf040ec1)
![{\displaystyle {\hat {\mathbf {x} }}_{0|0}=E{\bigl [}\mathbf {x} (t_{0}){\bigr ]},\mathbf {P} _{0|0}=E{\bigl [}\left(\mathbf {x} (t_{0})-{\hat {\mathbf {x} }}(t_{0})\right)\left(\mathbf {x} (t_{0})-{\hat {\mathbf {x} }}(t_{0})\right)^{T}{\bigr ]}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/daf406465b052a32900703385386f9e6bb7eb0a7)
