AI & ML
A Dynamic Generalized Kalman Consensus Filter for Switching Sensor Networks
arXiv eess.SY0 views
arXiv:2610.02055v3 Announce Type: replace Abstract: Distributed state estimation is critical for applications such as surveillance, autonomous navigation, and wide-area monitoring, where sensor agents must cooperatively track targets using only local measurements and neighbor-to-neighbor communication. Existing distributed filters have been shown to achieve accurate estimation even under sparse inter-agent communication and limited sensing ranges. However, many of these methods rely on consensus parameters that depend on global properties of the communication graph, such as the maximum degree of the graph, and are therefore sensitive to changes in network topology. This limitation is particularly significant in sensor networks with mobile agents, where communication links change over time. This paper presents a Dynamic Generalized Kalman Consensus Filter for target tracking in sensor networks with switching communication topologies. The proposed algorithm computes information-based consensus weights using only locally available quantities, eliminating the need for global network parameters. Numerical simulations demonstrate that the proposed algorithm maintains estimation accuracy under switching network topologies and outperforms existing distributed filters in the given tracking problem.
Source:https://arxiv.org/abs/2610.02055Related posts
Introducing the Grid Protectors Program
0OpenAI Blog
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch