Anti-Delay Kalman Filter Fusion Algorithm for Vehicle-borne Sensor Network with Finite-Time Convergence

Hang Yu, Keren Dai, Haojie Li, Yao Zou, Xiang Ma, Shaojie Ma, He Zhang

Abstract

Intelligent vehicles in autonomous driving and obstacle avoidance require precise relative state estimation. For vehicle-borne sensor networks with time-varying transmission delays, this paper proposes an anti-delay distributed Kalman filter (DKF) with finite-time convergence. By integrating a consensus strategy with buffer technology, the algorithm achieves optimal fusion in the sense of linear minimum variance. The approach accommodates practical constraints like communication weight coefficients and directed topologies. Theoretical proofs for error covariance upper bounds and maximum allowable delays are provided. Simulations and real-world experiments verify that the proposed FtDKF algorithm offers superior accuracy and robustness compared to existing methods.

Introduction

In autonomous driving, precision is paramount. Vehicles rely on sensor networks to track position, velocity, and acceleration. While centralized filtering is accurate, it introduces computational bottlenecks and single points of failure. Distributed Kalman Filters (DKF) allow nodes to perform local estimations and reach consensus via "gossip" protocols. However, real-world networks face two major hurdles: transmission delays and slow convergence. High-speed vehicles require reliable state estimates within a finite timeframe, a luxury not afforded by traditional asymptotic consensus algorithms.

Methodology: The Anti-delay FtDKF

The proposed Anti-delay Finite-time Distributed Kalman Filter (FtDKF) architecture rests on three pillars:

Buffer Technology

To neutralize the impact of out-of-order or delayed packets, each sensor node maintains a data buffer. This allows the system to store and re-order incoming neighbor data based on timestamps before fusion.

Buffer technology mechanism for handling transmission delays.

Finite-Time Consensus and Optimal Weighting

Unlike standard filters, this algorithm reaches the optimal fusion state in a finite number of iterations related to the network's diameter. It utilizes a matrix weighting approach based on linear minimum variance, ensuring that more "trustworthy" sensor data (with lower covariance) carries more weight.

Directed Topology Support

The algorithm is proven to work on strongly connected digraphs (unidirectional communication), which better reflects real-world V2X scenarios where signal paths may be blocked.

Experimental Validation

The researchers employed two validation methods:

  1. Numerical Simulation: A 12-sensor network tracked a target's state under varying transmission delays ($d_t = 1$ to $4$).
  2. Hardware Case-Study: Three 24G millimeter-wave radar sensors (Nanoradar SP25) tracked a mobile car at $T=0.01s$ intervals.

Key Results and Insights

The FtDKF consistently outperformed recent benchmarks, such as the 2020 work by Yang et al.

MSE comparison between the proposed FtDKF and existing benchmarks.
  • Superior Accuracy: As shown in the Mean Squared Error (MSE) plots, the proposed algorithm maintains significantly lower error across position ($s$), velocity ($\dot{s}$), and acceleration ($\ddot{s}$).
  • Stability Under Delay: While competing algorithms experienced error spikes as delays increased, the FtDKF remained stable.
  • Maximum Delay Boundary: A key contribution is the derivation of the maximum allowable delay a network can tolerate before accuracy degrades beyond acceptable thresholds.

Conclusion and Future Work

The FtDKF provides "global-level" accuracy without the centralized computational burden, making it highly suitable for practical vehicle applications. Future research will focus on extending the framework to non-linear system dynamics (e.g., EKF/UKF) to handle emergency maneuvers and investigating scalability for massive vehicle platoons.

Summary updated

Abstract

Intelligent vehicles in autonomous driving and obstacle avoidance, the precise relative state of vehicles put forward a higher demand. For a vehicle-borne sensor network with time-varying transmission delays, the problem of coordinate fusion of vehicle state is the focus of this paper. By the ingeniously designed low-complexity integration with a consensus strategy and buffer technology, an anti-delay distributed Kalman filter (DKF) with finite-time convergence is proposed.By introducing the matrix weight to assess local estimates, the optimal fusion state result is available in the sense of linear minimum variance. In addition, to accommodate practical engineering in intelligent vehicles, the communication weight coefficient and directed topology with unidirectional transmission are also considered. From a theoretical perspective, the proof of error covariances upper bounds with different communication topologies with delays are presented. Furthermore, the maximum allowable delays of vehicle-borne sensor network is derived backwards. Simulations verify that while considering various non-ideal factors above, the proposed DFK algorithm produces more accurate and robust fusion estimation state results than existing algorithms, making it more valuable in practical applications. Simultaneously, a mobile car trajectory tracking experiment is carried out, which further verifies the feasibility of the proposed algorithm.
BibTeX
@misc{yu2022anti,
  author = {Hang Yu and Keren Dai and Haojie Li and Yao Zou and Xiang Ma and Shaojie Ma and He Zhang},
  title = {{Anti-Delay Kalman Filter Fusion Algorithm for Vehicle-borne Sensor Network with Finite-Time Convergence}},
  year = {2022},
  eprint = {2209.12666},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2209.12666},
}
Figure