A Novel Kalman Filter with State Constraint Approach for the Integration of Multiple Pedestrian Navigation Systems
Bibliographic record
Abstract
Numerous solutions/methods to solve the existing problems of pedestrian navigation/localization have been proposed in the last decade by both industrial and academic researchers. However, to date there are still major challenges for a single pedestrian navigation system (PNS) to operate continuously, robustly, and seamlessly in all indoor and outdoor environments. In this paper, a novel method for pedestrian navigation approach to fuse the information from two separate PNSs is proposed. When both systems are used at the same time by a specific user, a nonlinear inequality constraint between the two systems’ navigation estimates always exists. Through exploring this constraint information, a novel filtering technique named Kalman filter with state constraint is used to diminish the positioning errors of both systems. The proposed method was tested by fusing the navigation information from two different PNSs, one is the foot-mounted inertial navigation system (INS) mechanization-based system, the other PNS is a navigation device that is mounted on the user’s upper body, and adopting the pedestrian dead reckoning (PDR) mechanization for navigation update. Monte Carlo simulations and real field experiments show that the proposed method for the integration of multiple PNSs could improve each PNS’ navigation performance.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| 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.001 |
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".