State Estimation With Trajectory Shape Constraints Using Pseudomeasurements
Bibliographic record
Abstract
In this paper, a trajectory shape constraint on target motion is investigated, and the corresponding state estimation method is presented. This type of constraint occurs when only the shape of the target trajectory is known a priori, without any other necessary information to exactly describe the specific trajectory. For example, one may only know that the target moves along a straight line. This prior knowledge of trajectory can be considered as a constraint to improve tracking performance. To describe the shape constraint arising from the straight line assumption, the state vector is augmented by the states at previous time steps. This facilitates the description of the shape constraint using the components of the state vector. Pseudomeasurements are then constructed based on these relationships to incorporate the constraint into an estimation process to improve the performance. The redundancy of the complete set of pseudomeasurements for a given augmented state vector is analyzed, and the minimal set of pseudomeasurements, which describes the constraint exactly, is proposed. The time evolution equation for the augmented state and the measurement equation using the minimal pseudomeasurement set are formulated. A trajectory shape constraint Kalman filter (TSCKF) is then proposed for simultaneous filtering and smoothing. Since both the measurement vector and the state vector are high dimensional, the cubature Kalman filter is used in the proposed TSCKF to deal with the strong nonlinearity in this problem. Monte Carlo simulations illustrate the effectiveness of the proposed TSCKF and the improvement in both filtering and smoothing accuracies by incorporating the trajectory shape constraint.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".