Cubature Kalman Filtering for Continuous-Discrete Systems: Theory and Simulations
Bibliographic record
Abstract
In this paper, we extend the cubature Kalman filter (CKF) to deal with nonlinear state-space models of the continuous-discrete kind. To be consistent with the literature, the resulting nonlinear filter is referred to as the continuous-discrete cubature Kalman filter (CD-CKF). We use the Itô-Taylor expansion of order 1.5 to transform the process equation, modeled in the form of stochastic ordinary differential equations, into a set of stochastic difference equations. Building on this transformation and assuming that all conditional densities are Gaussian-distributed, the solution to the Bayesian filter reduces to the problem of how to compute Gaussian-weighted integrals. To numerically compute the integrals, we use the third-degree cubature rule. For a reliable implementation of the CD-CKF in a finite word-length machine, it is structurally modified to propagate the square-roots of the covariance matrices. The reliability and accuracy of the square-root version of the CD-CKF are tested in a case study that involves the use of a radar problem of practical significance; the problem considered herein is challenging in the context of radar in two respects- high dimensionality of the state and increasing degree of nonlinearity. The results, presented herein, indicate that the CD-CKF markedly outperforms existing continuous-discrete filters.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".