MétaCan
Menu
Back to cohort
Record W2155682648 · doi:10.1109/ific.2000.859866

Sensor data fusion using Kalman filter

2000· article· en· W2155682648 on OpenAlexaff
Jurek Z. Sąsiadek, P. Hartana

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer visionOdometrySensor fusionKalman filterExtended Kalman filterComputer scienceSonarArtificial intelligenceMobile robotSIGNAL (programming language)RobotSimultaneous localization and mapping

Abstract

fetched live from OpenAlex

Autonomous robots and vehicles need accurate positioning and localization for their guidance, navigation and control. Often, two or more different sensors are used to obtain reliable data useful for control systems. The paper presents the data fusion system for mobile robot navigation. Odometry and sonar signals are fused using an Extended Kalman Filter (EKF) and Adaptive Fuzzy Logic System (AFLS). The signals used during navigation cannot be always considered as white noise signals. On the other hand, colored signals will cause the EKF to diverge. The AFLS was used to adapt the gain and therefore prevent Kalman filter divergence. The fused signal is more accurate than any of the original signals considered separately. The enhanced more accurate signal is used to guide and navigate the robot.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.090
GPT teacher head0.305
Teacher spread0.215 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations120
Published2000
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207