Distributed Kalman Filtering Via Gradual Information Fusion

preprint OA: closed
Full text JSON View at publisher
Full text 2,341 characters · extracted from oa-doi-fallback · 2 sections · click to expand

Abstract

In this paper, we consider the distributed Kalman filtering problem over sensor networks with a finite number of sensor nodes where each node can communicate only with its neighboring nodes. We first introduce the concept of gradual information fusion estimation (GIFE) and propose an algorithm for computing the GIFE that can obtain performance improvement via reducing estimation error covariance. Also, we prove that the GIFE can be expressed as a weighted sum of local estimates. Then, based on the results of GIFE and some results proposed in this paper, two distributed Kalman filters are developed where, at time step k, each node is allowed to communicate with its neighboring nodes at most once in the first filter and each node is permitted to communicate with its neighboring nodes twice in the second filter. In addition, we prove that either of the two proposed distributed Kalman filters is unbiased and the estimation error covariance of the first distributed Kalman filter is less than or equal to that without using information fusion estimation. We prove that the estimation error covariance of the second distributed Kalman filter is less than or equal to that of any local estimate belonging to a set. An example of unmanned ground vehicle is provided to illustrate the performance of the two proposed distributed Kalman filters. Supplementary Material File (manuscript.pdf) - Download - 552.48 KB Information & Authors Information Version history Copyright This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Keywords

Authors Metrics & Citations Metrics Article Usage 91views 65downloads Citations Download citation Wei Liu. Distributed Kalman Filtering Via Gradual Information Fusion. Authorea. 30 March 2026. DOI: https://doi.org/10.22541/au.177490714.48378561/v1 DOI: https://doi.org/10.22541/au.177490714.48378561/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu.

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-doi-fallback

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00