2023
DOI: 10.1007/s00034-023-02437-9
|View full text |Cite
|
Sign up to set email alerts
|

Low-Complexity Square-Root Unscented Kalman Filter Design Methodology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 51 publications
0
0
0
Order By: Relevance
“…This is achieved through direct recursion updating in the form of the square root of the covariance matrix. Moreover, this approach guarantees the non-negativity of the covariance matrix, effectively prevents filter divergence, and fosters the convergence speed and numerical stability of the filter [35].…”
Section: Square Root Unscented Kalman Filtermentioning
confidence: 99%
“…This is achieved through direct recursion updating in the form of the square root of the covariance matrix. Moreover, this approach guarantees the non-negativity of the covariance matrix, effectively prevents filter divergence, and fosters the convergence speed and numerical stability of the filter [35].…”
Section: Square Root Unscented Kalman Filtermentioning
confidence: 99%